Decay of correlations: An application to low-density parity check codes

Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics. In this work we apply these ideas to a special class of low density parity check codes (LDPC) on the binary input Gaussian white noise channel (BIAWGNC). We give a rigorous derivation of the maximum a posteriori (MAP) Generalized EXIT curve (the derivative with respect to the noise parameter of the input-output conditional entropy) for high values of the noise. Our result agrees with the formal expressions obtainable from replica calculations, and is the first result that fully justifies the replica formulas beyond the binary erasure channel (BEC). It also shows that the MAP and BP-GEXIT curves are equal in the high noise regime. The ensemble of LDPC codes considered here is constructed by adding randomly a sufficient fraction p of degree one variable nodes to a standard irregular LDPC(Lambda, P) Tanner graphs.

[1]  Nicolas Macris,et al.  Proof of replica formulas in the high noise regime for communication using LDGM codes , 2008, 2008 IEEE Information Theory Workshop.

[2]  Nicolas Macris,et al.  Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Andrea Montanari,et al.  Asymptotic Rate versus Design Rate , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Nicolas Macris,et al.  Sharp Bounds on Generalized EXIT Functions , 2007, IEEE Transactions on Information Theory.

[5]  Nicolas Macris,et al.  Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes , 2007, IEEE Transactions on Information Theory.

[6]  Andrea Montanari,et al.  Tight bounds for LDPC and LDGM codes under MAP decoding , 2004, IEEE Transactions on Information Theory.

[7]  A. Rényi,et al.  Probabilistic methods in group theory , 1965 .

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  Nicolas Macris,et al.  Sharp Bounds for MAP Decoding of General Irregular LDPC Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  C. Méasson Conservation laws for coding , 2006 .

[11]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[12]  Andrea Montanari,et al.  Maximum a posteriori decoding and turbo codes for general memoryless channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..