On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Abstract

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to design a sensing matrix $A$ and a recovery algorithm, such that the sparse binary vector $\mathbf{x}$ can be recovered reliably from the measurements $\mathbf{y}=A\mathbf{x}+\sigma \mathbf{z}$, where $\mathbf{z}$ is additive white Gaussian noise. We propose to design $A$ as a parity check matrix of a low-density parity-check code (LDPC), and to recover $\mathbf{x}$ from the measurements $\mathbf{y}$ using a Markov chain Monte Carlo algorithm, which runs relatively fast due to the sparse structure of $A$. The performance of our scheme is comparable to state-of-the-art schemes, which use dense sensing matrices, while enjoying the advantages of using a sparse sensing matrix.

arXiv commentAccepted to Entropy Special Issue on "Information-Theoretic Aspects of Non-Orthogonal and Massive Access for Future Wireless Networks"

References in corpus (16)

• Message Passing Algorithms for Compressed Sensing
• Structured Compressed Sensing: From Theory to Applications
• The dynamics of message passing on dense graphs, with applications to compressed sensing
• Bilinear Generalized Approximate Message Passing
• Compressive Phase Retrieval via Generalized Approximate Message Passing
• SPARCs for Unsourced Random Access
• LDPC Codes for Compressed Sensing
• Group Testing: An Information Theory Perspective
• Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
• Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: an Analysis of Stationary Distribution and Mixing Time
• Fast Markov chain Monte Carlo sampling for sparse Bayesian inference in high-dimensional inverse problems using L1-type priors
• Efficient Scheduling for the Massive Random Access Gaussian Channel
• Near-optimal matrix recovery from random linear measurements
• Sparse High-Dimensional Linear Regression. Algorithmic Barriers and a Local Search Algorithm
• Near-Optimal Detection in MIMO Systems using Gibbs Sampling
• Minimum Feedback for Collision-Free Scheduling in Massive Random Access