Distance bounds for an ensemble of LDPC convolutional codes

被引：37
|
作者：
Sridharan, Arvind [1 ,2 ]
Truhachev, Dmitri [3 ]
Lentmaier, Michael [1 ]
Costello, Daniel J., Jr. [1 ]
Zigangirov, Kamil Sh. [1 ,4 ]
机构：
[1] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
[2] Seagate Technol, Longmont, CO 80503 USA
[3] Univ Alberta, Res Fac, Dept Elect & Comp Engn, ECERF, Edmonton, AB T6G 2M7, Canada
[4] Inst Problems Informat Transmiss, Moscow, Russia
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 12期
基金：
美国国家科学基金会; 美国国家航空航天局;
关键词：
free distance lower bounds; low-density paritycheck (LDPC) codes; LDPC convolutional codes; minimum-distance lower bounds;
D O I：
10.1109/TIT.2007.909113
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance d(L) of code segments of finite length L and on the free distance d(free) are derived. For sufficiently large constraint lengths nu, the distances are shown to grow linearly with v and the ratio d(L)/nu approaches the ratio d(free)/nu for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.
引用
收藏
页码：4537 / 4555
页数：19
相关论文
共 50 条
  • [1] A Construction of LDPC Convolutional Codes with Close Distance Bounds
    Chen, Tien-Hui
    Chen, Kuan-Chen
    Lin, Mao-Chao
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 90 - 94
  • [2] Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
    Mitchell, David G. M.
    Pusane, Ali E.
    Goertz, Norbert
    Costello, Daniel J., Jr.
    2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008, : 408 - +
  • [3] On the free distance of LDPC convolutional codes
    Sridharan, A
    Truhachev, D
    Lentmaier, M
    Costello, DJ
    Zigangirov, KS
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 311 - 311
  • [4] FREE DISTANCE BOUNDS FOR CONVOLUTIONAL CODES
    COSTELLO, DJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) : 356 - 365
  • [5] Distance Spectrum Estimation of LDPC Convolutional Codes
    Zhou, Hua
    Mitchell, David G. M.
    Goertz, Norbert
    Costello, Daniel J., Jr.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 473 - 477
  • [6] Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
    Truhachev, Dmitri
    Zigangirov, Kamil Sh.
    Costello, Daniel J., Jr.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4301 - 4308
  • [7] Generalization of Tanner's minimum distance bounds for LDPC codes
    Shin, Min-Ho
    Kim, Joon-Sung
    Song, Hong-Yeop
    IEEE Commun Lett, 3 (240-242):
  • [8] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 47 - 51
  • [9] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2092 - 2100
  • [10] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
    Hashemi, Yoones
    Banihashemi, Amir H.
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
12345