Capacity Optimality of AMP in Coded Systems

Lei Liu; Chulong Liang; Junjie Ma; Li Ping

doi:10.1109/ISIT45174.2021.9518062

Capacity Optimality of AMP in Coded Systems

Lei Liu, Chulong Liang, Junjie Ma, Li Ping

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

2 Citations (Scopus)

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. We provide related numerical results of binary signaling using irregular low-density parity-check (LDPC) codes. We show that the optimized codes demonstrate significantly better performance over unmatched 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.

Original language	English
Title of host publication	2021 IEEE International Symposium on Information Theory
Subtitle of host publication	Proceedings
Publisher	IEEE
Pages	1588-1593
ISBN (Electronic)	978-1-5386-8209-8
ISBN (Print)	978-1-5386-8210-4
DOIs	https://doi.org/10.1109/ISIT45174.2021.9518062
Publication status	Published - 2021
Event	2021 IEEE International Symposium on Information Theory (ISIT 2021) - Virtual, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021 https://2021.ieee-isit.org/TechnicalProgram.asp https://2021.ieee-isit.org/default.asp

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2021 IEEE International Symposium on Information Theory (ISIT 2021)
Place	Australia
City	Melbourne
Period	12/07/21 → 20/07/21
Internet address	https://2021.ieee-isit.org/TechnicalProgram.asp https://2021.ieee-isit.org/default.asp

Access Output

10.1109/ISIT45174.2021.9518062

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{10d6d65dcb754fcf8f6d453f7fe98a76,

title = "Capacity Optimality of AMP in Coded Systems",

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. We provide related numerical results of binary signaling using irregular low-density parity-check (LDPC) codes. We show that the optimized codes demonstrate significantly better performance over unmatched 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.",

author = "Lei Liu and Chulong Liang and Junjie Ma and Li Ping",

year = "2021",

doi = "10.1109/ISIT45174.2021.9518062",

language = "English",

isbn = "978-1-5386-8210-4",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "IEEE",

pages = "1588--1593",

booktitle = "2021 IEEE International Symposium on Information Theory",

address = "United States",

note = "2021 IEEE International Symposium on Information Theory (ISIT 2021) ; Conference date: 12-07-2021 Through 20-07-2021",

url = "https://2021.ieee-isit.org/TechnicalProgram.asp, https://2021.ieee-isit.org/default.asp",

}

Liu, L, Liang, C, Ma, J & Ping, L 2021, Capacity Optimality of AMP in Coded Systems. in 2021 IEEE International Symposium on Information Theory: Proceedings. IEEE International Symposium on Information Theory - Proceedings, IEEE, pp. 1588-1593, 2021 IEEE International Symposium on Information Theory (ISIT 2021), Melbourne, Victoria, Australia, 12/07/21. https://doi.org/10.1109/ISIT45174.2021.9518062

Capacity Optimality of AMP in Coded Systems. / Liu, Lei; Liang, Chulong; Ma, Junjie et al.
2021 IEEE International Symposium on Information Theory: Proceedings. IEEE, 2021. p. 1588-1593 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Capacity Optimality of AMP in Coded Systems

AU - Liu, Lei

AU - Liang, Chulong

AU - Ma, Junjie

AU - Ping, Li

PY - 2021

Y1 - 2021

N2 - 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. We provide related numerical results of binary signaling using irregular low-density parity-check (LDPC) codes. We show that the optimized codes demonstrate significantly better performance over unmatched 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.

AB - 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. We provide related numerical results of binary signaling using irregular low-density parity-check (LDPC) codes. We show that the optimized codes demonstrate significantly better performance over unmatched 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.

UR - http://www.scopus.com/inward/record.url?scp=85112349700&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85112349700&origin=recordpage

U2 - 10.1109/ISIT45174.2021.9518062

DO - 10.1109/ISIT45174.2021.9518062

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 978-1-5386-8210-4

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1588

EP - 1593

BT - 2021 IEEE International Symposium on Information Theory

PB - IEEE

T2 - 2021 IEEE International Symposium on Information Theory (ISIT 2021)

Y2 - 12 July 2021 through 20 July 2021

ER -

Capacity Optimality of AMP in Coded Systems

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this