The quick discrete Fourier transform

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 3, Issue , 1994, Pages III445-III448

  Guo, H ^a   Sitton, G A ^b   Burrus, C S ^a  

^a RICE UNIVERSITY   (United States)

^b HALLIBURTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; SIGNAL PROCESSING;

BASIS FUNCTIONS; DIRECT METHOD; EFFICIENT IMPLEMENTATION; FLOATING POINT OPERATIONS; SIMPLE STRUCTURES;

DISCRETE FOURIER TRANSFORMS;

EID: 0013255820     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.1994.389994     Document Type: Conference Paper

References (9)

1. C. S. Burrus. The quick discrete Fourier transform. December 1991.
2. C. S. Burrus and T. W. Parks. DFT/FFT and Convolution Algorithms. John Wiley and Sons, New York, 1985.
3. M. T. Heideman, D. H. Johnson, and C. S. Burrus. Gauss and the history of the FFT. IEEE ASSP. Magazine, 1:14-21, October 1984.
4. J. F. Kohne. A quick Fourier transform algorithm. Naval Electronics Laboratory Center, Technical Report, June 1979.
5. H. J. Nussbaumer. Fast Fourier Transform and Convolution Algorithms. Springer Verlag, Berlin, 1982.
6. G. A. Sitton. The QFT algorithm. unpublished paper, 1985.
7. G. A. Sitton. The QDFT: an efficient method for short prime length dfts. unpublished paper, June 1991.
8. Henrik V. Sorensen and C. S. Burrus. Efficient computation of the DFT with only a subset of input or output points. IEEE Trans. ASSP., 41:1184-1200, March 1993.
9. Z. Wang. Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. ASSP., 32:803-816, August. 1984.