Title :
Efficient computation of the split-radix FFT
Author :
Skodras, A.N. ; Constantinides, A.G.
Author_Institution :
Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK
fDate :
2/1/1992 12:00:00 AM
Abstract :
The authors look at the efficient computation of the one-butterfly inplace complex split-radix fast Fourier transform algorithm. The proposed approach is based on the conventional three-loop indexing structure, in which redundancies associated with the indexing scheme have been removed at the expense of memory. As a result an increase in speed of up to 10% is achieved depending on the FFT sequence length
Keywords :
fast Fourier transforms; signal processing; efficient computation; fast Fourier transform algorithm; indexing scheme; one-butterfly inplace complex split-radix; sequence length; signal processing; split-radix FFT; three-loop indexing structure;
Journal_Title :
Radar and Signal Processing, IEE Proceedings F