On Compressive Sensing in Coding Problems: A Rigorous Approach

Wasim Huleihel, Neri Merhav, Shlomo Shamai

Research output: Contribution to journalArticlepeer-review

Abstract

We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays a central role in a variety of communications/signal processing problems. Such an expression was addressed previously by bounds, by simulations, and by the (nonrigorous) replica method. The expression of the mutual information is based on techniques used, addressing the minimum mean square error analysis. Using these expressions, we study specifically a variety of sparse linear communication models, which include coding in various settings, accounting also for multiple access channels, broadcast channels, and different wiretap problems. For those, we provide single-letter expressions and derive achievable rates, capturing the communications/signal processing features of these contemporary models.

Original languageEnglish
Article number7185450
Pages (from-to)5727-5744
Number of pages18
JournalIEEE Transactions on Information Theory
Volume61
Issue number10
DOIs
StatePublished - 1 Oct 2015
Externally publishedYes

Keywords

  • Channel coding
  • broadcast channel
  • multiple access channel (MAC)
  • random matrix theory
  • replica method
  • sparsity pattern
  • state-dependent channels
  • wiretap channel

Fingerprint

Dive into the research topics of 'On Compressive Sensing in Coding Problems: A Rigorous Approach'. Together they form a unique fingerprint.

Cite this