Search

نمایش تعداد 1-8 از 8

Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a, b)$ -Way Karatsuba Algorithm”

نوع: Journal Paper

نویسنده : Chiou-Yng Lee; Pramod Kumar Meher

سال: 2016

Request PDF

A High-Performance FIR Filter Architecture for Fixed and Reconfigurable Applications

نوع: Journal Paper

نویسنده : Basant Kumar Mohanty; Pramod Kumar Meher

سال: 2016

Request PDF

Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$-Way Karatsuba Algorithm

نوع: Journal Paper

نویسنده : Chiou-Yng Lee; Pramod Kumar Meher

سال: 2015

Request PDF

Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of $GF(2^{m})$ Using Symmetric TMVP and Block Recombination Techniques

نوع: Journal Paper

نویسنده : Chiou-Yng Lee; Pramod Kumar Meher

سال: 2015

Request PDF

Area-Delay Efficient Digit-Serial Multiplier Based on $k$ -Partitioning Scheme Combined With TMVP Block Recombination Approach

نوع: Journal Paper

نویسنده : Chiou-Yng Lee; Pramod Kumar Meher; Chung-Hsin Liu

سال: 2016

Request PDF

Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach

نوع: Journal Paper

نویسنده : Chung-Hsin Liu; Chiou-Yng Lee; Pramod Kumar Meher

سال: 2015

Request PDF

Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields

نوع: Journal Paper

نویسنده : Jeng-Shyang Pan; Chiou-Yng Lee; Pramod Kumar Meher

سال: 2013

Request PDF

Low-Complexity Digit-Serial Multiplier Over $GF(2^{m})$ Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition

نوع: Journal Paper

نویسنده : Chiou-Yng Lee; Pramod Kumar Meher; Chia-Chen Fan; Shyan-Ming Yuan

سال: 2017

Request PDF

Search

Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a, b)$ -Way Karatsuba Algorithm”

A High-Performance FIR Filter Architecture for Fixed and Reconfigurable Applications

Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$-Way Karatsuba Algorithm

Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of $GF(2^{m})$ Using Symmetric TMVP and Block Recombination Techniques

Area-Delay Efficient Digit-Serial Multiplier Based on $k$ -Partitioning Scheme Combined With TMVP Block Recombination Approach

Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach

Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields

Low-Complexity Digit-Serial Multiplier Over $GF(2^{m})$ Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition

نویسنده

سال

نوع

زبان

نوع محتوا

عنوان ناشر

Search

Filters

Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a, b)$ -Way Karatsuba Algorithm”

A High-Performance FIR Filter Architecture for Fixed and Reconfigurable Applications

Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$-Way Karatsuba Algorithm

Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of $GF(2^{m})$ Using Symmetric TMVP and Block Recombination Techniques

Area-Delay Efficient Digit-Serial Multiplier Based on $k$ -Partitioning Scheme Combined With TMVP Block Recombination Approach

Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach

Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields

Low-Complexity Digit-Serial Multiplier Over $GF(2^{m})$ Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition