An extended split-radix FFT algorithm
Author:
- 1 May 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 8 (5) , 145-147
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.Keywords
This publication has 4 references indexed in Scilit:
- Split-radix algorithms for length-p/sup m/ DFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- On computing the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- A Fast Fourier Transform Algorithm Using Base 8 IterationsMathematics of Computation, 1968