A new algorithm for RNS decoding

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

Volumn 43, Issue 12, 1996, Pages 998-1001

  Wang, Yuke ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING;

CHINESE REMAINDER THEOREM; MIX RADIX CONVERSION; PRIME MODULO SETS; RESIDUE NUMBER SYSTEM (RNS);

DIGITAL ARITHMETIC;

EID: 0030400238     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.545841     Document Type: Article

References (6)

1. F. J. Taylor, "Residue arithmetic: A tutorial with examples," IEEE Comput., vol. 17, pp. 50-62, May 1984.
2. K. Elleithy and M. A. Bayoumi, "Fast and flexible architectures for RNS arithmetic decoding," IEEE Trans. Circuits Syst., vol. 39, pp. 226-235, Apr. 1992.
3. W. K. Jenkins, "Techniques for residue-to-analog conversion for residue-encoded digital filters," IEEE Trans. Circuits Syst., vol. CAS-25, pp. 555-562, July 1978.
4. T. V. Vu, "Efficient implementations of the Chinese reminder theorem for sign detection and residue decoding," IEEE Trans. Comput., vol. C-34, pp. 646-651, July 1985.
5. R. M. Capocelli and R. G. Carlo, "Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa," IEEE Trans. Circuits Syst., vol. 35, pp. 1425-1430, Nov. 1988.
6. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. Cambridge, MA: The MIT Press, 1990.