Fast base extension using a redundant modulus in RNS
- 1 February 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (2) , 292-297
- https://doi.org/10.1109/12.16508
Abstract
A technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus, is proposed. The technique obtains the residue(s) of a given number in the extended moduli without resorting to the traditional mixed-radix conversion (MRC) algorithm. The base extension can be achieved in log/sub 2/n table lookup cycles, where n is the number of moduli in the RNS. The superiority of the technique, compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated.Keywords
This publication has 6 references indexed in Scilit:
- Residue to binary conversion for RNS arithmetic using only modular look-up tablesIEEE Transactions on Circuits and Systems, 1988
- Residue Arithmetic A Tutorial with ExamplesComputer, 1984
- The design of specialized residue classes for efficient recursive digital filter realizationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Redundant residue number systems for error detection and correction in digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977
- A Note on Fast Base Extension for Residue Number Systems with Three ModuliIEEE Transactions on Computers, 1975