Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
From MaRDI portal
Publication:2507343
DOI10.1016/j.compeleceng.2005.09.002zbMath1103.94036OpenAlexW2037022450MaRDI QIDQ2507343
Che Wun Chiou, Chiou-Yng Lee, Jim-Min Lin
Publication date: 10 October 2006
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.compeleceng.2005.09.002
trinomialsdual basispolynomial basisfinite field multiplicationall one polynomialequally spaced polynomialBooth's algorithm
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Radix representation; digital problems (11A63)
Related Items
Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)