Generalized earliest-first fast addition algorithm
| dc.citation.epage | 1242 | en_US |
| dc.citation.issue | 10 | en_US |
| dc.citation.spage | 1233 | en_US |
| dc.citation.volume | 52 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | Yeh, WC | en_US |
| dc.contributor.author | Jen, CW | en_US |
| dc.contributor.department | 電子工程學系及電子研究所 | zh_TW |
| dc.contributor.department | Department of Electronics Engineering and Institute of Electronics | en_US |
| dc.date.accessioned | 2014-12-08T15:40:17Z | |
| dc.date.available | 2014-12-08T15:40:17Z | |
| dc.date.issued | 2003-10-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1109/TC.2003.1234522 | en_US |
| dc.identifier.issn | 0018-9340 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON COMPUTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TC.2003.1234522 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/27508 | |
| dc.identifier.wosnumber | WOS:000185519500001 | |
| dc.language.iso | en_US | en_US |
| dc.subject | carry-propagation adder | en_US |
| dc.subject | final adder | en_US |
| dc.subject | carry-lookahead | en_US |
| dc.subject | conditional-sum | en_US |
| dc.title | Generalized earliest-first fast addition algorithm | en_US |
| dc.type | Article | en_US |