Fast RNS DSP algorithms implemented with binary arithmetic
- 1 January 1990
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1531-1534
- https://doi.org/10.1109/icassp.1990.115701
Abstract
Fast RNS (residue number system) algorithms which use only binary arithmetic are developed. Scaled residues, called pseudoresidues, are introduced by exploiting the cycle properties of each RNS channel and solving a Diophantine equation. Using the pseudoresidues instead of the original residue set to perform the desired computations, an RNS processor can be built with standard binary devices of small wordlength. The effectiveness of the procedure is shown by developing the pseudoresidue implementations of a modular multiplier for odd moduli RNS and of a FIR (finite impulse response) filter. The resulting structures exhibit complete reprogrammability for both moduli and coefficients, a very low number of fast machine cycles, and a square time-area product reductioKeywords
This publication has 5 references indexed in Scilit:
- A systolic discrete Fourier transform using residue number systems over the ring of Gaussian integersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A universal input and output RNS converterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Complex digital signal processing using quadratic residue number systemsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Residue Arithmetic A Tutorial with ExamplesComputer, 1984
- A new hardware realization of digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974