A Caltech Library Service

Applications of sparse approximation in communications

Gilbert, A. C. and Tropp, J. A. (2005) Applications of sparse approximation in communications. In: International Symposium on Information Theory (ISIT '05), Adelaide, Australia, 4-9 September 2005. IEEE , Piscataway, NJ, pp. 1000-1004. ISBN 0-7803-9151-9.

See Usage Policy.


Use this Persistent URL to link to this item:


Sparse approximation problems abound in many scientific, mathematical, and engineering applications. These problems are defined by two competing notions: we approximate a signal vector as a linear combination of elementary atoms and we require that the approximation be both as accurate and as concise as possible. We introduce two natural and direct applications of these problems and algorithmic solutions in communications. We do so by constructing enhanced codebooks from base codebooks. We show that we can decode these enhanced codebooks in the presence of Gaussian noise. For MIMO wireless communication channels, we construct simultaneous sparse approximation problems and demonstrate that our algorithms can both decode the transmitted signals and estimate the channel parameters.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Tropp, J. A.0000-0003-1024-1791
Additional Information:© Copyright 2005 IEEE. Reprinted with permission. [Posted online: 2005-10-31] A.C.G. is supported by NSF DMS-0354600. The authors thank Robert Calderbank and Martin Strauss for helpful conversations.
Record Number:CaltechAUTHORS:GILisit05
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9042
Deposited By: Archive Administrator
Deposited On:22 Oct 2007
Last Modified:08 Nov 2021 20:55

Repository Staff Only: item control page