Design of a high speed reverse converter for a new 4-moduli set residue number system

This paper presents an elegant residue-to-binary algorithm for a new 4-moduli set (2/sup n/ - 1, 2/sup n/, 2/sup n/ + 1, 2/sup 2n/ + 1) Residue Number System. Our reverse conversion algorithm takes advantage of the special number properties of the proposed moduli set. The recently introduced New CRT theorem has been exploited to simplify the costly and time consuming modular corrections. The resulting architecture is notably simple and can be realized in hardware with only bit reorientation operation and a Multi-Operand Modular Adder. In terms of area-time complexity, the performance of the new reverse converter surpasses previously reported reverse converters for several celebrated four-moduli sets.

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

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

[3]  A. P. Vinod.  A MEMORYLESS REVERSE CONVERTER FOR THE 4-MODULI SUPERSET {2n - 1, 2n, 2n + 1, 2n + 1 - 1} , 2000 .

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

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

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

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

[8]  T. Srikanthan,et al.  Breaking the 2n-bit carry propagation barrier in residue to binary conversion for the [2/sup n/-1, 2/sup n/, 2/sup n/+1] modula set , 1998 .

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

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

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

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

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

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