Skip to main content
Engineering LibreTexts

4.5: The Quick Fourier Transform (QFT)

One stage of the QFT can use the symmetries of the sines and cosines to calculate a DFT more efficiently than directly implementing the equation in Multidimensional Index Mapping. Similar to the Goertzel algorithm, the one-stage QFT is a better \(N^2\) DFT algorithm for arbitrary lengths. See The Cooley-Tukey Fast Fourier Transform Algorithm .

Contributor

  • ContribEEBurrus