Paper
3 September 2008 Optimization of the final adder stage of fast multipliers
Sean Laughlin, Sabrina Smith, Paul Zucknick, Earl E. Swartzlander Jr.
Author Affiliations +
Abstract
Fast multipliers consist of an array of AND gates, a bit reduction stage, and a final two-operand addition. There are three widely recognized types of fast multipliers: Wallace, Dadda, and reduced area. These multipliers are distinguished by their techniques for the bit reduction stage; however, little research has been invested in the optimization of the final addition stage. This paper presents an approach for investigating the optimal final adder structure for the three types of fast multipliers. Multiple designs are characterized using the Virginia Tech 0.25 μm TSMC standard cell library and Synopsys Design Vision to determine area, power consumption, and critical delay compared with a traditional carry look ahead adder. A figure of merit that includes these measurements is used to compare the performance of the proposed adders. Although this analysis neglects loading, interconnect, and several other parameters that are needed to accurately model the multipliers in a modern VLSI process technology, the results obtained using the figure of merit suggest that the final adder in each of the three fast multipliers can indeed be optimized.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sean Laughlin, Sabrina Smith, Paul Zucknick, and Earl E. Swartzlander Jr. "Optimization of the final adder stage of fast multipliers", Proc. SPIE 7074, Advanced Signal Processing Algorithms, Architectures, and Implementations XVIII, 70740L (3 September 2008); https://doi.org/10.1117/12.794300
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Logic

Picosecond phenomena

Very large scale integration

Multiplexers

Visual process modeling

Capacitance

Computer engineering

RELATED CONTENT

An Ultra-Fast SBNR Divider
Proceedings of SPIE (May 17 1989)
Automated synthesis of Dadda multipliers
Proceedings of SPIE (October 26 2004)
Systolic Array Processor Implementation
Proceedings of SPIE (July 30 1982)
Data path allocation for low power in high-level synthesis
Proceedings of SPIE (October 24 2000)
Optimization of spanning tree adders
Proceedings of SPIE (August 25 2006)

Back to Top