Sliding DFT and Zero Padding

In many circumstances, it is preferred to simultaneously use a recursive Discrete Fourier Transform (DFT) and the zero padding, the former for its computational efficiency, the latter for the interpolation in the frequency domain. In the present article, we develop a new sliding DFT algorithm, which performs recursive spectral estimation of zero-padded time series. In order to ensure the stability of the process, we selected the estimator with guaranteed stability through the damping factor. Error analysis shows that the damping factor produces systematic errors and the errors in question are dependent upon the phase of the input signal.

[1]  Krzysztof Duda,et al.  Accurate, Guaranteed Stable, Sliding Discrete Fourier Transform [DSP Tips & Tricks] , 2010, IEEE Signal Processing Magazine.

[2]  Tae-Gyu Chang,et al.  Analytic derivation of the finite wordlength effect of the twiddle factors in recursive implementation of the sliding-DFT , 2000, IEEE Trans. Signal Process..

[3]  Chun-Su Park,et al.  Fast, Accurate, and Guaranteed Stable Sliding Discrete Fourier Transform [sp Tips&Tricks] , 2015, IEEE Signal Processing Magazine.

[4]  R. Lyons,et al.  An update to the sliding DFT , 2004, IEEE Signal Process. Mag..

[5]  Y. Lim,et al.  A comment on the computational complexity of sliding FFT , 1992 .

[6]  E. Jacobsen,et al.  The sliding DFT , 2003, IEEE Signal Process. Mag..

[7]  J.K. Soh,et al.  A numerically-stable sliding-window estimator and its application to adaptive filters , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[8]  Chun-Su Park Guaranteed-Stable Sliding DFT Algorithm With Minimal Computational Requirements , 2017, IEEE Transactions on Signal Processing.