Variable delay ripple carry adder with carry chain interrupt detection

Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination detection is used in this article to obtain efficient implementations for large operands. The completion detection logic is described and the efficiency of the approach is shown and analyzed analytically and through computer simulations. The technique is based on area and routing efficient ripple carry adders, which is are especially desirable properties for very long word length.

• Type: Conference
• Year: 2003
• Where: ISCAS
• Authors: Andreas Burg, Frank K. Gürkaynak, Hubert Kaeslin, Wolfgang Fichtner
• Keywords: Early Termination Detection, Efficient Implementations, ISCAS 2003, Ripple Carry Adders