Mathematical analysis of iterative decoding of LDPC convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 191-

  Truhachev, D ^a   Lentmaier, M ^a   Zigangirov, K S ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE DECODING; LOW DENSITY PARITY CHECK; TANNER GRAPH;

ALGORITHMS; COMPUTER SIMULATION; DECODING; GRAPHIC METHODS; ITERATIVE METHODS; THEOREM PROVING;

CONVOLUTIONAL CODES;

EID: 0034865313     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. On the theory of low-density convolutional codes I
2. Periodic time-varying convolutional codes with low-density parity-check matrices
3. On the theory of low-density convolutional codes
4. Mathematical analysis of an iterative algorithm for low-density code decoding
5. Analysis of the asymptotic iterative decoding performance of turbo codes
6. On the theory of low-density convolutional codes II