Analysis and Design of Binary Message Passing Decoders

被引:25
|
作者
Lechner, Gottfried [1 ]
Pedersen, Troels [2 ]
Kramer, Gerhard [3 ,4 ]
机构
[1] Univ S Australia, Inst Telecommun Res, Adelaide, SA 5001, Australia
[2] Aalborg Univ, Dept Elect Syst, Sect Nav & Commun NavCom, Aalborg, Denmark
[3] Univ So Calif, Los Angeles, CA USA
[4] Alcatel Lucent, Bell Labs, Murray Hill, NJ USA
基金
澳大利亚研究理事会;
关键词
Extrinsic information transfer charts; Gallager B algorithm; low-density parity-check codes; message passing decoding; PARITY-CHECK CODES;
D O I
10.1109/TCOMM.2011.122111.100212
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Binary message passing decoders for low-density parity-check codes are studied by using extrinsic information transfer charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the log-likelihood ratio ( L-value) domain. A hard decision results in the Gallager B algorithm and examples show that increasing the channel output alphabet to two bits gains more than 1.0 dB in signal to noise ratio when using optimized codes. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.
引用
收藏
页码:601 / 607
页数:7
相关论文
共 50 条
  • [1] EXIT chart analysis of binary message-passing decoders
    Lechner, Gottfried
    Pedersen, Troels
    Kramer, Gerhard
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 871 - +
  • [2] Properties of optimum binary message-passing decoders
    Ardakani, M
    Kschischang, FR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3658 - 3665
  • [3] COMPENSATION METHODS FOR CYCLES IN MESSAGE PASSING DECODERS
    Moon, Todd K.
    Gunther, Jacob H.
    [J]. 2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 1029 - 1033
  • [4] Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel
    Sassatelli, Lucile
    Chilappagari, Shashi Kiran
    Vasic, Bane
    Declercq, David
    [J]. 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2156 - +
  • [5] Bounds on the Convergence Speed of Iterative Message-Passing Decoders over the Binary Erasure Channel
    Sason, Igal
    Wiechman, Gil
    [J]. 2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008, : 157 - 161
  • [6] Message-passing decoders and their application to storage systems
    Kurkoski, BM
    Siegel, PH
    Wolf, JK
    [J]. 2001 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2001, : 12 - 13
  • [7] Design of Binary LDPC Codes With Parallel Vector Message Passing
    Liu, Xingcheng
    Xiong, Feng
    Wang, Zhongfeng
    Liang, Shuo
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (04) : 1363 - 1375
  • [8] High-Throughput Energy-Efficient LDPC Decoders Using Differential Binary Message Passing
    Cushon, Kevin
    Hemati, Saied
    Leroux, Camille
    Mannor, Shie
    Gross, Warren J.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (03) : 619 - 631
  • [9] Quantization. Absorbing Regions and Practical Message Passing Decoders
    Amiri, Behzad
    Srinivasa, Shayan Garani
    Dolecek, Lara
    [J]. 2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1255 - 1259
  • [10] Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes
    Ben Yacoub, Emna
    Liva, Gianluigi
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (09) : 5078 - 5092