The quick discrete Fourier transform

@article{Guo1994TheQD,
  title={The quick discrete Fourier transform},
  author={Haitao Guo and G. A. Sitton and C. 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. A. Sitton, C. Burrus
  • Published 1994
  • Mathematics, 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… CONTINUE READING
    26 Citations

    Figures and Topics from this paper

    The quick Fourier transform: an FFT based on symmetries
    • 36
    • PDF
    Benchmarking of FFT algorithms
    • 10
    • PDF
    The Cooley-Tukey Fast Fourier Transform Algorithm ∗
    • 1
    A General Comparison Of Fft Algorithms
    • 6
    Notes on the FFT
    • 7
    A COMPARATIVE ANALYSIS OF FFT ALGORITHMS
    • 6
    Novel recursive discrete Fourier transform with compact architecture
    • C. Fan, Guo-An Su
    • Mathematics
    • The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings.
    • 2004
    • 8
    FFTW: an adaptive software architecture for the FFT
    • M. Frigo, S. Johnson
    • Computer Science
    • Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)
    • 1998
    • 1,643
    • PDF

    References

    SHOWING 1-10 OF 16 REFERENCES
    Efficient computation of the DFT with only a subset of input or output points
    • 251
    Gauss and the history of the fast fourier transform
    • 297
    • PDF
    DFT/FFT and Convolu- tion Algorithms
    • 1985
    The QDFT: an e cient method for short prime length dfts
    • 1991
    The QDFT: an eecient method for short prime length dfts
    • The QDFT: an eecient method for short prime length dfts
    • 1991
    The quick discrete Fourier transform
    • 1991
    DFT/FFT and Convolution Algorithms
    • DFT/FFT and Convolution Algorithms
    • 1985
    Gauss and the history of the FFT . ZEEE ASSP
    • DFT / FFT and Convolution Algorithms
    • 1985