The quick discrete Fourier transform

@article{Guo1994TheQD,
  title={The quick discrete Fourier transform},
  author={Haitao Guo and Gary A. Sitton and C. Sidney Burrus},
  journal={Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing},
  year={1994},
  volume={iii},
  pages={III/445-III/448 vol.3}
}
  • Haitao Guo, G. Sitton, C. Burrus
  • Published 19 April 1994
  • Computer Science
  • Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing
This paper will look at an approach that uses symmetric properties of the basis function to remove redundancies in the calculation of discrete Fourier transform (DFT). We will develop an algorithm, called the quick Fourier transform (QFT), that will reduce the number of floating point operations necessary to compute the DFT by a factor of two or four over direct methods or Goertzel's method for prime lengths. Further by applying the idea to the calculation of a DFT of length-2/sup M/, we… 

Figures from this paper

The quick Fourier transform: an FFT based on symmetries
TLDR
An algorithm called the quick Fourier transform (QFT) is developed that reduces the number of floating-point operations necessary to compute the DFT by a factor of two or four over direct methods or Goertzel's method for prime lengths.
Benchmarking of FFT algorithms
TLDR
The results of this work will serve as a framework for creating an object-oriented, poly-functional FFT implementation which will automatically choose the most efficient algorithm given user-specified constraints.
The Cooley-Tukey Fast Fourier Transform Algorithm ∗
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so
The Cooley-Tukey Fast Fourier Transform Algorithm ∗ C .
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so
CONTEMPORARY VIEW OF FFT ALGORITHMS Anthony Skjellum
TLDR
A comprehensive comparison of several contemporary FFT algorithms on state-of-the-art processors using the criterion used are the operations count, CPU time, memory usage, processor, and compiler.
A General Comparison Of Fft Algorithms
TLDR
The results indicate that the FHT is the overall best algorithm on all platforms, offering the fastest execution time and requiring reasonably small amounts of memory.
Notes on the FFT
TLDR
This is a note describing results on eecient algorithms to calculate the discrete Fourier transform (DFT) at Rice University, but other contributions used by the DSP research group at Rice are also cited.
A COMPARATIVE ANALYSIS OF FFT ALGORITHMS
TLDR
A large number of FFT algorithms have been developed over the years, notably the Radix-2, Ra Split-Radix, Fast Hartley Transform (FHT), Quick Fourier Transform (QFT), and Decimation-in-Time-Frequency (DITF) algorithms; how these algorithms fare in comparison with other is of considerable interest to developers of signal processing technology.
Novel recursive discrete Fourier transform with compact architecture
  • Chih-Peng Fan, Guo-An Su
  • Computer Science
    The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.
  • 2004
TLDR
The novel recursive method to compute discrete Fourier transforms (DFT) is proposed, which is greater than the well-known Goertzel's method and can implement the recursive DFT with hardware sharing architectures.
FFTW: an adaptive software architecture for the FFT
  • Matteo Frigo, Steven G. Johnson
  • Computer Science
    Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)
  • 1998
TLDR
An adaptive FFT program that tunes the computation automatically for any particular hardware, and tests show that FFTW's self-optimizing approach usually yields significantly better performance than all other publicly available software.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Efficient computation of the DFT with only a subset of input or output points
TLDR
An efficient algorithm, called transform decomposition, is introduced, based on a mixture of a standard FFT algorithm and the Horner polynomial evaluation scheme equivalent to the one in Goertzel's algorithms, which requires fewer operations and is more flexible than pruning.
Gauss and the history of the fast fourier transform
TLDR
The algorithm developed by Cooley and Tukey clearly had its roots in, though perhaps not a direct influence from, the early twentieth century, and remains the most Widely used method of computing Fourier transforms.
Fast algorithms for the discrete W transform and for the discrete Fourier transform
TLDR
A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform as well as for the discrete Fourier transform, which makes new algorithms more efficient than conventional algorithms.
Fast Fourier transform and convolution algorithms
TLDR
This book explains the development of the Fast Fourier Transform Algorithm and its applications in Number Theory and Polynomial Algebra, as well as some examples of its application in Quantization Effects.
DFT/FFT and Convolu- tion Algorithms
  • 1985
The QFT algorithm
  • 1985
The quick discrete Fourier transform
  • 1991
The QDFT: an e cient method for short prime length dfts
  • 1991
Gauss and the history of the FFT . ZEEE ASSP
  • DFT / FFT and Convolution Algorithms
  • 1985
The QDFT: an eecient method for short prime length dfts
  • The QDFT: an eecient method for short prime length dfts
  • 1991
...
...