This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS
April 2007 (vol. 56 no. 4)
pp. 572-576
R.A. Patel, IEEE
Efficient modular adder architectures are invaluable to the design of residue number system (RNS)-based digital systems. For example, they are used to perform residue encoding and decoding, modular multiplication, and scaling. This work is a first in the literature on modulo 2^{n}-(2^{n - 2} + 1) addition. The algebraic properties of such moduli are exploited in the derivation of the proposed fast adder architecture. Actual VLSI implementations using 130nm CMOS technology show that our adder significantly outperforms the most competitive generic modular adder design over the entirety of the power-delay-area space.
Index Terms:
Computer arithmetic, modular adder, parallel-prefix adder, residue number system, VLSI.
Citation:
R.A. Patel, M. Benaissa, S. Boussakta, "Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS," IEEE Transactions on Computers, vol. 56, no. 4, pp. 572-576, April 2007, doi:10.1109/TC.2007.1001
Usage of this product signifies your acceptance of the Terms of Use.