Issue No. 01 - January (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.46292
<p>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.</p>
recursive algorithm; discrete Fourier transform; moving-window-type processing; computational structure; fully concurrent; vectorized updating; fast Fourier transforms; parallel algorithms; parallel architectures.
J.L. Aravena, "Recursive Moving Window DFT Algorithm", IEEE Transactions on Computers, vol. 39, no. , pp. 145-148, January 1990, doi:10.1109/12.46292