An extended split-radix FFT algorithm

An extended split-radix fast Fourier transform (FFT) algorithm is proposed. The extended split-radix FFT algorithm has the same asymptotic arithmetic complexity as the conventional split-radix FFT algorithm. Moreover, this algorithm has the advantage of fewer loads and stores than either the conventional split-radix FFT algorithm or the radix-4 FFT algorithm.

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

[2]  P. Duhamel,et al.  `Split radix' FFT algorithm , 1984 .

[3]  Mit Press.  A Fast Fourier Transform Algorithm Using Base 8 Iterations , 1969 .

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