.png){kind=icon}
.png){kind=icon}
Return
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2005.09.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
New bit-parallel dual basis multipliers using the modified Booth's algorithm are presented. Due to the advantage of the modified Booth's algorithm, two bits are processed in parallel for reduction of both space and time complexities. A multiplexer-based structure has been proposed for realization of the proposed multiplication algorithm. We have shown that our multiplier saves about 9% space complexity as compared to other existing multipliers if the generating polynomial is trinomial or all one polynomial. Furthermore, the proposed multiplier is faster than existing multipliers. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
dual basis
finite field multiplication
Booth's algorithm
trinomials
polynomial basis
all one polynomial
equally spaced polynomial
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
No organization information available