An extended split-radix FFT algorithm
IEEE Signal Processing Letters2001Vol. 8(5), pp. 145–147
Citations Over TimeTop 10% of 2001 papers
Abstract
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.
Related Papers
- → An extended split-radix FFT algorithm(2001)86 cited
- → Five-step FFT algorithm with reduced computational complexity(2006)9 cited
- → A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs(2006)4 cited
- → A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM(2011)1 cited
- → A family of MD FFT algorithms of complexity intermediate between the MD Cooley-Tukey FFT and the MD prime-factor FFT(2002)