Design Of A Reconfigurable DSP Processor With Bit Efficient 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 a new moduli set selection technique is proposed 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. Using the novel moduli set, a guideline for a Reconfigurable Processor is presented here that can process some predefined functions. As RNS minimizes the carry propagation, the scheme can be implemented in Real Time Signal Processing & other fields where high speed computations are required.

[1]  A. Hiasat.  Efficient residue to binary converter , 2003 .

[2]  Vassilis Paliouras,et al.  A low-complexity combinatorial RNS multiplier , 2001 .

[3]  K. Navi,et al.  New Design of RNS Subtractor for modulo 2n+ 1 , 2006, 2006 2nd International Conference on Information & Communication Technologies.

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

[5]  Ahmad A. Hiasat,et al.  High-Speed and Reduced-Area Modular Adder Structures for RNS , 2002, IEEE Trans. Computers.

[6]  C. Ding.  Chinese remainder theorem , 1996 .

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

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

[9]  Wei Wang,et al.  An area-time-efficient residue-to-binary converter , 2000, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144).

[10]  W. Kenneth Jenkins,et al.  The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[11]  A. Nannarelli,et al.  Implementation of digital filters in carry-save residue number system , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

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

[13]  Graham A. Jullien,et al.  A VLSI implementation of residue adders , 1987 .

[14]  Reto Zimmermann.  Computer Arithmetic: Principles, Architectures, and VLSI Design , 1999 .

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

[16]  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).

[17]  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).

[18]  MaYutai.  A Simplified Architecture for Modulo (2n + 1) Multiplication , 1998 .

[19]  T. H. Meyer.  Computer Architecture and Organization , 1982 .

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

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

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

[23]  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..

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

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

[26]  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.

[27]  Yuke Wang,et al.  A study of the residue-to-binary converters for the three-moduli sets , 2003 .

[28]  Yutai Ma.  A Slimplified Architecture for Modulo (2n + 1) Multiplication , 1998, IEEE Trans. Computers.

[29]  P. Siy,et al.  A new moduli set selection technique to improve sign detection and number comparison in residue number system (RNS) , 2005, NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society.

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

[31]  Henk C. A. van Tilborg.  Chinese Remainder Theorem , 2005, Encyclopedia of Cryptography and Security.

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