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 条
  • [31] On deriving good LDPC convolutional codes from QC LDPC block codes
    Pusane, Ali Emre
    Smarandache, Roxana
    Vontobel, Pascal O.
    Costello, Daniel J., Jr.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1221 - +
  • [32] Performance Analysis of LDPC Convolutional Codes
    Baloch, Zahoor Ahmed
    Hussain, Ayaz
    Hussain, Noor
    2013 INTERNATIONAL CONFERENCE ON ICT CONVERGENCE (ICTC 2013): FUTURE CREATIVE CONVERGENCE TECHNOLOGIES FOR NEW ICT ECOSYSTEMS, 2013, : 587 - 592
  • [33] Implementation aspects of LDPC convolutional codes
    Pusane, Ali Emre
    Feltstroem, Alberto Jimnez
    Sridharan, Arvind
    Lentmaier, Michael
    Zigangirov, Kamil Sh.
    Costello, Daniel J., Jr.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (07) : 1060 - 1069
  • [34] New Construction of LDPC Convolutional Codes
    Wu, Chi-Jen
    Chou, Yi-Chun
    Wang, Chung-Hsuan
    Chao, Chi-Chao
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1040 - +
  • [35] Stochastic Decoding for LDPC Convolutional Codes
    Lee, Xin-Ru
    Chen, Chih-Lung
    Chang, Hsie-Chia
    Lee, Chen-Yi
    2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012), 2012, : 2621 - 2624
  • [36] Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
    Mitchell, David G. M.
    Pusane, Ali E.
    Costello, Daniel J., Jr.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (01) : 254 - 281
  • [37] Free distance lower bounds for unequal error-protection convolutional codes
    Danon, T
    Bross, SI
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 261 - 261
  • [38] LDPC Convolutional Codes versus QC LDPC Block Codes in Communication Standard Scenarios
    Bocharova, Irina E.
    Kudryashov, Boris D.
    Johannesson, Rolf
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2774 - 2778
  • [39] Distance properties of irregular LDPC codes
    Lehmann, F
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 85 - 85
  • [40] On the minimum distance of generalized LDPC codes
    Otmani, Ayoub
    Tillich, Jean-Pierre
    Andriyanova, Iryna
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 751 - +
12345