Efficient algorithms for the discrete Gabor transform with a long FIR window
From MaRDI portal
Publication:438652
DOI10.1007/s00041-011-9210-5zbMath1245.42025OpenAlexW2006791214MaRDI QIDQ438652
Publication date: 31 July 2012
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-011-9210-5
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for wavelets (65T60) General harmonic expansions, frames (42C15)
Related Items (8)
THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX ⋮ Effective approach to calculate analysis window in infinite discrete Gabor transform ⋮ Time-frequency and time-scale analysis of deformed stationary processes, with application to non-stationary sound modeling ⋮ Star DGT: a robust Gabor transform for speech denoising ⋮ A Survey on the Unconditional Convergence and the Invertibility of Frame Multipliers with Implementation ⋮ An optimally concentrated Gabor transform for localized time-frequency components ⋮ Vector-valued weak Gabor dual frames on discrete periodic sets ⋮ Nonstationary Gabor frames -- approximately dual frames and reconstruction errors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The restricted isometry property for time-frequency structured random matrices
- Theory, implementation and applications of nonstationary Gabor frames
- Continuity properties of the Gabor frame operator
- Discrete Gabor transforms: The Gabor-Gram matrix approach
- On rationally oversampled Weyl-Heisenberg frames
- Gabor analysis and algorithms. Theory and applications
- Foundations of time-frequency analysis
- Advances in Gabor analysis
- Frames and pseudo-inverses
- Iterative algorithms to approximate canonical Gabor windows: Computational aspects
- THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX
- Oversampling in the Gabor scheme
- A set of level 3 basic linear algebra subprograms
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- Identification of Matrices Having a Sparse Representation
- Novel DCT-Based Real-Valued Discrete Gabor Transform and Its Fast Algorithms
- A Linear Cost Algorithm to Compute the Discrete Gabor Transform
- Discrete Cosine Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Numerical Analysis: A fast fourier transform algorithm for real-valued series
- An introduction to frames and Riesz bases
This page was built for publication: Efficient algorithms for the discrete Gabor transform with a long FIR window
