Techniques for improving the finite length performance of sparse superposition codes
arXiv:1705.02091 · doi:10.1109/TCOMM.2017.2776937
Abstract
Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically capacity-achieving with computationally feasible decoding. However, a direct implementation of the capacity-achieving construction does not give good finite length error performance. In this paper, we consider sparse superposition codes with approximate message passing (AMP) decoding, and describe a variety of techniques to improve their finite length performance. These include an iterative algorithm for SPARC power allocation, guidelines for choosing codebook parameters, and estimating a critical decoding parameter online instead of pre-computation. We also show how partial outer codes can be used in conjunction with AMP decoding to obtain a steep waterfall in the error performance curves. We compare the error performance of AMP-decoded sparse superposition codes with coded modulation using LDPC codes from the WiMAX standard.
arXiv comment13 pages, 16 figures. To appear in IEEE Transactions on Communications
References in corpus (4)
- Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
- Approximate message-passing decoder and capacity-achieving sparse superposition codes
- Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
- Replica Analysis and Approximate Message Passing Decoder for Superposition Codes
Cited by in corpus (6)
- Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access with a Massive MIMO Receiver
- Sparse Regression Codes
- Capacity-achieving Spatially Coupled Sparse Superposition Codes with AMP Decoding
- The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding
- Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes
- Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications