Back to Search
Start Over
Techniques for Improving the Finite Length Performance of Sparse Superposition Codes.
- Source :
-
IEEE Transactions on Communications . Mar2018, Vol. 66 Issue 3, p905-917. 13p. - Publication Year :
- 2018
-
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 precomputation. 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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 66
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 128484512
- Full Text :
- https://doi.org/10.1109/TCOMM.2017.2776937