Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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