The re-discovery of the fast Fourier transform algorithm

  title={The re-discovery of the fast Fourier transform algorithm},
  author={James W. Cooley},
  journal={Microchimica Acta},
  • J. Cooley
  • Published 1987
  • Chemistry
  • Microchimica Acta
The discovery of the fast Fourier transform (FFT) algorithm and the subsequent development of algorithmic and numerical methods based on it have had an enormous impact on the ability of computers to process digital representations of signals, or functions. At first, the FFT was regarded as entirely new. However, attention and wide publicity led to an unfolding of its pre-electronic computer history going back to Gauss. The present paper describes the author's own involvement and experience with… Expand

Figures from this paper

The FFT: an algorithm the whole family can use
It is concluded that the FFT is both parent and child of the digital revolution, a computational technique at the nexus of the worlds of business and entertainment, national security and public communication. Expand
The Fast Fourier Transform Algorithm and Its Application in Digital Image Processing
The objective of this paper is to develop FFT based image processing algorithm that can be computed faster than the Discrete Fourier Transform (DFT) on the same machine. Expand
Generalized FFT's- A survey of some recent results
This paper surveys some recent work directed towards generalizing the fast Fourier transform (FFT) from the point of view of group representation theory, and discusses generalizations of the FFT to arbitrary nite groups and compact Lie groups. Expand
Proceedings of the Cornelius Lanczos International Centenary Conference
The development of the fast Fourier transform, or FFT, has had a major impact on most scientific fields. One of the earliest "recent" discoveries of the FIT was by Danielson and Lanczos in 1942,Expand
Generalized FFTS - A Survey of Some Recent Results
In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting theExpand
Exploring the fundamentals of fast Fourier transform technique and its elementary applications in physics
Fast Fourier transform (FFT) is a powerful and versatile tool used in engineering science. As expected, papers related to the methods and applications of FFT are galore in literature. However, mostExpand
Some applications of generalized FFT's
  • D. Rockmore
  • Computer Science, Mathematics
  • Groups and Computation
  • 1995
The purpose of this paper is to survey some of the applications of generalized FFTs and thereby (hopefully!) motivate further work in this direction. Expand
In November of 1979, there appeared a paper in the Bulletin of the AMS by L. Auslander and R. Tolimieri with the delightful title of “Is Computing with the Finite Fourier Transform Pure or AppliedExpand
In recent years, the fast Fourier transform, or FFT, has had a major impact on most scientific fields. In this note, severa.! applications of the FFT in the geophysica.! sciences are presented. Also,Expand
Recent progress and applications in group FFTs
  • D. Rockmore
  • Mathematics
  • Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.
  • 2002
The Cooley-Tukey FFT can be interpreted as an algorithm for the efficient computation of the Fourier transform for the finite cyclic groups, a compact group, or the non-compact group of the realExpand


The Fast Fourier Transform and Its Applications
A description of the alogorithm and its programming is given here and followed by a theorem relating its operands, the finite sample sequences, to the continuous functions they often are intended to approximate. Expand
Gauss and the history of the fast fourier transform
THE fast Fourier transform (Fm has become well known . as a very efficient algorithm for calculating the discrete Fourier Transform (Om of a sequence of N numbers. The OFT is used in many disciplinesExpand
The application of the fast Fourier transform algorithm to the estimation of spectra and cross-spectra
Abstract Alternative methods for the estimation of spectra are described and compared. Some of these methods have only become practicable with the advent of the fast Fourier transform algorithmExpand
An in-place, in-order prime factor FFT algorithm
A Fortran program that calculates the discrete Fourier transform using a prime factor algorithm is presented that is faster than both the Cooley-Tukey algorithm and the Winograd nested algorithm. Expand
Historical notes on the fast Fourier transform
The fast Fourier transform algorithm has a long and interesting history that has only recently been appreciated. In this paper, the contributions of many investigators are described and placed inExpand
The finite Fourier transform
The finite Fourier transform of a finite sequence is defined and its elementary properties are developed. The convolution and term-by-term product operations are defined and their equivalentExpand
Fast Fourier Transforms: for fun and profit
The "Fast Fourier Transform" has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized. Expand
An algorithm for the machine calculation of complex Fourier series
An efficient method for the calculation of the interactions of a 2' factorial ex- periment was introduced by Yates and is widely known by his name. The generaliza- tion to 3' was given by Box et al.Expand
A short bibliography on the fast Fourier transform
A guided tour of the fast Fourier transform,” IEEE Spectrum (to be published). Expand
Note on the calculation of Fourier series
Cooley and Tukey have recently presented an algorithm for the machine calculation of Fourier series [1]. In this connection mention should be made of the similar method described by Danielson andExpand