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.
No takes yet. Share an insight, caveat, or question.
Daisuke Takahashi (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: