Issue No. 12 - December (2002 vol. 51)
ISSN: 0018-9340
pp: 1389-1399
ABSTRACT
<p><b>Abstract</b>—This paper presents two new design methodologies for modulo 2^n + 1 addition in the diminished-one number system. The first design methodology leads to carry look-ahead, whereas the second to parallel-prefix adder implementations. VLSI realizations of the proposed circuits in a standard-cell technology are utilized for quantitative comparisons against the existing solutions. Our results indicate that the proposed carry look-ahead adders are area and time efficient for small values of n, while for the rest values of n the proposed parallel-prefix adders are considerably faster than any other already known in the open literature.</p>
INDEX TERMS
Modulo $\big. 2^{\rm n}+1\bigr.$ addition, carry look-ahead addition, parallel-prefix adders, diminished-one number representation, VLSI adders.
CITATION
Costas Efstathiou, Dimitris Nikolos, Haridimos T. Vergos, "Diminished-One Modulo 2^n +1 Adder Design", IEEE Transactions on Computers, vol. 51, no. , pp. 1389-1399, December 2002, doi:10.1109/TC.2002.1146705