Fast Fourier transform

Known as: Arithmetic complexity of the discrete Fourier transform, FFT algorithm, FFT (disambiguation) 
A fast Fourier transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse. Fourier analysis converts a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The fast Fourier transform (FFT) is used widely in signal processing for efficient computation of the FT of finite-length signals… (More)
  • table 1
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, a concept of integer fast Fourier transform ( IntFFT ) for approximating the discrete Fourier transform is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Black-Scholes model and its extensions comprise one of the major developments in modern finance. Much of the recent… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Fast Fourier Transforms for Nonequispaced Data Alok Dutt Yale University 1993 Two groups of algorithms are presented generalizing… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • table 4.1
  • table 5.1
Is this relevant?
Highly Cited
1984
Highly Cited
1984
THE fast Fourier transform (Fm has become well known . as a very efficient algorithm for calculating the discrete Fourier… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
sprightly style and is interesting from cover to cover. The comments, critiques, and summaries that accompany the chapters are… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 2.1
Is this relevant?
Highly Cited
1969
Highly Cited
1969
The advent of the fast Fourier transform method has greatly extended our ability to implement Fourier methods on digital… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
1969
Highly Cited
1969
For some time the Fourier transform has served as a bridge between the time domain and the frequency domain. It is now possible… (More)
Is this relevant?
Highly Cited
1968
Highly Cited
1968
A modified version of the Fast Fourier Transform is developed and described. This version is well adapted for use in a special… (More)
Is this relevant?