CiteSeerX — The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding

The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding (1999) [7 citations — 2 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@TECHREPORT{Ge99thedistribution,
    author = {Xian-ping Ge and David Eppstein and and Padhraic Smyth and Padhraic Smyth},
    title = {The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding},
    institution = {Info. and Comp. Sc., Univ. of CA},
    year = {1999}
}

Bookmarks

OpenURL

Abstract:

This paper analyzes the distribution of cycle lengths in turbo decoding and low-density parity check (LDPC) graphs. The properties of such cycles are of significant interest in the context of iterative decoding algorithms which are based on belief propagation or message passing. We estimate the probability that there exist no simple cycles of length less than or equal to k at a randomly chosen node in a turbo decoding graph using a combination of counting arguments and independence assumptions. For large block lengths n, this probability is approximately e \Gamma 2 k\Gamma1 \Gamma4 n ; k 4. Simulation results validate the accuracy of the various approximations. For example, for turbo codes with a block length of 64000, a randomly chosen node has a less than 1% chance of being on a cycle of length less than or equal to 10, but has a greater than 99.9% chance of being on a cycle of length less than or equal to 20. The effect of the "S-random" permutation is also analyzed and it is s...

Citations

4701	Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference – Pearl - 1988
838	Near Shannon limit error-correcting coding and decoding – Berrou, Glavieux, et al. - 1993
741	Optimal decoding of linear codes for minimizing symbol error rate – Bahl, Cocke, et al. - 1974
410	Low-Density Parity-Check Codes – Gallager - 1963
203	Turbo decoding as an instance of Pearl’s ‘belief propagation’ algorithm – McEliece, MacKay, et al. - 1998
175	Graphical Models for Machine Learning and Digital Communication – Frey - 1998
170	Near Shannon limit performance of low density parity check codes – Mackay, Neal - 1997
107	The capacity of low-density parity check codes under message-passing decoding – Richardson, Urbanke
81	Iterative decoding of compound codes by probability propagation in graphical models – Kschischang, Frey - 1998
74	Weight distributions for turbo codes using random and nonrandom permutations – Dolinar, Divsalar - 1995
64	Analysis of low density codes and improved designs using irregular graphs. STOC – Luby, Mitzenmacher, et al. - 1998
33	The Turbo decision algorithm – McEliece, Rodemich, et al. - 1995
1	Distance eects in message propagation – Ge, Smyth