Abstract

Binary carry-propagating addition can be efficiently expressed as a prefix computation. Several examples of adders based on such a formulation have been published, and efficient implementations are numerous. Chief among the known constructions are those of Kogge & Stone and Ladner & Fischer. In this work we show that these are end cases of a large family of addition structures, all of which share the attractive property of minimum logical depth. The intermediate structures allow trade-offs between the amount of internal wiring and the fanout of intermediate nodes, and can thus usually achieve a more attractive combination of speed and area/power cost than either of the known end-cases. Rules for the construction of such adders are given, as are examples of realistic 32b designs implemented in an industrial 0u25 CMOS process. 1. Introduction There are many ways of formulating the process of binary addition. Each different way provides different insight and thus suggests different impl...

Citations

259	Parallel prefix computation - Ladner, Fischer - 1980
145	A regular layout for parallel adders - Brent, Kung - 1982
139	A parallel algorithm for the efficient solution of a general class of recurrence equations - Kogge, Stone - 1973
33	Conditional-sum addition logic - Sklansky - 1960
30	On the algorithmic complexity of discrete functions - Ofman - 1963
23	Carry-Select Adder - Bedrij - 1962
5	The Redundant Cell Adder - Lynch, Swartzlander - 1991
3	A high-speed electronic arithmetic unit for automatic computing machines - Nadler - 1956
2	Designing Addition Circuits - Knowles
2	J.L Smith; `A Logic for High-Speed Addition - Weinberger - 1958
1	Computer Arithmetic Systems' ISBN - Omondi - 1994
1	Fast Area-Efficient VLSI Adders' 8th - Han, Carlson
1	A New Architecture for Automatic Generation of Fast Pipelined Adders - Kowalczuk, Tudor, et al.
1	A GaAs 32-bit Adder' 13 th Symp - Beaumont-Smith, Burgess