A new redundant binary Booth encoding for fast 2^n-bit multiplier design
The use of redundant binary (RB) arithmetic in the design of high-speed digital multipliers is beneficial due to its high modularity and carry-free addition. To reduce the number of partial products, a high-radix-modified Booth encoding algorithm is...
Saved in:
Main Authors: | He, Yajuan, Chang, Chip Hong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91940 http://hdl.handle.net/10220/6242 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Design and analysis of redundant binary booth multipliers
by: He, Ya Juan
Published: (2010) -
Design of a 54x54-bit multiplier using radix-16 redundant binary booth encoding
by: Soh, Sing Yu.
Published: (2008) -
Area-saving technique for low-error redundant binary fixed-width multiplier implementation
by: Juang, Tso Bing, et al.
Published: (2010) -
A power-delay efficient hybrid carry-lookahead/carry-select based redundant binary to two’s complement converter
by: He, Yajuan, et al.
Published: (2010) -
High speed multiplier IC design based on booth algorithm
by: Chang, Shuming
Published: (2023)