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
中科院分区:
计算机科学2区
文献类型:
--
作者:
Lei Liu;C. Liang;Junjie Ma;L. Ping

文献摘要

被引文献

相似文献

本文研究了涉及任意信号分布和正向误差控制(FEC)编码的大型随机矩阵系统(LRMS)模型。我们根据大概消息传递(AMP)算法建立区域属性。在假设AMP的状态进化对编码系统正确的假设下,分析了AMP的可实现速率。我们证明,如果满足匹配条件,则AMP具有任意信号分布的LRM的约束能力。作为副产品,我们使用AMP证明的属性为LRM的约束能力提供了替代推导。我们讨论了使用不规则的低密度平价检查(LDPC)代码的二元信号传导匹配原理的实现技术,并提供相关的数值结果。我们表明,优化的代码与放大器下的未匹配的代码相比表现出明显更好的性能。对于正交相移键合(QPSK)调制,观察到约束容量限制1 dB内的位错误率(BER)性能。
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.