loading...
Residue to Binary Number Converters for (2^n-1, 2^n, 2^n+1)
Lafayette, Louisiana February 19-February 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1998.665221Great Lakes Symposium on VLSI '98
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yuke Wang, Concordia University
Xiaoyu Song, Universite de Montreal
Mostapha Aboulhamid, Universite de Montreal
This paper proposes three new residue-to-binary converters using 2n- bit or n-bit adders for the three moduli residue number system of the form. The 2n- bit adder based converter is faster and requires about half of the hardware required by previous methods. For n-bit adder based implementations, one new converter is twice as fast as the previous method using similar amount of hardware; while another new converter achieves improvement in both speed and area.
Index Terms:
residue number system, arithmetic, circuit, algorithm, adders
Citation:
Yuke Wang, Xiaoyu Song, Mostapha Aboulhamid, "Residue to Binary Number Converters for (2^n-1, 2^n, 2^n+1)," glsvlsi, pp.174, Great Lakes Symposium on VLSI '98, 1998
Usage of this product signifies your acceptance of the Terms of Use.