Referenced Items are not available for this document.
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.
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:29
,
Issue:
10
)
Date of Publication: Oct. 2010
- Page(s):
- 1655 - 1659
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 11534196
- Digital Object Identifier :
- 10.1109/TCAD.2010.2052391
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 20 September 2010
- Issue Date :
- Oct. 2010
- Sponsored by :
- IEEE Council on Electronic Design Automation
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
