Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1

Las Vegas, Nevada April 10-April 12

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ITNG.2006.60

Third International Conference on Inf ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Kooroush Manochehri Articles by Saadat Pourmozafari Articles by Babak Sadeghian

	ASCII Text	x
	Kooroush Manochehri, Saadat Pourmozafari, Babak Sadeghian, "Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1," Information Technology: New Generations, Third International Conference on, pp. 178-185, Third International Conference on Information Technology: New Generations (ITNG'06), 2006.

	BibTex	x
	@article{ 10.1109/ITNG.2006.60, author = {Kooroush Manochehri and Saadat Pourmozafari and Babak Sadeghian}, title = {Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1}, journal ={Information Technology: New Generations, Third International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2497-4}, pages = {178-185}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITNG.2006.60}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: New Generations, Third International Conference on TI - Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1 SN - 0-7695-2497-4 SP178 EP185 A1 - Kooroush Manochehri, A1 - Saadat Pourmozafari, A1 - Babak Sadeghian, PY - 2006 KW - Modular multiplication KW - Diminished-1 KW - RNS KW - CSA KW - Wallace tree VL - 0 JA - Information Technology: New Generations, Third International Conference on ER -

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.