Discrete Gabor structures and optimal representations

Authors:
S. Qiu;H.G. Feichtinger
Affiliations:
Dept. of Math., Connecticut Univ., Storrs, CT;-
Venue:
IEEE Transactions on Signal Processing
Year:
1995

Citing 0
Cited 4

Macromolecular sequence analysis using multiwindow Gabor representations

Signal Processing
Detection-recognition algorithm based on the Gabor transform for unknown signals embedded in unknown noise

Mathematics and Computers in Simulation
Superposition frames for adaptive time-frequency analysis and fast reconstruction

IEEE Transactions on Signal Processing
A linear cost algorithm to compute the discrete gabor transform

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

The idea of Gabor's (1946) signal expansion is to represent a signal in terms of a discrete set of time-shifted and frequency modulated signals that are localized in the time-frequency (or phase) space. We present detailed descriptions of the block and banded structures for the Gabor matrices. Based on the explicit descriptions of the sparsity of such matrices, we can establish the sparse form of the Gabor matrix and obtain the dual Gabor atom (mother wavelet), the inverse of the Gabor frame operator, and carry out the discrete finite Gabor transform in a very efficient way. Some explicit sufficient and also necessary conditions are derived for a Gabor atom g to generate a Gabor frame with respect to a TF-lattice (a, b)