A VLSI Residue Arithmetic Multiplier
- 1 June 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (6) , 540-546
- https://doi.org/10.1109/tc.1982.1676036
Abstract
Recently, residue arithmetic has received increased attention in the open literature. Using table lookup methods and high-speed memory, modular arithmetic has been demonstrated. However, the memory size limitation of ECL, bipolar, and high-speed MOS limits the admissible size of the moduli used in the numbering system. In this paper the moduli size limitation is overcome using VLSI technology, special architectures, and moduli choice. A residue multiplier having a 48–72 bit dynamic range, capable of performing 10M multiplication/s is reported.Keywords
This publication has 5 references indexed in Scilit:
- A high-speed low-cost modulo Pimultiplier with RNS arithmetic applicationsProceedings of the IEEE, 1980
- A highly efficient residue-combinatorial architecture for digital filtersProceedings of the IEEE, 1978
- Residue Number Scaling and Other Operations Using ROM ArraysIEEE Transactions on Computers, 1978
- A high-speed low-cost recursive digital filter using residue number arithmeticProceedings of the IEEE, 1977
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977