Fast DFT Algorithms for Length N = q*2m

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 45, Issue 6, 1998, Pages 685-690

  Bi, Guoan ^a   Chen, Yan Qiu ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Discrete fourier transform; Split radix algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS; THEOREM PROVING;

DISCRETE FOURIER TRANSFORMS (DCT); SPLIT RADIX ALGORITHMS;

DIGITAL SIGNAL PROCESSING;

EID: 0032095728     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.686687     Document Type: Article

References (8)

1. P. Duhamel, "Implementation of 'split-radix' FFT algorithms for complex, real, and real-symmetric data," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 285-295, 1986.
2. m DFT's," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-37, pp. 57-64, Jan. 1989.
3. Y. Suzuki, T. Sone, and K. Kido, "A new algorithm of radix 3, 6, and 12," IEEE Trans, on Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 389-383, Feb. 1986.
4. V. Sorensen, M. T. Heideman, and C. S. Burreu, "On computing the split-radix FFT," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 152-156, Feb. 1986.
5. R. Stasinski, "Radix-K FFT's using K-point convolutions," IEEE Trans. Signal Processing, vol. 42, pp. 743-750, Apr. 1994.
6. H. K. Sorensen, D. L. Jones, M. T. Heideman, and C.S. Burrus, "Realvalued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 849-863, June 1987.
7. D. F. Elliott and K. R. Rao, Fast Transforms Algorithm, Analyses, Applications. New York: Academic, 1982, p. 164.
8. O. K. Ersoy, Fourier-Related Transforms, Ffast Algorithms and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1997.