论文信息 - High-speed and low-cost reverse converters for the (2n-1, 2n, 2n+1) moduli set

High-speed and low-cost reverse converters for the (2n-1, 2n, 2n+1) moduli set

In this brief, new architectures are presented for the conversion of residues to binary equivalents in the (2n-1, 2n, 2n+1) moduli set. Both of the architectures presented are based on a new algorithm, which eliminates a multiplication. In the design of the architectures, speed and cost are considered as the principal factors. The proposed architectures use fewer multipliers and adders of smaller size. A comparison in terms of hardware requirements, delay estimates, and complexity is made to establish the advantages of the proposed design.

T. Srikanthan | A. Premkumar | M. Bhardwaj

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

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

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

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

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

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

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