Capacity Optimality of AMP in Coded Systems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

6 Scopus Citations
View graph of relations

Author(s)

  • Lei Liu
  • Chulong Liang
  • Junjie Ma
  • Li Ping

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)4429-4445
Journal / PublicationIEEE Transactions on Information Theory
Volume67
Issue number7
Online published3 Jun 2021
Publication statusPublished - Jul 2021

Abstract

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.

Research Area(s)

  • Approximate message passing (AMP), arbitrary input distributions, channel capacity, channel coding, large random matrix system

Citation Format(s)

Capacity Optimality of AMP in Coded Systems. / Liu, Lei; Liang, Chulong; Ma, Junjie; Ping, Li.

In: IEEE Transactions on Information Theory, Vol. 67, No. 7, 07.2021, p. 4429-4445.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review