The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2003 vol.52)
pp: 1233-1242
ABSTRACT
<p><b>Abstract</b>—This paper presents a generalized earliest-first (GEF) addition algorithm to accelerate carry propagation addition (CPA). A set of operators and notations have been developed to describe and analyze traditional carry-lookahead or conditional-sum-based algorithms. The proposed GEF algorithm schedules bit-level operations of CPA in an earliest-first manner to reduce the overall latency. With the aid of the developed operators and notations, the algorithm can be generalized to any algorithm based on carry-lookahead or conditional-sum rule. An adder generated by using the GEF algorithm outperforms traditional algorithms when inputs do not arrive simultaneously.</p>
INDEX TERMS
Carry-propagation adder, final adder, carry-lookahead, conditional-sum.
CITATION
Wen-Chang Yeh, "Generalized Earliest-First Fast Addition Algorithm", IEEE Transactions on Computers, vol.52, no. 10, pp. 1233-1242, October 2003, doi:10.1109/TC.2003.1234522
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool