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 条
  • [21] Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
    Burshtein, David
    Goldenberg, Idan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7386 - 7402
  • [22] Deriving Good LDPC Convolutional Codes from LDPC Block Codes
    Pusane, Ali E.
    Smarandache, Roxana
    Vontobel, Pascal O.
    Costello, Daniel J., Jr.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 835 - 857
  • [23] Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes
    Mitchell, David G. M.
    Pusane, Ali E.
    Lentmaier, Michael
    Costello, Daniel J., Jr.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1096 - 1100
  • [24] Distance verification for LDPC codes
    Dumer, Ilya
    Kovalev, Alexey A.
    Pryadko, Leonid P.
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2529 - 2533
  • [25] Recursive Convolutional Codes for Time-Invariant LDPC Convolutional Codes
    Roy, Eric
    Cardinal, Christian
    Haccoun, David
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 834 - 838
  • [26] On the minimum distance of array codes as LDPC codes
    Yang, KC
    Helleseth, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3268 - 3271
  • [27] Upper bounds on the rate of LDPC codes
    Burshtein, D
    Krivelevich, M
    Litsyn, S
    Miller, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (09) : 2437 - 2449
  • [28] Upper bounds on the rate of LDPC codes
    Burshtein, D
    Krivelevich, M
    Litsyn, S
    Miller, G
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 28 - 28
  • [29] Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes
    Battaglioni, Massimo
    Baldi, Marco
    Chiaraluce, Franco
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (04) : 2419 - 2429
  • [30] Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs
    Zhao, Yue
    Lau, Francis C. M.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (03) : 663 - 672
12345