On Compressive Sensing in Coding Problems: A Rigorous Approach

DOI10.1109/TIT.2015.2466632MaRDI QIDQ2977252zbMATH OpenOpenAlexFDO

Authors Wasim Huleihel, Neri Merhav, S. Shamai

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.5874

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

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 central role in a variety of communications/processing problems. Such an expression was addressed previously either by bounds, by simulations and by the (non-rigorous) replica method. The expression of the mutual information is based on techniques used in [1], addressing the minimum mean square error (MMSE) analysis. Using these expressions, we study specifically a variety of sparse linear communications models which include coding in different settings, accounting also for multiple access channels and different wiretap problems. For those, we provide single-letter expressions and derive achievable rates, capturing the communications/processing features of these timely models.

Cited in

(5)

• On data compression and recovery for sequences using constraints on the spectrum range
• Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
• Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
• scientific article; zbMATH DE number 782061 (Why is no real title available?)
• Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms

This page was built for publication: On Compressive Sensing in Coding Problems: A Rigorous Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977252)