Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

被引：1
|
作者：
Rybin, P. S. [1 ]
Zyablov, V. V. [1 ]
机构：
[1] Russian Acad Sci, Kharkevich Inst Informat Transmiss Problems, Moscow, Russia
来源：
PROBLEMS OF INFORMATION TRANSMISSION | 2015年 / 51卷 / 03期
基金：
俄罗斯科学基金会;
关键词：
EXPANDER CODES; EXPONENTS;
D O I：
10.1134/S0032946015030011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of a generalized LDPC code with a special construction is proposed. The error exponent lower bound for the modified decoding algorithm is obtained. Finally, numerical results for the considered error exponent lower bounds are presented and analyzed.
引用
收藏
页码：205 / 216
页数：12
相关论文
共 50 条
  • [21] Tightened upper bounds on the ML decoding error probability of binary linear block codes
    Twitto, Moshe
    Sason, Igal
    Shamai, Shlomo
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 714 - +
  • [22] Bounds on the maximum likelihood decoding error probability of low density parity check codes
    Miller, G
    Burshtein, D
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 290 - 290
  • [23] Block error iterative decoding capacity for LDPC codes
    Jin, H
    Richardson, T
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 52 - 56
  • [24] Lower bounds on the spectrum and error rate of LDPC code ensembles
    Barak, O
    Burshtein, D
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 42 - 46
  • [25] Tight bounds for LDPC and LDGM codes under MAP decoding
    Montanari, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) : 3221 - 3246
  • [26] Sharp bounds for MAP decoding of general irregular LDPC codes
    Kudekar, Shrinivas
    Macris, Nicolas
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2259 - +
  • [27] Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Number of Iterations
    Mori, Ryuhei
    Kasai, Kenta
    Shibuya, Tomoharu
    Sakaniwa, Kohichi
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 449 - +
  • [28] A Two-Stage Decoding Algorithm to Lower the Error-Floors for LDPC Codes
    Zhang, Xueting
    Chen, Shaoping
    IEEE COMMUNICATIONS LETTERS, 2015, 19 (04) : 517 - 520
  • [29] Lowering the error floor of LDPC codes by a two-stage hybrid decoding algorithm
    Bian, Yueguang
    Wang, Youzheng
    Wang, Jing
    2007 SECOND INTERNATIONAL CONFERENCE IN COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1 AND 2, 2007, : 249 - 253
  • [30] PROBABILITY BOUNDS AND ASYMPTOTIC PROPERTIES OF ERROR PROPAGATION
    ARATO, M
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1983, 9 (02) : 307 - 310
12345