Share Email Print

Proceedings Paper

Fast Fourier Transforms With Factored Residue Look-Up Tables
Author(s): A. P. Goutzoulis
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 5 February 1990
PDF: 14 pages
Proc. SPIE 1151, Optical Information Processing Systems and Architectures, (5 February 1990); doi: 10.1117/12.962202
Show Author Affiliations
A. P. Goutzoulis, Westinghouse Science & Technology Center (United States)

Published in SPIE Proceedings Vol. 1151:
Optical Information Processing Systems and Architectures
Bahram Javidi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?