Recursive Fourier transform algorithms with integrated windowing

Signal Processing

Volumn 87, Issue 5, 2007, Pages 1003-1013

  Gronczyński, Jarosław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Moving window DFT algorithm; Recursive Fourier transform (RFT); Windowing

Indexed keywords

ALGORITHMS; ESTIMATION; INTEGRATION; RECURSIVE FUNCTIONS;

MOVING WINDOW DFT ALGORITHMS; RECURSIVE FOURIER TRANSFORM (RFT); WINDOWING;

FOURIER TRANSFORMS;

EID: 33846638839     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2006.09.005     Document Type: Article

References (7)

1. Goertzel G. An algorithm for the evaluation of finite trigonometric series. Am. Math. Month. 65 (1958) 34-35
2. Halberstein J.H. Recursive, complex Fourier analysis for real-time applications. Proc. IEEE 54 (1966) 903
3. Rosendo Macias J.A., and Gomez Exposito A. Efficient moving-window DFT algorithms. IEEE Trans. Circuits Syst. II (1998) 256
4. Sorensen H.V., and Burrus S. Efficient Computation of the Short-time Fast Fourier Transform (1988), ICASSP, New York pp. 1894-1897
5. F.J. Harris, On the use of windows for harmonic analysis with the discrete Fourier transform, Proc. IEEE 66, January 1978, p. 51.
6. R. Hartley, K. Welles II, Recursive computation of the Fourier transform, in: Proceedings of the IEEE International Symposium on Circuits and Systems, vol. 3, New York, 1990, pp. 1792-1795.
7. Aravena J.L. Recursive moving window DFT algorithm. IEEE Trans. Comput. 39 1 (1990) 145-148