DocumentCode :
3510915
Title :
Near concavity of the growth rate for coupled LDPC chains
Author :
Hamed Hassani, S. ; Macris, Nicolas ; Mori, Ryuhei
Author_Institution :
Ecole Polytecnique Fédérale de Lausanne, School of Computer & Communication Sciences, LTHC-Station 14, CH-1015, Switzerland
fYear :
2011
fDate :
July 31 2011-Aug. 5 2011
Firstpage :
356
Lastpage :
360
Abstract :
Convolutional Low-Density-Parity-Check (LDPC) ensembles have excellent performance. Their iterative threshold increases with their average degree, or with the size of the coupling window in randomized constructions. In the latter case, as the window size grows, the Belief Propagation (BP) threshold attains the maximum-a-posteriori (MAP) threshold of the underlying ensemble. In this contribution we show that a similar phenomenon happens for the growth rate of coupled ensembles. Loosely speaking, we observe that as the coupling strength grows, the growth rate of the coupled ensemble comes close to the concave hull of the underlying ensemble´s growth rate. For ensembles randomly coupled across a window the growth rate actually tends to the concave hull of the underlying one as the window size increases. Our observations are supported by the calculations of the combinatorial growth rate, and that of the growth rate derived from the replica method. The observed concavity is a general feature of coupled mean field graphical models and is already present at the level of coupled Curie-Weiss models. There, the canonical free energy of the coupled system tends to the concave hull of the underlying one. As we explain, the behavior of the growth rate of coupled ensembles is exactly analogous.
Keywords :
IEEE Xplore; Portable document format;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
ISSN :
2157-8095
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2011.6034145
Filename :
6034145
Link To Document :
بازگشت