The distribution of loop lengths in graphical models for turbo decoding

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2549-2553

  Ge, Xianping ^b   Eppstein, David ^b   Smyth, Padhraic ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Belief propagation; Graphical models; Iterative decoding; Turbo code

Indexed keywords

ACYCLIC DIRECTED GRAPHICAL MODEL; BELIEF PROPAGATION; ITERATIVE DECODING ALGORITHMS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DECODING; GRAPH THEORY; PROBABILITY;

TURBO CODES;

EID: 0035441847     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945266     Document Type: Letter

References (10)

1. Near Shannon limit error-correcting coding and decoding: Turbo codes
2. Turbo decoding as an instance of Pearl's 'belief propagation' algorithm
3. Iterative decoding of compound codes by probability propagation in graphical models
4. The turbo-decision algorithm
5. Weight distributions for turbo codes using random and nonrandom permutations
6. The distribution of cycle lengths in graphical models for iterative decoding
7. Near Shannon limit performance of low density parity check codes