Accurate, Guaranteed Stable, Sliding Discrete Fourier Transform [DSP Tips & Tricks]

This article presented a novel method of computing the SDFT that we call the modulated SDFT (mSDFT). The sliding discrete Fourier transform (SDFT) is a recursive algorithm that computes a DFT on a sample-by-sample basis. The accumulated errors and potential instabilities inherent in traditional SDFT algorithms are drastically reduced in the mSDFT. We removed the twiddle factor from the feedback in a traditional SDFT resonator and thus the finite precision of its representation is no longer a problem.

[1]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[2]  Richard G. Lyons,et al.  Understanding Digital Signal Processing , 1996 .

[3]  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).

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

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