The Quick Fourier Transform: An FFT Based on Symmetries

IEEE Transactions on Signal Processing

Volumn 46, Issue 2, 1998, Pages 335-341

  Guo, Haitao ^a,b,c,d   Sitton, Gary A ^a,b,c,d   Sydney Burrus, C ^a,b,c,d  

^a IEEE   (United States)

^b Rice University   (United States)

^c Chromatic Research Inc   (United States)

^d Western Geophysical ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS;

COOLEY TUKEY ALGORITHM; QUICK FOURIER TRANSFORMS (QFT);

SIGNAL PROCESSING;

EID: 0031999202     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.655419     Document Type: Article

References (14)

1. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1985.
2. M. T. Heideman, D. H. Johnson, and C. S. Burrus, Gauss and the history of the FFT, IEEE Acoust., Speech, Signal Processing Mag., vol. 1, pp. 14-21, Oct. 1984; also in Archive for History of Exact Sciences, vol. 34, pp. 265-277, 1985.
3. H. Guo, G. A. Sitton, and C. S. Burrus, The quick discrete Fourier transform, in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Adelaide, Australia, Apr. 19-22, 1994, pp. 111:445-448.
4. J. F. Kohne, A quick Fourier transform algorithm, Tech. Rep. TR1723, Naval Electron. Lab. Cent., July 1980.
5. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, 2nd ed. Heidelberg, Germany: Springer-Verlag, 1981, 1982.
6. H. V. Sorensen and C. S. Burrus, Efficient computation of the DFT with only a subset of input or output points, IEEE Trans. Signal Processing, vol. 41, pp. 1184-1200, Mar. 1993.
7. A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
8. Z. Wang, Fast algorithms for the discrete W transform and for the discrete Fourier transform, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 803-816, Aug. 1984.
9. K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. San Diego, CA: Academic, 1990.
10. D. P. Skinner, Pruning the decimation in-time FFT algorithm, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, pp. 193-194, Apr. 1976.
11. P. Duhamel and H. Hollmann, Split-radix FFT algorithm, Electron. Lett., vol. 20, no. 1, pp. 14-16, Jan. 1984.
12. G. Bruun, -transform DFT filters and FFT's, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 56-63, Feb. 1978.
13. C. M. Rader and N. M. Brenner, A new principle for fast Fourier transformation, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, pp. 264-266, June 1976.
14. K. M. Cho and G. C. Ternes, Real-factor FFT algorithms, in Proc. IEEE ICASSP, Tulsa, OK, Apr. 1978, pp. 634-637.