An Efficient Reverse Converter for the 4-Moduli Set 2 n 1 , 2 n , 2 n + 1 , 22 n + 1 Based on the New Chinese Remainder Theorem

The inherent properties of carry-free operations, parallelism and fault-tolerance have made the residue number system a promising candidate for high-speed arithmetic and specialized high-precision digital signal-processing applications. However, the reverse conversion from the residues to the weighted binary number has long been the performance bottleneck, particularly when the number of moduli set increases beyond 3. In this paper, we present an elegant residue-to-binary conversion algorithm for a new 4-moduli set 2 1 2 2 +1 2 +1 . The new Chinese remainder theorem introduced recently has been employed to exploit the special properties of the proposed moduli set where modulo corrections are done without resorting to the costly and time consuming modulo operations. The resulting architecture is notably simple and can be realized in hardware with only bit reorientation and one multioperand modular adder. The new reverse converter has superior area-time complexity in comparison with the reverse converters for several other 4-moduli sets.

[1]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

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

[3]  C. H. Huang.  A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications , 1983, IEEE Transactions on Computers.

[4]  Masao Iri,et al.  A VLSI Algorithm for Direct and Reverse Conversion from Weighted Binary Number System to Residue Number System , 1984 .

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

[6]  Trieu-Kien Truong,et al.  VLSI implementation of GSC architecture with a new ripple carry adder , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[7]  S. Andraos,et al.  A new efficient memoryless residue to binary converter , 1988 .

[8]  R. Capocelli,et al.  Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa , 1988 .

[9]  Adrian Philip Wise,et al.  The design and implementation of the IMS A110 image and signal processor , 1989, 1989 Proceedings of the IEEE Custom Integrated Circuits Conference.

[10]  W. R. Moore,et al.  Improved mixed-radix conversion for residue number system architectures , 1991 .

[11]  K. Elleithy,et al.  Fast and flexible architectures for RNS arithmetic decoding , 1992 .

[12]  Maria Cristina Pinotti,et al.  A Fully Parallel Algorithm for Residue to Binary Conversion , 1994, Inf. Process. Lett..

[13]  Stanislaw J. Piestrak.  Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders , 1994, IEEE Trans. Computers.

[14]  R. Siferd,et al.  Pipelined 50 MHz CMOS ASIC for 32 bit binary to residue conversion and residue to binary conversion , 1994, Proceedings Seventh Annual IEEE International ASIC Conference and Exhibit.

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

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

[17]  T. Srikanthan,et al.  Breaking the 2n-bit carry propagationbarrier in residue to binary conversion for the [2n-1. 2n, 2n + 1] modula set , 1998 .

[18]  Christopher T. Clarke,et al.  Area-time-efficient VLSI residue-to-binary converters , 1998 .

[19]  Thambipillai Srikanthan,et al.  A reverse converter for the 4-moduli superset {2/sup n/-1, 2/sup n/, 2/sup n/+1, 2/sup n+1/+1} , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[20]  A. Benjamin Premkumar,et al.  A Memoryless Reverse Converter for the 4-Moduli Superset {2n-1, 2n, 2n+1, 2n+1-1} , 2000, J. Circuits Syst. Comput..

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