Approximation of matrices by Gabor multipliers

Approximation of matrices by Gabor multipliers

We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters 2004-11, Vol.11 (11), p.883-886
Hauptverfasser: Feichtinger, H.G., Hampejs, M., Kracher, G.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Approximation algorithms
Displays
Fast Fourier transforms
Filtering
Fourier transforms
Gabor filters
Inverse
Lattices
Linear approximation
Linear systems
Mathematical analysis
Matrices
Multipliers
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2004.833581