Capacity Optimality of AMP in Coded Systems
arXiv:2102.05441
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 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.
arXiv commentAccepted by IEEE ISIT 2021. arXiv admin note: text overlap with arXiv:1901.09559
References in corpus (14)
- Message Passing Algorithms for Compressed Sensing
- Expectation Propagation for approximate Bayesian inference
- Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
- Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding
- Approximate message-passing decoder and capacity-achieving sparse superposition codes
- A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
- Capacity-Achieving MIMO-NOMA: Iterative LMMSE Detection
- A Factor Graph Approach to Joint OFDM Channel Estimation and Decoding in Impulsive Noise Environments
- The Mutual Information in Random Linear Estimation
- Improved message passing for inference in densely connected systems
- Approximate Message Passing Algorithm with Universal Denoising and Gaussian Mixture Learning
- Optimal Data Detection in Large MIMO
- Compressed Sensing via Universal Denoising and Approximate Message Passing
- A Unified Framework of State Evolution for Message-Passing Algorithms