Sign up & Download
Sign in

Time-Frequency Representation Based on an Adaptive Short-Time Fourier Transform

by Jingang Zhong Jingang Zhong, Yu Huang Yu Huang
IEEE Transactions on Signal Processing ()

Abstract

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.

Cite this document (BETA)

Available from ieeexplore.ieee.org
Page 1
hidden

Readership Statistics

11 Readers on Mendeley
by Discipline
 
 
 
by Academic Status
 
45% Ph.D. Student
 
18% Student (Master)
 
9% Senior Lecturer
by Country
 
18% Japan
 
18% China
 
18% United States

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in