Discrete Gabor transform

Authors:
S. Qian;D. Chen
Affiliations:
National Instrum., Austin, TX;-
Venue:
IEEE Transactions on Signal Processing
Year:
1993

Citing 0
Cited 6

Fast communication: Parallel lattice structures of block time-recursive discrete Gabor transform and its inverse transform

Signal Processing
Auto-Wigner-Ville distribution via non-adaptive and adaptive signal decomposition

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

Mathematics and Computers in Simulation
Multirate-based fast parallel algorithms for DCT-kernel-based real-valued discrete Gabor transform

Signal Processing
Mercury-Waterfilling for Generalized Multicarrier Signaling

Wireless Personal Communications: An International Journal
A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech

IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP)

Quantified Score

Hi-index	35.68

Visualization

Abstract

A feasible algorithm for implementing the Gabor expansion, the coefficients of which are computed by the discrete Gabor transform (DGT), is presented. For a given synthesis window and sampling pattern, computing the auxiliary biorthogonal function of the DGT is nothing more than solving a linear system. The DGT presented applies for both finite as well as infinite sequences. By exploiting the nonuniqueness of the auxiliary biorthogonal function at oversampling an orthogonal like DGT is obtained. As the discrete Fourier transform (DFT) is a discrete realization of the continuous-time Fourier transform, similarly, the DGT introduced provides a feasible vehicle to implement the useful Gabor expansion