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