Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding

DOI10.1109/TIT.2017.2649460MaRDI QIDQ5280847zbMATH OpenFDO

Authors Cynthia Rush, A. Greig, Ramji Venkataramanan

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we propose an approximate message passing decoder for sparse superposition codes, whose decoding complexity scales linearly with the size of the design matrix. The performance of the decoder is rigorously analyzed and it is shown to asymptotically achieve the AWGN capacity with an appropriate power allocation. Simulation results are provided to demonstrate the performance of the decoder at finite blocklengths. We introduce a power allocation scheme to improve the empirical performance, and demonstrate how the decoding complexity can be significantly reduced by using Hadamard design matrices.

Cited in

(10)

• The all-or-nothing phenomenon in sparse linear regression
• Sparse high-dimensional linear regression. Estimating squared error and a phase transition
• Strong replica symmetry in high-dimensional optimal Bayesian inference
• An improved analysis of least squares superposition codes with Bernoulli dictionary
• Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
• A Unifying Tutorial on Approximate Message Passing
• Universality of approximate message passing with semirandom matrices
• Linear operator approximate message passing (OpAMP)
• Approximate message passing for general non-symmetric random matrices
• Elliptic approximate message passing and an application to theoretical ecology

This page was built for publication: Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding

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