Title :
An extended split-radix FFT algorithm
Author :
Takahashi, Daisuke
Author_Institution :
Dept. of Inf. & Comput. Sci., Saitama Univ., Urawa, Japan
fDate :
5/1/2001 12:00:00 AM
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 :
computational complexity; fast Fourier transforms; signal processing; asymptotic arithmetic complexity; conventional split-radix FFT algorithm; extended split-radix FFT algorithm; fast Fourier transform; radix-4 FFT algorithm; signal processing; Arithmetic; Computer science education; Discrete Fourier transforms; Fast Fourier transforms; Helium; Performance evaluation; Signal processing algorithms;
Journal_Title :
Signal Processing Letters, IEEE
