论文信息 - An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set

An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set

A residue number system to binary converter that converts numbers in the moduli set 2n+1,2n,2n-1 is described. This moduli set is an extension of the more popular set, 2/sup n/+1, 2/sup n/, 2/sup n/-1. A low-complexity implementation using some properties of modular arithmetic is proposed. The converter does not use any explicit modulo operation in the evaluation as is normally done in the Chinese remainder theorem. >

A. B. Premkumar | A. Premkumar

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

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

[3] B. Arambepola,et al. Common VLSI architecture for a practically useful residue number system , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

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

[5] H. M. Yassine. Fast arithmetic based on residue number system architectures , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

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

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