Capacity Optimality of AMP in Coded Systems
Capacity Optimality of AMP in Coded Systems
复制标题
DOI:
10.1109/tit.2021.3083748
复制
发表时间:
2021-02
影响因子:
2.5
通讯作者:
Lei Liu;C. Liang;Junjie Ma;L. Ping
中科院分区:
文献类型:
--
作者:
Lei Liu;C. Liang;Junjie Ma;L. Ping
This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish an area property based on the approximate message passing (AMP) algorithm. Under the assumption that the state evolution for AMP is correct for the coded system, the achievable rate of AMP is analyzed. We prove that AMP achieves the constrained capacity of the LRMS with an arbitrary signal distribution provided that a matching condition is satisfied. As a byproduct, we provide an alternative derivation for the constraint capacity of an LRMS using a proved property of AMP. We discuss realization techniques for the matching principle of binary signaling using irregular low-density parity-check (LDPC) codes and provide related numerical results. We show that the optimized codes demonstrate significantly better performance over un-matched ones under AMP. For quadrature phase shift keying (QPSK) modulation, bit error rate (BER) performance within 1 dB from the constrained capacity limit is observed.