A User's Guide to Compressed Sensing for Communications Systems

Kazunori HAYASHI, Masaaki NAGAHARA, Toshiyuki TANAKA

Summary :

This survey provides a brief introduction to compressed sensing as well as several major algorithms to solve it and its various applications to communications systems. We firstly review linear simultaneous equations as ill-posed inverse problems, since the idea of compressed sensing could be best understood in the context of the linear equations. Then, we consider the problem of compressed sensing as an underdetermined linear system with a prior information that the true solution is sparse, and explain the sparse signal recovery based on ₁ optimization, which plays the central role in compressed sensing, with some intuitive explanations on the optimization problem. Moreover, we introduce some important properties of the sensing matrix in order to establish the guarantee of the exact recovery of sparse signals from the underdetermined system. After summarizing several major algorithms to obtain a sparse solution focusing on the ₁ optimization and the greedy approaches, we introduce applications of compressed sensing to communications systems, such as wireless channel estimation, wireless sensor network, network tomography, cognitive radio, array signal processing, multiple access scheme, and networked control.

• Publication: IEICE TRANSACTIONS on Communications Vol.E96-B No.3 pp.685-712
• Publication Date: 2013/03/01
• Online ISSN: 1745-1345
• DOI: 10.1587/transcom.E96.B.685
• Type of Manuscript: INVITED SURVEY PAPER

Authors

Kazunori HAYASHI
Masaaki NAGAHARA
Toshiyuki TANAKA

Keyword

compressed sensing,  sparse signal,  compressible signal,  ₁-norm,  underdetermined system