Residue-to-binary converters based on new Chinese remainder theorems

The speed of arithmetic operations depends on the size of the numbers involved. Smaller numbers have faster operations. That is exactly the reason why residue number systems are attractive in computer arithmetic. However, the conversion from residue to binary numbers involves a large number module operations. Several residue-to-binary converters are proposed in this paper. The converters are based on the New Chinese Remainder Theorems (CRT's) I and II which represent our work. The New CRT's improve the celebrated CRT. The new algorithms do not use any large size module adders. The numbers involved are much smaller compared to the numbers in the CRT and its alternative, the Mixed Radix Conversion method. Given a moduli set as (P/sub 1/, P/sub 2/,, P/sub n/), to convert a residue number (x/sub 1/,x/sub 2/,...,x/sub n/) to its decimal correspondence, a matrix of numbers bounded by P/sub i/ is needed for the New CRT I compared to the large numbers M/P/sub i/ for the CRT, where M=P/sub 1/P/sub 2/...P/sub n/. The New CRT II uses module multipliers of size less than /spl radic/M. If the condition P/sub i+1/>P/sub 1/+P/sub 2/+...+P/sub i/ is satisfied, only one module operation of size P/sub n/ is needed for the conversion. Residue-to-binary conversion based on the New CRT's presented here will have a significant impact on many algorithms which currently use the CRT, particularly in computer arithmetic such as residue number systems.

[1]  H. Garner.  The residue number system , 1959, IRE-AIEE-ACM '59 (Western).

[2]  Dilip K. Banerji,et al.  On Translation Algorithms in Residue Number Systems , 1972, IEEE Transactions on Computers.

[3]  Dilip K. Banerji.  On the Use of Residue Arithmetic for Computation , 1974, IEEE Transactions on Computers.

[4]  A. Baraniecka,et al.  On decoding techniques for residue number system realizations of digital signal processing hardware , 1978 .

[5]  Fred J. Taylor,et al.  An efficient residue-to-decimal converter , 1981 .

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

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

[8]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[9]  G. Alia,et al.  A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system , 1984 .

[10]  M. Schroeder.  Number Theory in Science and Communication , 1984 .

[11]  F. J. Taylor,et al.  Residue Arithmetic A Tutorial with Examples , 1984, Computer.

[12]  Giuseppe Alia,et al.  A Fast VLSI Conversion Between Binary and Residue Systems , 1984, Inf. Process. Lett..

[13]  F.J. Taylor,et al.  A new residue to decimal converter , 1985, Proceedings of the IEEE.

[14]  Thu V. Vu.  Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding , 1985, IEEE Trans. Computers.

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

[16]  Rudolph E. Thun,et al.  On residue number system decoding , 1986, IEEE Trans. Acoust. Speech Signal Process..

[17]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[18]  A. L. Narasimha Reddy,et al.  An Implementation of Mixed-Radix Conversion for Residue Number Applications , 1986, IEEE Transactions on Computers.

[19]  R. Kumaresan,et al.  Residue to binary conversion for RNS arithmetic using only modular look-up tables , 1988 .

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

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

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

[23]  S. J. Meehan,et al.  An universal input and output RNS converter , 1990 .

[24]  Giuseppe Alia,et al.  VLSI Binary-Residue Converters for Pipelined Processing , 1990, Comput. J..

[25]  Kyu Ho Park,et al.  Efficient residue-to-binary conversion technique with rounding error compensation , 1991 .

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

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

[28]  Mi Lu,et al.  A Novel Division Algorithm for the Residue Number System , 1992, IEEE Trans. Computers.

[29]  Sebastiano Impedovo,et al.  A New Technique for Fast Number Comparison in the Residue Number System , 1993, IEEE Trans. Computers.

[30]  David Y. Y. Yun,et al.  An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems , 1993, J. Symb. Comput..

[31]  Giuseppe Alia,et al.  On the Lower Bound to the VLSI Complexity of Number Conversion from Weighted to Residue Representation , 1993, IEEE Trans. Computers.

[32]  I. Koren.  Computer arithmetic algorithms , 2018 .

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

[34]  B. Vinnakota,et al.  Fast conversion techniques for binary-residue number systems , 1994 .

[35]  H. Krishna,et al.  Rings, fields, the Chinese remainder theorem and an extension-Part I: theory , 1994 .

[36]  K. Y. Lin,et al.  Computational Number Theory and Digital Signal Processing: Fast Algorithms and Error Control Techniques , 1994 .

[37]  A. Premkumar.  An RNS to binary converter in a three moduli set with common factors , 1995 .

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

[39]  Yuke Wang,et al.  A new algorithm for RNS decoding , 1996 .

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

[41]  F. Pourbigharaz,et al.  A Signed-Digit Architecture for Residue to Binary Transformation , 1997, IEEE Trans. Computers.

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

[43]  M.N.S. Swamy,et al.  Residue to binary number converters for three moduli set , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).