Displacement Convexity in Spatially Coupled Scalar Recursions

We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential function. We show, under mild conditions, that the potential function is displacement convex and that the minimizers are given by the fixed points (FPs) of the recursions. Furthermore, we give the conditions on the system such that the minimizing FP is unique up to translation along the spatial direction. The condition matches with that of Kudekar et al. [20] for the existence of spatial FPs. Displacement convexity applies to a wide range of spatially coupled recursions appearing in coding theory, compressive sensing, random constraint satisfaction problems, as well as statistical-mechanics models. We illustrate it with applications to low-density parity-check (LDPC) and generalized LDPC codes used for the transmission on the binary erasure channel or general binary memoryless symmetric channels within the Gaussian reciprocal channel approximation as well as compressive sensing.

[1]  R. Jackson.  Inequalities , 2007, Algebra for Parents.

[2]  Henry D. Pfister,et al.  Approaching capacity at high rates with iterative hard-decision decoding , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[4]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[5]  Antje Baer,et al.  Direct Methods In The Calculus Of Variations , 2016 .

[6]  Michael Lentmaier,et al.  Terminated LDPC convolutional codes with thresholds close to capacity , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[7]  Nicolas Macris,et al.  Analysis of coupled scalar systems by displacement convexity , 2014, 2014 IEEE International Symposium on Information Theory.

[8]  Florent Krzakala,et al.  Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices , 2012, ArXiv.

[9]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[10]  Rüdiger L. Urbanke,et al.  Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems , 2012, ArXiv.

[11]  Henry D. Pfister,et al.  A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions , 2013, IEEE Transactions on Information Theory.

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

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

[14]  Adel Javanmard,et al.  Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing , 2011, IEEE Transactions on Information Theory.

[15]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[16]  Giovanni Alberti,et al.  A nonlocal anisotropic model for phase transitions Part I: the optimal profile problem , 2007 .

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

[18]  Nicolas Macris,et al.  Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula , 2016, NIPS.

[19]  Nicolas Macris,et al.  Coupled graphical models and their thresholds , 2010, 2010 IEEE Information Theory Workshop.

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

[21]  Nicolas Macris,et al.  Chains of mean-field models , 2011, ArXiv.

[22]  C. Villani.  Topics in Optimal Transportation , 2003 .

[23]  Giovanni Alberti,et al.  A nonlocal anisotropic model for phase transitions , 1998 .

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

[25]  K. A. Connors.  The Free Energy , 2003 .

[26]  Nicolas Macris,et al.  Displacement convexity — A useful framework for the study of spatially coupled codes , 2013, 2013 IEEE Information Theory Workshop (ITW).

[27]  W. Freeman,et al.  Bethe free energy, Kikuchi approximations, and belief propagation algorithms , 2001 .

[28]  Nicolas Macris,et al.  Spatial Coupling as a Proof Technique and Three Applications , 2013, IEEE Transactions on Information Theory.

[29]  Sae-Young Chung,et al.  On the capacity of low-density parity-check codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).