Title :
Recursive moving window DFT algorithm
Author :
Aravena, Jorge L.
Author_Institution :
Dept of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fDate :
1/1/1990 12:00:00 AM
Abstract :
A recursive algorithm is presented for computing the discrete Fourier transform (DFT). The algorithm is developed for a moving-window-type processing. The computational structure is fully concurrent and allows a vectorized updating of the DFT. The total time required for the updating could be as low as that of only one multiplication and two additions, regardless of the number of points. A possible structure for executing the computations is developed, and possible enhancements are analyzed
Keywords :
fast Fourier transforms; parallel algorithms; parallel architectures; computational structure; discrete Fourier transform; fully concurrent; moving-window-type processing; recursive algorithm; vectorized updating; Computer architecture; Discrete Fourier transforms; Electrons; Hardware; Life estimation; Parallel processing; Signal processing algorithms; Switching circuits; Testing; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
