A Radix-4 FFT Using Complex RNS Arithmetic
- 1 June 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-34 (6) , 573-576
- https://doi.org/10.1109/tc.1985.5009414
Abstract
Recent advancements in residue arithmetic have given rise to a complex number system variant which better than halves RNS multiplication complexity. This advantage is applied to the problem of implementing a high-speed radix-4 RNS FFT. It is shown that a significant improvement in both complexity and speed can be achieved.Keywords
This publication has 9 references indexed in Scilit:
- Application of Quadratic-Like complex residue number system arithmetic to ultrasonicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An efficient residue-to-decimal converterIEEE Transactions on Circuits and Systems, 1981
- A comparison of DFT algorithms using a residue architectureComputers and Electrical Engineering, 1981
- Implementation of a fast digital processor using the residue number systemIEEE Transactions on Circuits and Systems, 1981
- Redundant residue number systems for error detection and correction in digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Implementation of FFT Structures Using the Residue Number SystemIEEE Transactions on Computers, 1979
- Convolution algorithms for small-word-length digital-filtering applicationsIEE Journal on Electronic Circuits and Systems, 1979
- Residue Number Scaling and Other Operations Using ROM ArraysIEEE Transactions on Computers, 1978
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977