The Order of Computation for Finite Discrete Gabor Transforms

DOI10.1109/TSP.1993.193132MaRDI QIDQ4034620zbMATH OpenFDO

Authors Richard S. Orr

Publication date 16 May 1993

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.1993.193132

zbMATH Keywords

computational complexitydeconvolutionGabor transformmethod of biorthogonal functionsshort-time Fourier transformZak transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Discrete Gabor transforms with complexity \(O(N\log N)\)
• Some results on discrete Gabor transforms for finite periodic sequences
• Discrete Gabor transforms: The Gabor-Gram matrix approach
• scientific article; zbMATH DE number 1111497
• Efficient Algorithms for Discrete Gabor Transforms on a Nonseparable Lattice
• A Linear Cost Algorithm to Compute the Discrete Gabor Transform
• On the rank of the discrete Gabor transform matrix.
• Derivation of the finite discrete Gabor transform by periodization and sampling
• Fast algorithms for generalized discrete Gabor expansions
• Implementation of Discretized Gabor Frames and Their Duals

Cited in

(5)

• Discrete Gabor transforms: The Gabor-Gram matrix approach
• Derivation of the finite discrete Gabor transform by periodization and sampling
• A fast implementation of the discrete 2-D Gabor transform
• Discrete Gabor transforms with complexity \(O(N\log N)\)
• Matching pursuit decomposition for high-resolution direction of arrival

This page was built for publication: The Order of Computation for Finite Discrete Gabor Transforms

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