Addition techniques are divided into fixed-time and variable-time ones. While variable time techniques can achieve log(2)(N) average addition time for N-bit operands, the hardware overhead have always made fixed-time adders preferable, such as Carry Lookahead and Carry Select. We present a new variable-time addition technique whose average delay is much lower than log(2)(N) 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.
Statistical carry lookahead adders / A., Degloria; Olivieri, Mauro. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 45:3(1996), pp. 340-347. [10.1109/12.485572]
Statistical carry lookahead adders
OLIVIERI, Mauro
1996
Abstract
Addition techniques are divided into fixed-time and variable-time ones. While variable time techniques can achieve log(2)(N) average addition time for N-bit operands, the hardware overhead have always made fixed-time adders preferable, such as Carry Lookahead and Carry Select. We present a new variable-time addition technique whose average delay is much lower than log(2)(N) 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
