Breaking the 2n-bit carry propagationbarrier in residue to binary conversion for the [2n-1, 2n, 2n + 1] modula set

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 45, Issue 9, 1998, Pages 998-1002

  Bhardwaj, M ^a,b   Premkumar, A B ^a,b   Srikanthan, T ^a,b  

^a Siemens Components   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Modular arithmetic; Residue numbers; Reverse converters

Indexed keywords

COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; LOGIC GATES; SET THEORY;

BINARY CONVERTERS; MODULAR ARITHMETIC; RESIDUE NUMBERS; REVERSE CONVERTERS;

ADDERS;

EID: 0032155165     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.721268     Document Type: Article

References (6)

1. S. Andraos and H. Ahmad, "A new efficient memory-less residue to binary converter," IEEE Trans. Circuits Syst., vol. 35, pp. 1441-1444, Nov. 1988.
2. S. J. Piestrak, "A high speed realization of residue to binary number system conversion," IEEE Trans. Circuits Syst. II, vol. 42, pp. 661-663, Oct. 1995.
3. G. Bi and E. V. Jones, "Fast conversion between binary and residue numbers," Electron. Lett., vol. 24, no. 19, pp. 1195-1197, Sept. 1988.
4. K. M. Ibrahim and S. N. Saloum, "An efficient residue to binary converter design," IEEE Trans. Circuits Syst., vol. 35, pp. 1156-1158, Sept. 1988.
5. A. Dhurkhadas, "An efficient residue to binary converter design," IEEE Trans. Circuits Syst. II, vol. 37, pp. 849-850, June 1990, comments.
6. K. Hwang, Computer Arithmetic: Principles, Architecture and Design. New York: Wiley, 1979.