A high-speed realization of a residue to binary number system converter

This paper proposes a new high-speed ROM-less residue-to-binary converter for the three moduli residue number systems (RNS) of the form. >

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

[2]  W. Kenneth Jenkins,et al.  Techniques for residue-to-analog conversion for residue-encoded digital filters , 1978 .

[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,et al.  Large moduli multipliers for signal processing , 1981 .

[6]  Fred J. Taylor,et al.  A VLSI Residue Arithmetic Multiplier , 1982, IEEE Transactions on Computers.

[7]  R. Ramnarayan,et al.  On large moduli residue number system recursive digital filters , 1985 .

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

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

[10]  Guoan Bi,et al.  Fast conversion between binary and residue numbers , 1988 .

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

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

[13]  A. Dhurkadas.  Comments on "An efficient residue to binary converter design" by K.M. Ibrahim and S.N. Saloum , 1990 .

[14]  David Milford,et al.  A new modulo 2/sup a/+1 multiplier , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

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