Multilevel reverse most-significant carry computation

A fast calculation of the most-significant carry in an addition is required in several applications. It has been proposed to calculate this carry by detecting the most-significant carry chain and collecting the carry after this chain. The detection can be implemented by a prefix tree of AND gates and the collecting by a multi-input OR. We propose a multilevel implementation, which allows the overlap of successive levels, thereby reducing the overall delay. For 64-bit operands we estimate a delay reduction of about 15% with respect to the traditional carry-lookahead-based method, with a similar hardware complexity.

[1]  S. Vassiliadis,et al.  S/370 sign-magnitude floating-point adder , 1989 .

[2]  D. N. Jayasimha,et al.  The half-adder form and early branch condition resolution , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[3]  Javier D. Bruguera,et al.  Multilevel reverse-carry computation for comparison and for sign and overflow detection in addition , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).