Fast approximation of time--frequency representations at arbitrary frequencies
From MaRDI portal
Recommendations
- A flexible and approximate computing approach for time-frequency distributions
- Fast and memory-efficient algorithms for computing quadratic time-frequency distributions
- Joint recursive implementation of time-frequency representations and their modified version by the reassignment method
- scientific article; zbMATH DE number 718885
Cited in
(15)- Efficient computation of the discrete pseudo-Wigner distribution
- The fast Slepian transform
- Speedy numerical algorithms and architecture for additive spectral analysis
- Fast SOLA-based time scale modification using envelope matching
- scientific article; zbMATH DE number 1975208 (Why is no real title available?)
- The power of frequency computation
- Fast algorithms for polynomial time frequency transform
- A new fast Fourier method for evaluating Fourier spectra at arbitrary frequencies
- Fast parametric time-frequency modeling of nonstationary signals
- Fast and memory-efficient algorithms for computing quadratic time-frequency distributions
- A flexible and approximate computing approach for time-frequency distributions
- Fast algorithm for real joint time–frequency transformations of time-varying signals
- Fast computation of spectral centroids
- Pseudo-power scale signatures: Frequency domain approach
- Quasi Monte Carlo time-frequency analysis
This page was built for publication: Fast approximation of time--frequency representations at arbitrary frequencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274949)