Finite Synchrosqueezing Transform Based On The STFT
This work provides a discrete, matrix-based formulation of synchrosqueezing for finite signals, which is an incremental extension of existing continuous methods to a practical finite setting.
The authors define a finite version of the STFT-based synchrosqueezing transform for time-frequency analysis, achieving sparse and invertible decomposition of finite complex signals. They demonstrate its properties and compare it to the standard finite STFT on example signals.
The finite STFT Synchrosqueezing transform is a time-frequency analysis method that can decompose finite complex signals into time-varying oscillatory components. This representation is sparse and invertible, allowing recovery of the original signal. The STFT Synchrosqueezing transform on finite dimensional signals has the advantage of an efficient matrix representation. This article defines the finite STFT Synchrosqueezing transform and describes some properties of this transform. We compare the finite STFT and the finite STFT Synchrosqueezing transform by applying these transform to a set of signals.