Time-Frequency Representation Based on an Adaptive Short-Time Fourier Transform
In this paper, a new concise algorithm about time-frequency representation (TFR) based on an adaptive short-time Fourier transform (ASTFT) is presented. In this algorithm, the analysis window width is equal to the local stationary length which is measured by the instantaneous frequency gradient (IFG...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on signal processing 2010-10, Vol.58 (10), p.5118-5128 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, a new concise algorithm about time-frequency representation (TFR) based on an adaptive short-time Fourier transform (ASTFT) is presented. In this algorithm, the analysis window width is equal to the local stationary length which is measured by the instantaneous frequency gradient (IFG) of the signal. And the instantaneous frequency (IF) of the signal is obtained by detecting the ridge of wavelet transform (WT). The ASTFT provides much better performance than conventional TFR algorithms. Furthermore, the algorithm is simpler and more computational efficient than some of other adaptive TFR algorithms proposed previously. Several examples are presented to illustrate its behavior on different kinds of signals and demonstrate its validity. |
---|---|
ISSN: | 1053-587X 1941-0476 |
DOI: | 10.1109/TSP.2010.2053028 |