Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Highly Cited
1999
Highly Cited
1999
This paper shows how the fast Fourier Transform may be used to value options when the characteristic function of the return is… Expand
  • figure 1
  • table 1
  • figure 2
Highly Cited
1993
Highly Cited
1993
A group of algorithms is presented generalizing the fast Fourier transform to the case of noninteger frequencies and… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • table 4.1
  • table 5.1
Highly Cited
1988
Highly Cited
1988
The Fast Fourier Transform (FFT) is a mathematical method widely used in signal processing. This book focuses on the application… Expand
Highly Cited
1978
Highly Cited
1978
The fast Fourier transform (FFT), a computer algorithm that computes the discrete Fourier transform much faster than other… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 2.1
Review
1978
Review
1978
  • F. Harris
  • Proceedings of the IEEE
  • 1978
  • Corpus ID: 426548
This paper makes available a concise review of data windows and their affect on the detection of harmonic signals in the presence… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
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… Expand
Highly Cited
1967
Highly Cited
1967
The use of the fast Fourier transform in power spectrum analysis is described. Principal advantages of this method are a… Expand
  • figure 1