Capacity Optimality of AMP in Coded Systems
From MaRDI portal
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 so-called Turbo approximate message passing (Turbo-AMP) algorithm. Under the assumption that the state evolution for AMP is correct for the coded system, the achievable rate of Turbo-AMP is analyzed. We prove that Turbo-AMP achieves the constraint 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 optimized codes demonstrate significantly better performance over un-matched ones under Turbo-AMP. For quadrature phase shift keying (QPSK) modulation, bit error rate (BER) performance within 1 dB from the constrained capacity limit is observed.
Cited in
(3)- Foreign direct investments, renewable electricity output, and ecological footprints: do financial globalization facilitate renewable energy transition and environmental welfare in Bangladesh?
- Maximizing the output energy of a linear channel with a time- and amplitude-limited input
- Skimming impact of a thin heavy body on a shallow liquid layer
This page was built for publication: Capacity Optimality of AMP in Coded Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001801)
