The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2004 vol.53)
pp: 1211-1216
ABSTRACT
Modulo 2^n+1 adders find great applicability in several applications including RNS implementations and cryptography. In this paper, we present two novel architectures for designing modulo 2^n+1 adders, based on parallel-prefix carry computation units. The first architecture utilizes a fast carry increment stage, whereas the second is a totally parallel-prefix solution. CMOS implementations reveal the superiority of the resulting adders against previously reported solutions in terms of implementation area and execution latency.
INDEX TERMS
Binary adders, modulo 2^n+1 arithmetic, parallel-prefix adders, RNS.
CITATION
Costas Efstathiou, Haridimos T. Vergos, Dimitris Nikolos, "Fast Parallel-Prefix Modulo 2^n+1 Adders", IEEE Transactions on Computers, vol.53, no. 9, pp. 1211-1216, September 2004, doi:10.1109/TC.2004.60
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool