A residue arithmetic implementation of the FFT☆
References (26)
Fast Fourier transform processors using Gaussian residue arithmetic
J. Parallel Distrib. Comput.
(Aug. 1985)Modulo arithmetic logic
IEEE J. Electron. Circuits and Systems
(Nov. 1978)- et al.
Elementary Number Theory
(1980) - et al.
On translation algorithms in residue number systems
IEEE Trans. Comput.
(Dec. 1972) - et al.
Hardware implementation of convolution using number theoretic transforms
The residue number system
IRE Trans. Electron. Comput.
(June 1959)Topics in Algebra
(1975)- et al.
The use of residue number systems in the design of finite impulse response digital filters
IEEE Trans. Circuits and Systems
(Apr. 1977) Residue number scaling and other operations using ROM arrays
IEEE Trans. Comput.
(Apr. 1978)- et al.
Error detection and correction in the quadratic number system
Application of residue number system to complex digital filters
Number Theory in Digital Signal Processing
(1979)
Practical realization of mod p, p prime multiplier
Electron. Lett.
(June 1980)
Cited by (4)
Optimal VLSI complexity design for high speed pipeline FFT using RNS
1998, Computers and Electrical EngineeringRESIDUE NUMBER SYSTEMS: Theory and Implementation: Vol. 2
2007, Residue Number Systems: Theory and Implementation: Vol. 2Residue number system implementations of complex heterodyne tunable filters
2005, Proceedings - IEEE International Symposium on Circuits and SystemsRealizing peak performance from high speed digital gallium arsenide circuits using the residue number system
1990, Proceedings of SPIE - The International Society for Optical Engineering
- ☆
This work was supported by the Army Research Office. Portions of this paper were presented at ARITH 7.
Copyright © 1987 Published by Elsevier Inc.