Share Email Print

Proceedings Paper

Computational frameworks for discrete Gabor analysis
Author(s): Thomas Strohmer
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 24 October 1997
PDF: 12 pages
Proc. SPIE 3162, Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, (24 October 1997); doi: 10.1117/12.279497
Show Author Affiliations
Thomas Strohmer, Univ. of Vienna (United States)

Published in SPIE Proceedings Vol. 3162:
Advanced Signal Processing: Algorithms, Architectures, and Implementations VII
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?