Discrete Gabor transforms with complexity \(O(N\log N)\)
From MaRDI portal
Publication:1960495
DOI10.1016/S0165-1684(99)00030-4zbMath1027.65518MaRDI QIDQ1960495
Phyllis E. Crandall, Sigang Qiu, Feng Zhou
Publication date: 12 January 2000
Published in: Signal Processing (Search for Journal in Brave)
complexityalgorithmsGabor analysisFast Fourier transformdiscrete Gabor transformsdual Gabor waveletsGabor synthesis
Numerical methods for wavelets (65T60) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Related Items (4)
Unified parallel lattice structures for block time-recursive real-valued discrete Gabor transforms ⋮ An ultra-fast smoothing algorithm for time-frequency transforms based on Gabor functions ⋮ Sparse time-frequency representation based on multiwindow discrete Gabor transform ⋮ Eulerian Gaussian beams for Schrödinger equations in the semi-classical regime
This page was built for publication: Discrete Gabor transforms with complexity \(O(N\log N)\)
