Iterative Decoding Threshold Analysis for LDPC Convolutional Codes

被引:266
作者
Lentmaier, Michael [1 ]
Sridharan, Arvind [1 ]
Costello, Daniel J., Jr. [1 ]
Zigangirov, Kamil Sh. [2 ,3 ]
机构
[1] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
[2] Russian Acad Sci, Inst Problems Informat Transmiss, Moscow, Russia
[3] Lund Univ, Lund, Sweden
基金
美国国家科学基金会;
关键词
Belief propagation; density evolution; iterative decoding; low-density parity-check (LDPC) codes; LDPC convolutional codes; message passing; threshold analysis; PARITY-CHECK CODES; CAPACITY; DENSITY; BLOCK; PERFORMANCE; DESIGN; BOUNDS;
D O I
10.1109/TIT.2010.2059490
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.
引用
收藏
页码:5274 / 5289
页数:16
相关论文
共 30 条
[1]  
[Anonymous], 1963, Low-Density Parity-Check Codes
[2]  
[Anonymous], 2005, THESIS U NOTRE DAME
[3]   On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit [J].
Chung, SY ;
Forney, GD ;
Richardson, TJ ;
Urbanke, R .
IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) :58-60
[4]  
ECKFORD AW, 2004, THESIS U TORONTO TOR
[5]  
Engdahl K., 1999, Problems of Information Transmission, V35, P295
[6]   Time-varying periodic convolutional codes with low-density parity-check matrix [J].
Felstrom, AJ ;
Zigangirov, KS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2181-2191
[7]  
Johannesson R., 1999, FUNDAMENTALS CONVOLU
[8]  
KHANDEKAR A, 2002, P CISS 2002
[9]  
KHANDEKAR A, 2002, THESIS CALIF I TECHN
[10]  
Lentmaier M, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P1372