Lowering the Error Floors of Low-Density Parity-Check Codes with Additional Check Nodes

被引：0
|
作者：
Yuan, Dongming [1 ]
Li, Lu [1 ]
Liu, Yuanan [1 ]
机构：
[1] Beijing Univ Posts & Telecommun, Sch Elect Engn, Beijing, Peoples R China
来源：
2017 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2017年
基金：
中国国家自然科学基金;
关键词：
Low-density parity-check codes; bit recovery; trapping sets; error floor; additional check nodes;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper proposes a novel scheme for bit recovery of Low-Density Parity-Check (LDPC) Codes. Firstly, the most erroneous and the most reliable bits are located by searching the codeword bits. Subsequently, new check nodes are added to connect them, thus the negative effects of the most erroneous bits along with the corresponding trapping sets are avoided. Eventually, the BER performance is dramatically improved in the error-floor region according to the simulated results. This idea could be a more concise and simple alternative to weaken the effects of trapping sets in LDPC applications.
引用
收藏
页码：146 / 150
页数：5
相关论文
共 50 条
  • [41] Bootstrap decoding of low-density parity-check codes
    Nouh, A
    Banihashemi, AH
    IEEE COMMUNICATIONS LETTERS, 2002, 6 (09) : 391 - 393
  • [42] Polarized Low-Density Parity-Check Codes on the BSC
    Gao, Binbin
    Yin, Huarui
    Wang, Zhengdao
    2019 11TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2019,
  • [43] On Gallager's low-density parity-check codes
    Battail, G
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 202 - 202
  • [44] Error exponents of low-density parity-check codes on the binary erasure channel
    Mora, Thierry
    Rivoire, Olivier
    PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 81 - +
  • [45] Blind recognition of sparse parity-check matrices of low-density parity-check codes in the presence of noise
    Ding, Yong
    Huang, Zhiping
    Zhou, Jing
    IET COMMUNICATIONS, 2023, 17 (04) : 418 - 427
  • [46] Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
    Kim, Kyung-Joong
    Chung, Jin-Ho
    Yang, Kyeongcheol
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) : 7288 - 7298
  • [47] Optimal puncturing of irregular low-density parity-check codes
    Ha, J
    McLaughlin, SW
    2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 3110 - 3114
  • [48] A improved decoding algorithm for low-density parity-check codes
    Zhou, Wei
    Men, Ai-dong
    Zhao, Li-Ye
    Quan, Zi-yi
    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1453 - +
  • [49] A new schedule for decoding low-density parity-check codes
    Mao, YY
    Banihashemi, AH
    GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 1007 - 1010
  • [50] Two decoding algorithms for low-density parity-check codes
    Ngatched, TMN
    Bossert, M
    Fahrner, A
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 673 - 677
12345