4.5 Article

A Reduced Complexity Wallace Multiplier Reduction

Journal

IEEE TRANSACTIONS ON COMPUTERS
Volume 59, Issue 8, Pages 1134-1137

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TC.2010.103

Keywords

High-speed multiplier; Wallace multiplier; Dadda multiplier

Ask authors/readers for more resources

Wallace high-speed multipliers use full adders and half adders in their reduction phase. Half adders do not reduce the number of partial product bits. Therefore, minimizing the number of half adders used in a multiplier reduction will reduce the complexity. A modification to the Wallace reduction is presented that ensures that the delay is the same as for the conventional Wallace reduction. The modified reduction method greatly reduces the number of half adders; producing implementations with 80 percent fewer half adders than standard Wallace multipliers, with a very slight increase in the number of full adders.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available