论文信息 - A novel efficient parallel algorithm for RNS to binary conversion for arbitrary moduli set

A novel efficient parallel algorithm for RNS to binary conversion for arbitrary moduli set

We present a parallel algorithm for RNS to binary conversion, which is computationally efficient and requires moderate amount of storage. The algorithm is based on a graphical interpretation of the residue numbers, and imposes no restriction on the size or choice of moduli set. The parallel time complexity of the algorithm is /spl Theta/ upper bound [(log k)], where k is the size of the moduli set.<<ETX>>

Amitabha Das

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

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

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

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

[5] P. V. Ananda Mohan. Novel design for binary to RNS converters , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[6] P.V. Ananda Mohan,et al. Novel RNS to binary converters , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

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

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