Spatial Coupling as a Proof Technique and Three Applications

The aim of this paper is to show that spatial coupling can be viewed not only as a means to build better graphical models, but also as a tool to better understand uncoupled models. The starting point is the observation that some asymptotic properties of graphical models are easier to prove in the case of spatial coupling. In such cases, one can then use the so-called interpolation method to transfer known results for the spatially coupled case to the uncoupled one. Our main use of this framework is for Low-density parity check (LDPC) codes, where we use interpolation to show that the average entropy of the codeword conditioned on the observation is asymptotically the same for spatially coupled as for uncoupled ensembles. We give three applications of this result for a large class of LDPC ensembles. The first one is a proof of the so-called Maxwell construction stating that the MAP threshold is equal to the area threshold of the BP GEXIT curve. The second is a proof of the equality between the BP and MAP GEXIT curves above the MAP threshold. The third application is the intimately related fact that the replica symmetric formula for the conditional entropy in the infinite block length limit is exact.

[1]  S. Franz,et al.  Replica bounds for diluted non-Poissonian spin systems , 2003, cond-mat/0307367.

[2]  Nicolas Macris,et al.  And now to something completely different: Spatial coupling as a proof technique , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Saad,et al.  Typical performance of gallager-type error-correcting codes , 2000, Physical review letters.

[4]  S. Franz,et al.  Dynamic phase transition for decoding algorithms. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  F. Guerra,et al.  The High Temperature Region of the Viana–Bray Diluted Spin Glass Model , 2003, cond-mat/0302401.

[6]  Nicolas Macris,et al.  Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes , 2008, IEEE Transactions on Information Theory.

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

[8]  Rüdiger L. Urbanke,et al.  Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation , 2013, IEEE Trans. Inf. Theory.

[9]  A. Montanari The glassy phase of Gallager codes , 2001, cond-mat/0104079.

[10]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Andrea Montanari,et al.  The Generalized Area Theorem and Some of its Consequences , 2005, IEEE Transactions on Information Theory.

[12]  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.

[13]  Michele Leone,et al.  Replica Bounds for Optimization Problems and Diluted Spin Systems , 2002 .

[14]  Andrea Montanari,et al.  Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding , 2005, IEEE Transactions on Information Theory.

[15]  Nicolas Macris,et al.  How to prove the Maxwell conjecture via spatial coupling — A proof of concept , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[16]  Nicolas Macris,et al.  Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems , 2011, ArXiv.

[17]  David Gamarnik,et al.  Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , 2010, STOC '10.

[18]  Nicolas Macris,et al.  A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[19]  Nicolas Macris,et al.  Decay of Correlations for Sparse Graph Error Correcting Codes , 2011, SIAM J. Discret. Math..

[20]  Nicolas Macris,et al.  Bounds for Random Constraint Satisfaction Problems via Spatial Coupling , 2016, SODA.

[21]  Saad,et al.  Statistical physics of regular low-density parity-check error-correcting codes , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[23]  Nicolas Macris,et al.  New Bounds for Random Constraint Satisfaction Problems viaSpatial Coupling , 2014 .

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

[25]  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.

[26]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[27]  Nicolas Macris,et al.  Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels , 2013, IEEE Transactions on Information Theory.