The fast Fourier transform

Authors:
E. O. Brigham;R. E. Morrow
Affiliations:
LTV Electrosystems, Inc.;-
Venue:
IEEE Spectrum
Year:
1967

Citing 0
Cited 2

Honeycomb: an application-driven online adaptive reconfigurable hardware architecture

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the Symposium on Integrated Circuits and Systems Design (SBCCI 2011)
A systematic approach for optimized bypass configurations for application-specific embedded processors

ACM Transactions on Embedded Computing Systems (TECS) - Special issue on application-specific processors

Quantified Score

Hi-index	0.09

Visualization

Abstract

The fast Fourier transform (FFT), a computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained. Examples and detailed procedures are provided to assist the reader in learning how to use the algorithm. The savings in computer time can be huge; for example, an N = 210-point transform can be computed with the FFT 100 times faster than with the use of a direct approach.