Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes

DOI10.1109/TIT.2017.2713833MaRDI QIDQ5369844zbMATH OpenOpenAlexWikidataFDO

Authors Jean Barbier, Florent Krzakala

Publication date 19 October 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Abstract: We study the approximate message-passing decoder for sparse superposition coding on the additive white Gaussian noise channel and extend our preliminary work [1]. We use heuristic statistical-physics-based tools such as the cavity and the replica methods for the statistical analysis of the scheme. While superposition codes asymptotically reach the Shannon capacity, we show that our iterative decoder is limited by a phase transition similar to the one that happens in Low Density Parity check codes. We consider two solutions to this problem, that both allow to reach the Shannon capacity: i) a power allocation strategy and ii) the use of spatial coupling, a novelty for these codes that appears to be promising. We present in particular simulations suggesting that spatial coupling is more robust and allows for better reconstruction at finite code lengths. Finally, we show empirically that the use of a fast Hadamard-based operator allows for an efficient reconstruction, both in terms of computational time and memory, and the ability to deal with very large messages.

Cited in

(10)

• The all-or-nothing phenomenon in sparse linear regression
• 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
• Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis
• Message passing algorithms and improved LP decoding
• The committee machine: computational to statistical gaps in learning a two-layers neural network
• A Unifying Tutorial on Approximate Message Passing
• 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: Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes

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