A comparison between adders with new defined carries and traditional schemes for addition

ABSTRACT Binary adders are traditionally designed using the two techniques of carry-look-ahead and rippling the carry, applied to the well-known recursive formulas for the addition. The design of the carries determines the overall performance, since the carry terms are the longest resulting paths in the hardware implementation of the binary adders. A new carry has been defined intended to improve the carry look-ahead process. This study compares the recursive formulas for the new defined carry to the traditional carry equations and describes the advantages in using the new-carry equations instead of the traditional ones