Efficient computation of the split-radix FFT
Athanassios N. Skodras, Anthony George Constantinides · IEE Proceedings F Radar and Signal Processing · 1992
The paper is concerned with efficient computation of the one-butterfly inplace complex split-radix fast Fourier transform algorithm. The proposed approach is based on the conventional three-loop indexing structure, in which redundancies associated with the indexing scheme have been removed at the expense of memory. As a result an increase in speed of up to 10% is achieved depending on the FFT sequence length.