A Scheme for Improving Bit Efficiency for Residue Number System

Residue Number System (RNS), which originates from the Chinese Remainder Theorem, offers a promising future in VLSI because of its carry-free operations in addition, subtraction and multiplication. This property of RNS is very helpful to reduce the complexity of calculation in many applications. A residue number system represents a large integer using a set of smaller integers, called residues. But the area overhead, cost and speed not only depend on this word length, but also the selection of moduli, which is a very crucial step for residue system. This parameter determines bit efficiency, area, frequency etc. In this paper we propose a new moduli set selection technique to improve bit efficiency which can be used to construct a residue system for digital signal processing environment. Subsequently, it is theoretically proved and illustrated using examples, that the proposed solution gives better results than the schemes reported in the literature. The novelty of the architecture is shown by comparison the different schemes reported in the literature.

[1]  S. Piestrak.  A high-speed realization of a residue to binary number system converter , 1995 .

[2]  Ki Ja Lee.  Interval Arithmetic Operations in Residue Number System , 2002 .

[3]  F. Taylor.  A single modulus complex ALU for signal processing , 1985, IEEE Trans. Acoust. Speech Signal Process..

[4]  M. Omair Ahmad,et al.  Moduli selection in RNS for efficient VLSI implementation , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[5]  A. Skavantzos,et al.  Application of new Chinese remainder theorems to RNS with two pairs of conjugate moduli , 1999, 1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368).

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

[7]  W. Freking,et al.  Low-power FIR digital filters using residue arithmetic , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[8]  Lennart Johnsson,et al.  Residue Arithmetic and VLSI , 1983 .

[9]  Harald Haas,et al.  Asilomar Conference on Signals, Systems, and Computers , 2006 .

[10]  Seungjoo Kim,et al.  RSA Speedup with Chinese Remainder Theorem Immune against Hardware Fault Cryptanalysis , 2003, IEEE Trans. Computers.

[11]  A. B. Premkumar,et al.  An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set , 1992 .

[12]  Graham A. Jullien,et al.  An efficient 3-modulus residue to binary converter , 1996, Proceedings of the 39th Midwest Symposium on Circuits and Systems.

[13]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[14]  John P. Hayes,et al.  Computer Architecture and Organization , 1980 .

[15]  Yuke Wang.  New Chinese remainder theorems , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[16]  Salam N. Saloum,et al.  An efficient residue to binary converter design , 1988 .

[17]  A. Skavantzos,et al.  A systematic approach for selecting practical moduli sets for residue number systems , 1995, Proceedings of the Twenty-Seventh Southeastern Symposium on System Theory.

[18]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[19]  Kazeem Alagbe Gbolagade,et al.  An Efficient RNS to Binary Converter Using the Moduli Set , 2008 .