Fast, Accurate, and Guaranteed Stable Sliding Discrete Fourier Transform [sp Tips&Tricks]

This article introduces a new guaranteed stable SDFT (gSDFT) algorithm of which the computational requirement is the lowest among the existing stable SDFT algorithms. Moreover, the output of the proposed gSDFT is mathematically equivalent to that of the DFT regardless of the window size and the time index. This work is motivated by our previous study on the hopping DFT (HDFT) [5]. Let us start with a brief description of the existing stable SDFT algorithms.