This Article 
 Bibliographic References 
 Add to: 
Recursive Moving Window DFT Algorithm
January 1990 (vol. 39 no. 1)
pp. 145-148

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.

[1] R. E. Blahut,Fast Algorithms for Digital Signal Processing. Reading: MA: Addison-Wesley, 1985.
[2] N. Suehiro and M. Hatori, "Fast algorithms for the DFT and other sinusoidal transforms,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 3, pp. 642-644, June 1986.
[3] A. Guessoum and R. Merserau, "Fast algorithms for the multidimensional discrete fourier transform,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 4, pp. 937-943, Aug. 1986.
[4] R. M. Owens and J. Ja'Ja', "VLSI chip for the Winograd/prime factor algorithm to compute the discrete Fourier transform,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 4, pp. 979-989, Aug. 1986.
[5] H. Yeh, "Matrix-based DFT and its implementation on systolic arrays," inProc. 20th Asiloman Conf. Syst. Comput., Nov. 1986.
[6] E. H. Wold and A. M. Despain, "Pipeline and parallel-pipeline FFT processors for VLSI implementations,"IEEE Trans. Comput., vol. C-33, no. 5, pp. 414-426, May 1984.
[7] J. Kurek, "The general state-space model for a two-dimensional linear digital system,"IEEE Trans. Automat. Contr., vol. AC-30, no. 6, pp. 600-602, June 1985.
[8] W. A. Porter and J. L. Aravena, "1-D models form-D processes,"IEEE Trans. Circuits Syst., vol. CAS-31, no. 8, pp. 742-744, Aug. 1984.
[9] D. D. Givone and R. D. Roesser, "Multidimensional linear iterative circuits--General properties,"IEEE Trans. Comput., vol. C-21, Oct. 1972.
[10] J. L. Aravena and W. A. Porter, "Recursive forms for optimalm-D filters,"IEE Proc., to be published.
[11] G. Franklin and J. Powell,Digital Control: Theory and Applications. Reading, MA: Addison-Wesley, 1984.

Index Terms:
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. 1, pp. 145-148, Jan. 1990, doi:10.1109/12.46292
Usage of this product signifies your acceptance of the Terms of Use.