Identification of Matrices having a Sparse Representation
arXiv:1504.05807 · doi:10.1109/TSP.2008.928503
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. 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 Basis Pursuit with the time-frequency shift dictionary and various dictionaries of random matrices.
References in corpus (6)
- High-Resolution Radar via Compressed Sensing
- Compressed Sensing and Redundant Dictionaries
- Performance Bounds on Sparse Representations Using Redundant Frames
- Counting faces of randomly-projected polytopes when the projection radically lowers dimension
- Random Sampling of Sparse Trigonometric Polynomials II - Orthogonal Matching Pursuit versus Basis Pursuit
- Stability results for random sampling of sparse trigonometric polynomials
Cited by in corpus (9)
- High-Resolution Radar via Compressed Sensing
- Two are better than one: Fundamental parameters of frame coherence
- The restricted isometry property for time-frequency structured random matrices
- Restricted Isometries for Partial Random Circulant Matrices
- Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role in Model Selection
- Accurate detection of moving targets via random sensor arrays and Kerdock codes
- Super-Resolution Radar
- Approximating Sparse Matrices and their Functions using Matrix-vector products
- Gabor fusion frames generated by difference sets