Coupled graphical models and their thresholds

Abstract

The excellent performance of convolutional low-density parity-check codes is the result of the spatial coupling of individual underlying codes across a window of growing size, but much smaller than the length of the individual codes. Remarkably, the belief-propagation threshold of the coupled ensemble is boosted to the maximum-a-posteriori one of the individual system. We investigate the generality of this phenomenon beyond coding theory: we couple general graphical models into a one-dimensional chain of large individual systems. For the later we take the Curie-Weiss, random field Curie-Weiss, If-satisfiability, and Q-coloring models. We always find, based on analytical as well as numerical calculations, that the message passing thresholds of the coupled systems come very close to the static ones of the individual models. The remarkable properties of convolutional low-density parity-check codes are a manifestation of this very general phenomenon.

Extracted Key Phrases

5 Figures and Tables

0102020102011201220132014201520162017
Citations per Year

69 Citations

Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Hassani2010CoupledGM, title={Coupled graphical models and their thresholds}, author={Seyed Hamed Hassani and Nicolas Macris and R{\"{u}diger L. Urbanke}, journal={2010 IEEE Information Theory Workshop}, year={2010}, pages={1-5} }