The quick discrete Fourier transform

@inproceedings{Guo1994TheQD,
  title={The quick discrete Fourier transform},
  author={Haitao Guo and Gary A. Sitton and C. Sidney Burrus},
  booktitle={ICASSP},
  year={1994}
}
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 oating 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 apply the idea to the calculation of a DFT of length-2 M , we construct a new O… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

DFT/FFT and Convolu- tion Algorithms

C. S. Burrus, T. W. Parks
1985
View 7 Excerpts
Highly Influenced

Fast algorithms for the discrete W transform and for the discrete Fourier transform

Z. Wang
IEEE Trans. ASSP., • 1984
View 3 Excerpts
Highly Influenced

The QDFT: an e cient method for short prime length dfts

G. A. Sitton
1991
View 1 Excerpt

The quick discrete Fourier transform

C. S. Burrus
1991
View 1 Excerpt

The QFT algorithm

G. A. Sitton
1985
View 1 Excerpt

Fast Fourier transform and convolution algorithm

Proceedings of the IEEE • 1982
View 1 Excerpt

A quick Fourier transform algorithm. Naval Electronics Laboratory

J. F. Kohne
1979
View 1 Excerpt

Similar Papers

Loading similar papers…