2000
DOI: 10.1109/12.863039
|View full text |Cite
|
Sign up to set email alerts
|

High-speed Booth encoded parallel multiplier design

Abstract: ÐThis paper presents a design methodology for high-speed Booth encoded parallel multiplier. For partial product generation, we propose a new modified Booth encoding (MBE) scheme to improve the performance of traditional MBE schemes. For final addition, a new algorithm is developed to construct multiple-level conditional-sum adder (MLCSMA). The proposed algorithm can optimize final adder according to the given cell properties and input delay profile. Compared with a binary tree-based conditional-sum adder, the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 197 publications
(9 citation statements)
references
References 20 publications
0
9
0
Order By: Relevance
“…Generally, hardware multiplier adds partial products to complete the multiplication. For N-bit multiplication, there are N 2 partial products in the array multiplier [41]. When N becomes large, the adder tree will become complex, which subsequently increases area, time delay, and power consumption.Therefore, a growing number of novel algorithms like the Booth algorithm and optimized adder trees such as Wallace adder tree and Baugh-Wooley have been proposed to accelerate the multiplication speed.…”
Section: Booth Multipliermentioning
confidence: 99%
“…Generally, hardware multiplier adds partial products to complete the multiplication. For N-bit multiplication, there are N 2 partial products in the array multiplier [41]. When N becomes large, the adder tree will become complex, which subsequently increases area, time delay, and power consumption.Therefore, a growing number of novel algorithms like the Booth algorithm and optimized adder trees such as Wallace adder tree and Baugh-Wooley have been proposed to accelerate the multiplication speed.…”
Section: Booth Multipliermentioning
confidence: 99%
“…Fig. 2(c) depicts the contribution of spurious activities from both PPG and adder-tree of an 8-and 16-bit conventional Booth multipliers [27]. Note that these adder-trees were constructed utilizing full adders.…”
Section: B Spurious Activity Generationmentioning
confidence: 99%
“…The Booth multiplier has also been subjected to structural and gate-level optimizations in literature. A more regular partial product array [15], [16], [27] was proposed to minimize the extra adder rows for carry summation. The approach in [27] has improved the multiplier performance by 25% when compared with the conventional implementations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We designed both conventional Booth multipliers and the proposed multiplier using Verilog HDL and verified the functionality for all the cases. The conventional Booth multiplier was designed in accordance with the study performed by Wen-Chang and Chein-Wei [7]. Each multiplier was built and optimized by Synopsys Design Compiler using CMOS libraries with constraints of maximum frequency in 32-nm processes by the Synopsys Armenia Educational Department.…”
Section: Methodsmentioning
confidence: 99%