A turbo-decoding message-passing algorithm for sparse parity-check matrix codes

被引:64
|
作者
Mansour, Mohammad M. [1 ]
机构
[1] Amer Univ Beirut, Dept Elect & Comp Engn, Beirut 11072020, Lebanon
关键词
iterative decoding; low-density parity-check (LDPC) codes; repeat-accumulate (RA) codes; Ramanujan graphs; turbo decoding algorithm; very large scale integration (VLSI) decoder architectures;
D O I
10.1109/TSP.2006.880240
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2) improvement in coding gain by an order of magnitude at high signal-to-noise ratio, (SNR), 3) reduced memory requirements, and 4) reduced decoder complexity. In addition, an efficient algorithm for message computation using simple "max" operations is also presented. Analysis using EXIT charts shows that the TDMP algorithm offers a better performance-complexity tradeoff when the number of decoding iterations is small, which is attractive for high-speed applications. A parallel version of the TDMP algorithm in conjunction with architecture-aware (AA) SPCM codes, which have embedded structure that enables efficient high-throughput decoder implementation, are presented. Design examples of AA-SPCM codes based on graphs with large girth demonstrate that AA-SPCM codes have very good error-correcting capability using the TDMP algorithm.
引用
收藏
页码:4376 / 4392
页数:17
相关论文
共 50 条
  • [1] Transformation of a parity-check matrix for a message-passing algorithm over the BEC
    Kobayashi, Naoto
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (05) : 1299 - 1306
  • [2] The capacity of low-density parity-check codes under message-passing decoding
    Richardson, TJ
    Urbanke, RL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 599 - 618
  • [3] Fast Column Message-Passing Decoding of Low-Density Parity-Check Codes
    Usman, Saleh
    Mansour, Mohammad M.
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2021, 68 (07) : 2389 - 2393
  • [4] On task mapping optimization for parallel decoding of low-density parity-check codes on message-passing architectures
    Al-Rawi, G
    Cioffi, J
    Horowitz, M
    [J]. PARALLEL COMPUTING, 2005, 31 (05) : 462 - 490
  • [5] The Improved Turbo-decoding Message-passing Algorithm and Corresponding Decoder for LDPC Based on LTE
    Lao, Lingling
    Li, Lixin
    Zhu, Meng
    Zhang, Huisheng
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, COMMUNICATIONS AND COMPUTING (ICSPCC), 2014, : 890 - 894
  • [6] Decoding turbo codes based on their parity-check matrices
    Jiang, Fan
    Psota, Eric
    Perez, Lance C.
    [J]. PROCEEDINGS OF THE THIRTY-NINTH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2007, : 221 - +
  • [7] Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes
    Lazaro, Francisco
    Amat, Alexandre Graell I.
    Liva, Gianluigi
    Matuz, Balazs
    [J]. 2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
  • [8] A Binary Message-Passing Decoding Algorithm for LDPC Codes
    Chen, Chao-Yu
    Huang, Qin
    Kang, Jingyu
    Zhang, Li
    Lin, Shu
    [J]. 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 424 - 430
  • [9] List Message Passing Decoding of Non-binary Low-Density Parity-Check Codes
    Ben Yacoub, Emna
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 84 - 89
  • [10] Sequential message-passing decoding of LDPC codes by partitioning check nodes
    Kim, Sunghwan
    Jang, Min-Ho
    No, Jong-Seon
    Hong, Song-Nam
    Shin, Dong-Joon
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (07) : 1025 - 1031