Title :
Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data
Author :
Marti-Puig, Pere
Author_Institution :
Dept. of Digital Inf. Technol., Univ. of Vic, Vic
Abstract :
Two radix-2 families of fast Fourier transform (FFT) algorithms that have the property that both inputs and outputs are addressed in natural order are derived in this letter. The algorithms obtained have the same complexity that Cooley-Tukey radix-2 algorithms but avoid the bit-reversal ordering applied to the input. These algorithms can be thought as a variation of the radix-2 Cooley-Tukey ones.
Keywords :
digital arithmetic; fast Fourier transforms; matrix decomposition; bit-reversal ordering; fast Fourier transform; matrix factorization; ordered input data; ordered output data; radix-2 FFT algorithms; Bibliographies; Central Processing Unit; Digital arithmetic; Discrete transforms; Fast Fourier transforms; Flow graphs; Geometry; Helium; Information technology; Pipelines; Fast algorithms; fast Fourier transform (FFT);
Journal_Title :
Signal Processing Letters, IEEE
DOI :
10.1109/LSP.2008.2003993
