Recursive Fourier transform algorithms with integrated windowing

Authors:
Jarosław Gronczyński
Affiliations:
Chair of Electronic and Photonic Metrology, Wrocław University of Technology, ul. Prusa 53/55, 50-317 Wrocław, Poland
Venue:
Signal Processing
Year:
2007

Citing 1
Cited 1

Recursive Moving Window DFT Algorithm

IEEE Transactions on Computers

Efficient computation of the short-time DFT based on a modified radix-2 decimation-in-frequency algorithm

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

Recursive signal spectrum estimation algorithms based on the discrete Fourier transform (DFT) are presented in this paper. Unlike other methods of DFT evaluation, the recursive method updates the spectrum coefficients instead of calculating them from the beginning each time. Some difficulties with windowing are associated with this solution. A few developments of the classic recursive algorithm towards integration of the windowing process are proposed in this paper. They are based on a family of windows obtained by a multiple convolution of the rectangular window. Due to recursive realization the stability issues are taken in account. A solution which avoids this problem is included.