High-speed parallel-prefix VLSI Ling adders
- 10 January 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 54 (2) , 225-231
Abstract
Parallel-prefix adders offer a highly efficient solution to the binary addition problem and are well-suited for VLSI implementations. A novel framework is introduced, which allows the design of parallel-prefix Ling adders. The proposed approach saves one-logic level of implementation compared to the parallel-prefix structures proposed for the traditional definition of carry lookahead equations and reduces the fanout requirements of the design. Experimental results reveal that the proposed adders achieve delay reductions of up to 14 percent when compared to the fastest parallel-prefix architectures presented for the traditional definition of carry equations.Keywords
This publication has 18 references indexed in Scilit:
- Ling adders in CMOS standard cell technologies2003
- A family of adders2003
- Intermediate variable encodings that enable multiplexor-based implementations of two operand addition2003
- A sub-nanosecond 0.5 μm 64 b adder design2002
- The design of hybrid carry-lookahead/carry-select addersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2002
- A fast hybrid carry-lookahead/carry-select adder design2001
- High-speed addition in CMOSIEEE Transactions on Computers, 1992
- Recursive equations for hardwired binary addersInternational Journal of Electronics, 1989
- Fast area-efficient VLSI adders1987
- A Regular Layout for Parallel AddersIEEE Transactions on Computers, 1982