Fast DFT algorithms for length N=q*2/sup m/

This paper presents a general split-radix algorithm which can flexibly compute the discrete Fourier transforms (DFT) of length q*2/sup m/ where q is an odd integer. Comparisons with previously reported algorithms show that substantial savings on arithmetic operations can be made. Furthermore, a wider range of choices on different sequence lengths is naturally provided.

[1]  Ken'iti Kido,et al.  A new FFT algorithm of radix 3, 6, and 12 , 1986, IEEE Trans. Acoust. Speech Signal Process..

[2]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3]  Ryszard Stasinski,et al.  Radix-K FFT's using K-point convolutions , 1994, IEEE Trans. Signal Process..

[4]  Douglas L. Jones,et al.  Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  Martin Vetterli,et al.  Split-radix algorithms for length-pm DFT's , 1989, IEEE Trans. Acoust. Speech Signal Process..

[6]  Pierre Duhamel,et al.  Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data , 1986, IEEE Trans. Acoust. Speech Signal Process..