Fast Fourier Transforms: for fun and profit

Authors:
W. M. Gentleman;G. Sande
Affiliations:
Bell Telephone Laboratories, Murray Hill, New Jersey;Princeton University, Princeton, New Jersey
Venue:
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Year:
1966

Citing 4
Cited 26

A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

Journal of the ACM (JACM)
Numerical Methods for Scientists and Engineers

Numerical Methods for Scientists and Engineers
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes
High-speed convolution and correlation

AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference

How the FFT gained acceptance

A history of scientific computing
Further experimental data on the behavior of programs in a paging environment

Communications of the ACM
Fast Computational Algorithms for Bit Reversal

IEEE Transactions on Computers
A Generalization of the Fast Fourier Transform

IEEE Transactions on Computers
Efficient Fast Fourier Transform Programs for Arbitary Factors with One Step Loop Unscrambling

IEEE Transactions on Computers
The Design of a Class of Fast Fourier Transform Computers

IEEE Transactions on Computers
A Note on Fast Cyclic Convolution

IEEE Transactions on Computers
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations

IEEE Transactions on Computers
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

Signal Processing
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Signal Processing
Some polynomial and Toeplitz matrix computations

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Real-time spectral analysis on a small general-purpose computer

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Architecture of a real-time Fast Fourier radar signal processor

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
A study of asynchronous time division multiplexing for time-sharing computer systems

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Sampling and discretization of the linear canonical transform

Signal Processing
A versatile VLSI fast Fourier transform processor

AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Some Aspects of the Zoom Transform

IEEE Transactions on Computers
FFT algorithms for vector computers

Parallel Computing
Dynamically reconfigurable dataflow architecture for high-performance digital signal processing

Journal of Systems Architecture: the EUROMICRO Journal
Fitting FFT onto an energy efficient massively parallel architecture

Proceedings of the Second International Forum on Next-Generation Multicore/Manycore Technologies
Applications of FFT and structured matrices

Algorithms and theory of computation handbook
An FFT performance model for optimizing general-purpose processor architecture

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
A transpose-free in-place SIMD optimized FFT

ACM Transactions on Architecture and Code Optimization (TACO)
A framework for low-communication 1-D FFT

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Blind image deconvolution using a banded matrix method

Numerical Algorithms
A framework for low-communication 1-D FFT

Scientific Programming - Selected Papers from Super Computing 2012

Quantified Score

Hi-index	0.04

Visualization

Abstract

The "Fast Fourier Transform" has now been widely known for about a year. During that time it has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized. What exactly is the "Fast Fourier Transform"?