Papers
Topics
Authors
Recent
2000 character limit reached

STFT with Adaptive Window Width Based on the Chirp Rate (1705.08795v1)

Published 24 May 2017 in cs.IT and math.IT

Abstract: An adaptive time-frequency representation (TFR) with higher energy concentration usually requires higher complexity. Recently, a low-complexity adaptive short-time Fourier transform (ASTFT) based on the chirp rate has been proposed. To enhance the performance, this method is substantially modified in this paper: i) because the wavelet transform used for instantaneous frequency (IF) estimation is not signal-dependent, a low-complexity ASTFT based on a novel concentration measure is addressed; ii) in order to increase robustness to IF estimation error, the principal component analysis (PCA) replaces the difference operator for calculating the chirp rate; and iii) a more robust Gaussian kernel with time-frequency-varying window width is proposed. Simulation results show that our method has higher energy concentration than the other ASTFTs, especially for multicomponent signals and nonlinear FM signals. Also, for IF estimation, our method is superior to many other adaptive TFRs in low signal-to-noise ratio (SNR) environments.

Citations (117)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.