期刊
IEEE TRANSACTIONS ON COMMUNICATIONS
卷 66, 期 3, 页码 905-917出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2017.2776937
关键词
Sparse regression codes; approximate message passing; low-complexity decoding; finite length performance; coded modulation
资金
- EPSRC [EP/N013999/1]
- EPSRC Doctoral Training Award
- EPSRC [EP/N013999/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [1355086, EP/N013999/1] Funding Source: researchfish
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据