Fast arithmetic based on residue number system architectures
Author:
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2947-2950 vol.5
Abstract
A new approach is described for transforming residue numbers into equivalent decimal numbers. The approach is based on the periodicity inherent in residue numbers and uses matrix techniques to achieve high-speed residue-to-decimal conversion. In comparison with existing conversion techniques, the proposed conversion method achieves a modest reduction in the number of arithmetic multiplications needed during the conversion process. Whether for achieving speed through parallelism in computer architectures or for enhancing the arithmetic reliability, residue number architectures are a promising approach for the future.Keywords
This publication has 11 references indexed in Scilit:
- Improved mixed-radix conversion for residue number system architecturesIEE Proceedings G Circuits, Devices and Systems, 1991
- An Overflow-Free Residue MultiplierIEEE Transactions on Computers, 1983
- A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number ApplicationsIEEE Transactions on Computers, 1983
- A VLSI Residue Arithmetic MultiplierIEEE Transactions on Computers, 1982
- An efficient residue-to-decimal converterIEEE Transactions on Circuits and Systems, 1981
- Recent advances in residue number techniques for recursive digital filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977
- Error Correction in Residue ArithmeticIEEE Transactions on Computers, 1972
- Self-checked computation using residue arithmeticProceedings of the IEEE, 1966
- Sign Detection in Nonredundant Residue SystemsIEEE Transactions on Electronic Computers, 1962