loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Conference on Information Technology: New Generations (ITNG'06)
Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1
Las Vegas, Nevada
April 10-April 12
ISBN: 0-7695-2497-4
Kooroush Manochehri, Amirkabir University of Technology, Iran
Saadat Pourmozafari, Amirkabir University of Technology, Iran
Babak Sadeghian, Amirkabir University of Technology, Iran
Modulo 2^n+1 and 2^n-1 multiplication plays an important role in residue number systems. In this paper two efficient methods for converting the input number to these moduli are presented. One of them has less area than the other but the second one has more processing speed. The diminished-1 representation of numbers are most suitable for multiplication in 2^n+1 thus for this modulus the input number is converting to that representation.
Index Terms:
Modular multiplication, Diminished-1, RNS, CSA, Wallace tree
Citation:
Kooroush Manochehri, Saadat Pourmozafari, Babak Sadeghian, "Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1," itng, pp.178-185, Third International Conference on Information Technology: New Generations (ITNG'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.