Computational frameworks for discrete Gabor analysis

Thomas Strohmer

The Gabor transform yields a discrete representation of a signal in the phase space. Since the Gabor transform is non-orthogonal, efficient reconstruction of a signal from its phase space samples is not straightforward and involves the computation of the so-called dual Gabor function. We present a unifying approach to the derivation of numerical algorithms for discrete Gabor analysis, based on unitary matrix factorization. The factorization point of view is notably useful for the design of efficient numerical algorithms. This presentation is the first systematic account of its kind. In particular, it is shown that different algorithms for the computation of the dual window correspond to different factorizations of the frame operator. Simple number theoretic conditions on the time-frequency lattice parameters imply additional structural properties of the frame operator.

Keywords: algorithms, Gabor analysis, wavelets, conjugate gradients, preconditioner
Published: In Proc. SPIE: Advanced Signal Processing Algorithms, Architectures, and Implementations VI. San Diego, 1997.

Download the paper as a GNU-ziped postscript file (93905 bytes).