Binary-to-RNS Conversion Units for moduli {2^n ± 3}

In this paper Residue Number Systems (RNS) conversion structures from Binary to RNS modulo {2n ± 3} are proposed. These structures are based on arithmetic calculations without the need for Lookup Tables as in the related art. Additionally, the required 4:2 and 3:2 Carry-Save Adders (CSA) modulo {2n ± 3} are also proposed. Experimental results obtained for an ASIC technology suggest that the presented CSAs, needed in the conversion, improve the related art by reducing the required area resources by 33% and achieving a 1.49x speedup. Experimental results for the proposed conversion units suggest that improvements in performance up to 3 times can be achieved, while reducing the required area resources by 85%.

[1]  P. Mohan.  New reverse converters for the moduli set {2n-3,2n-1,2n+1,2n+3} , 2008 .

[2]  A. Omondi,et al.  Residue Number Systems: Theory and Implementation , 2007 .

[3]  Michael A. Soderstrand,et al.  Residue number system arithmetic: modern applications in digital signal processing , 1986 .

[4]  Ricardo Chaves,et al.  {2/sup n/ + 1, 2/sup n+k/, 2/sup n/ - 1} : a new RNS moduli set extension , 2004, Euromicro Symposium on Digital System Design, 2004. DSD 2004..

[5]  Ricardo Chaves,et al.  {2 n +1, s n+k , s n -1}: A New RNS Moduli Set Extension. , 2004 .

[6]  P. V. Anandu Mohan.  REVERSE CONVERTERS FOR THE MODULI SETS (22N-1, ZN, 2zN+1) AND {2"-3, 2N+1, 2N-1, ZN+3) , 2004 .

[7]  A. Benjamin Premkumar,et al.  Improved memoryless RNS forward converter based on the periodicity of residues , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  Khaled Elleithy,et al.  A systolic architecture for modulo multiplication , 1995 .

[9]  Ricardo Chaves,et al.  Arithmetic Units for RNS Moduli {2n-3} and {2n+3} Operations , 2010, 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools.

[10]  Reto Zimmermann,et al.  Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[11]  B. Russell.  ADDITION AND MULTIPLICATION , 2009 .

[12]  Reto Zimmermann,et al.  Binary adder architectures for cell-based VLSI and their synthesis , 1997 .

[13]  Stanislaw J. Piestrak,et al.  Design of residue generators and multioperand modular adders using carry-save adders , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[14]  Ming-Hwa Sheu,et al.  An efficient VLSI design for a residue to binary converter for general balance moduli (2n-3, 2n+1, 2n-1, 2n+3) , 2004, IEEE Trans. Circuits Syst. II Express Briefs.

[15]  Laurent-Stéphane Didier,et al.  A Generalization of a Fast RNS Conversion for a New 4-Modulus Base , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.

[16]  Hong Shen,et al.  Adder based residue to binary number converters for (2n-1, 2n, 2n+1) , 2002, IEEE Trans. Signal Process..

[17]  Laurent-Stéphane Didier,et al.  A Generalization of a Fast RNS Conversion for a New 4-Modulus Base , 2009 .

[18]  A. B. Premkumar,et al.  A formal framework for conversion from binary to residue numbers , 2002 .

[19]  F. Petry,et al.  The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2/sup k/-1,2/sup k/,2/sup k/+1) , 1997 .