Identification of matrices having a sparse representation (2007)
| Citations: | 12 - 3 self |
BibTeX
@TECHREPORT{Pfander07identificationof,
author = {Götz E. Pfander and Holger Rauhut and Jared Tanner},
title = {Identification of matrices having a sparse representation},
institution = {},
year = {2007}
}
OpenURL
Abstract
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Connections with sparse signal recovery allows for the use of efficient reconstruction techniques such as Basis Pursuit (BP). Of particular interest is the dictionary of time-frequency shift matrices and its role for channel estimation and identification in communications engineering. We present recovery results for BP with the time-frequency shift dictionary and various dictionaries of random matrices.







