Skip to Main Content
End-around-carry (EAC) adder is extensively used in microprocessor's floating-point units. This paper presents an algebraic characterization of an EAC adder's algorithm. A novel symbolic analysis approach is presented to prove the EAC adder's correctness. Algebraic structures and first-order recursive equations are harnessed in proof derivations. A hybrid prefix/EAC architecture is considered.
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on (Volume:29 , Issue: 10 )
Date of Publication: Oct. 2010