5 February 1990 Fast Fourier Transforms With Factored Residue Look-Up Tables
Author Affiliations +
The implementation of fast Fourier transforms (FFT) via the use of residue factored look-up tables (FLUT) is investigated. The principles of FLUTs are reviewed, and a gate-level pipelined adder architecture is presented. The basics of the quadratic residue system (QRNS) are then discussed, and FLUT-based gate-level pipelined architectures are presented for binary-to-QRNS and QRNS-to-binary converters, as well as for FFT butterflies. The Despain small integer approximations are used to represent the FFT complex rotations each of which is expressed via a linear combination of common angles. The QRNS FLUT FFT performance is measured via a normalized mean square error (MSE) figure which is estimated via computer simulations performed for 16-, and 32-point QRNS FFTs in conjunction with various input signals and different approximation accuracy. Based on these results the largest FLUT FFT order, for which an MSE of <10-8 can be supported, is estimated. The overall system gate complexity is then calculated and compared with that required by the equivalent conventional digital implementation.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
A. P. Goutzoulis, A. P. Goutzoulis, } "Fast Fourier Transforms With Factored Residue Look-Up Tables", Proc. SPIE 1151, Optical Information Processing Systems and Architectures, (5 February 1990); doi: 10.1117/12.962202; https://doi.org/10.1117/12.962202


Acousto-optic signal processors for air defense sensors
Proceedings of SPIE (August 23 1992)
High-performance signal characterization workstation
Proceedings of SPIE (June 11 1996)
Optoelectronic ISAR processing
Proceedings of SPIE (August 17 1995)
Fast optical digital arithmetic processors
Proceedings of SPIE (August 31 1990)
Coherent Optical Processing Of Synthetic Aperture Radar Data
Proceedings of SPIE (December 27 1977)

Back to Top