Area, Delay, and Energy-Efficient Full Dadda Multiplier
Muteen Munawar, Zain Shabbir, Muhammad Akram

TL;DR
This paper introduces a modified Dadda multiplier with a half-adder-based carry-select adder and an improved ripple-carry adder, achieving faster operation with lower power consumption across various technologies and frequencies.
Contribution
A novel modified Dadda multiplier design that enhances speed and energy efficiency using a new adder architecture and binary to excess-1 converter.
Findings
Consumes 25uW power at 3.33GHz in 50nm technology
Faster operation with reduced transistor count
More power-energy-efficient than related works
Abstract
The Dadda algorithm is a parallel structured multiplier, which is quite faster as compared to array multipliers, i.e., Booth, Braun, Baugh-Wooley, etc. However, it consumes more power and needs a larger number of gates for hardware implementation. In this paper, a modified-Dadda algorithm-based multiplier is designed using a proposed half-adder-based carry-select adder with a binary to excess-1 converter and an improved ripple-carry adder (RCA). The proposed design is simulated in different technologies, i.e., Taiwan Semiconductor Manufacturing Company (TSMC) 50nm, 90nm, and 120nm, and on different GHz frequencies, i.e., 0.5, 1, 2, and 3.33GHz. Specifically, the 4-bit circuit of the proposed design in TSMCs 50nm technology consumes 25uW of power at 3.33GHz with 76ps of delay. The simulation results reveal that the design is faster, more power-energy-efficient, and requires a smaller…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
