The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1996 vol.45)
pp: 340-347
ABSTRACT
<p><b>Abstract</b>—Addition techniques are divided into <it>fixed-time</it> and <it>variable-time</it> ones. While variable time techniques can achieve log<sub>2</sub>(<it>N</it>) average addition time for <it>N</it>-bit operands, the hardware overhead have always made fixed-time adders preferable, such as Carry Lookahead and Carry Select.</p><p>We present a new variable-time addition technique whose average delay is much lower than log<sub>2</sub>(<it>N</it>) and whose overhead is lower than the one of a CLA adder. The new approach is made feasible by a proper application of VLSI dynamic logic design. We show the mathematical proof, the logic implementation, and the VLSI realization of the new adder. We report circuit simulation results and their comparison with the analytical model.</p>
INDEX TERMS
Self-timed systems, computer arithmetic, asynchronous circuits, VLSI design, completion detecting units.
CITATION
Alessandro De Gloria, Mauro Olivieri, "Statistical Carry Lookahead Adders", IEEE Transactions on Computers, vol.45, no. 3, pp. 340-347, March 1996, doi:10.1109/12.485572
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool