Approximation of Matrices by Gabor Multipliers

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 2004 Austria English Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Signal Processing Letters, volume 11, pages 883-886 (issn: 1070-9908,

Copyright policy )

Authors: Feichtinger, Hans Georg; Hampejs, Mario; Kracher, Guenther;

doi: 10.1109/lsp.2004.833581

Approximation of Matrices by Gabor Multipliers

- Summary
- Subjects
- Metrics

Abstract

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. Œ 2004 IEEE.

Country

Austria

Related Organizations

University of Vienna
Austria
TU Wien
Austria

Keywords

1010 Mathematics, 1010 Mathematik

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	17
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average