An adaptive resolution computationally efficient short-time Fourier transform

DOI10.1155/2008/932068zbMATH Open1214.94026OpenAlexW1983040066WikidataQ58645562 ScholiaQ58645562MaRDI QIDQ983398FDOQ983398

Authors: Saeed Mian Qaisar, Laurent Fesquet, Marc Renaudin 

Publication date: 22 July 2010

Published in: Research Letters in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2008/932068

Recommendations

• Time-Frequency Representation Based on an Adaptive Short-Time Fourier Transform
• Analysis of adaptive short-time Fourier transform-based synchrosqueezing transform
• FFT formulations of adaptive Fourier decomposition
• An adaptive sublinear-time block sparse Fourier transform
• Short-time fourier transform: two fundamental properties and an optimal implementation
• Adaptive windowed Fourier transform
• Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation
• scientific article; zbMATH DE number 1217618

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Wavelets and filter banks: theory and design
• Adaptive rate sampling and filtering based on level crossing sampling

Cited In (4)

• Adaptive rate sampling and filtering based on level crossing sampling
• Adaptive windowed Fourier transform
• Short-time fourier transform: two fundamental properties and an optimal implementation
• High resolution spectrograms using a component optimized short-term fractional Fourier transform

This page was built for publication: An adaptive resolution computationally efficient short-time Fourier transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983398)