Residue-to-binary arithmetic converter for the moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1)

This paper presents a new algorithm which converts moduli (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) residue numbers to their binary equivalents; it is the first converter which has been dedicated to this particular moduli set. The complexity of conversion has been greatly reduced using new compact forms for the multiplicative inverses and the properties of modular arithmetic. A hardware implementation which utilizes adders only is also proposed. With a pipelined system, the throughput rate is that of a single (2k-1)-bit binary adder. Comparison results showed that the hardware requirements and the execution time of the new converter are less than half that needed by other converters.

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

[2]  W K Jenkins.  Recent advances in residue number techniques for recursive digital filtering , 1979 .

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

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

[5]  F. Taylor.  Large moduli multipliers for signal processing , 1981 .

[6]  M. Soderstrand,et al.  An improved residue number system digital-to-analog converter , 1983 .

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

[8]  P. Benardson.  Fast Memoryless,over 64 bits, residue-to-binary convertor , 1985 .

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

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

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

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

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

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

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

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

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

[18]  H.S. Abdel-Aty-Zohdy,et al.  Design and implementation of a fast and compact residue-based semi-custom VLSI arithmetic chip , 1994, Proceedings of 1994 37th Midwest Symposium on Circuits and Systems.

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

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

[21]  Costas Efstathiou,et al.  Area-time efficient modulo 2/sup n/-1 adder design , 1994 .

[22]  Hoda S. Abdel-Aty-Zohdy,et al.  A high-speed division algorithm for residue number system , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

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