Node-Wise Scheduling Algorithm of ADMM Decoding Based on Line Segment Projection

被引:3
作者
Xia, Qiaoqiao [1 ]
He, Pinquan [1 ]
Wang, Xin [1 ]
Liu, Huiyang [1 ]
Zhang, Qinglin [1 ]
机构
[1] Cent China Normal Univ, Coll Phys Sci & Technol, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Decoding; Convergence; Scheduling algorithms; Projection algorithms; Approximation algorithms; Schedules; Dynamic scheduling; Alternating direction method of multipliers (ADMM); low-density parity-check (LDPC) codes; check polytope projection; message scheduling;
D O I
10.1109/LCOMM.2022.3143235
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In order to simplify the node-wise scheduling algorithm of the alternating direction method of multipliers (NS-ADMM) decoding, approximate line segment projection algorithm (LSA) is adopted to perform the projection in the node-wise scheduling algorithm. Experimental results show that using approximate line segment projection instead of precise projection in node-wise scheduling algorithm will yield a poor frame error rate (FER) performance. To solve this problem, dynamic scheduling strategy that selects the message-passing schedule according to the convergence status of the check node is proposed. Simulation results demonstrate that the modified node-wise scheduling algorithm based on line segment projection outperforms existing decoding algorithms in terms of FER performance and convergence speed, while it has good error correction performance with a lower computational complexity.
引用
收藏
页码:738 / 742
页数:5
相关论文
共 13 条
  • [1] Decomposition Methods for Large Scale LP Decoding
    Barman, Siddharth
    Liu, Xishuo
    Draper, Stark C.
    Recht, Benjamin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 7870 - 7886
  • [2] Debbabi I, 2016, INT SYM TURBO CODES, P51, DOI 10.1109/ISTC.2016.7593075
  • [3] Fast Converging ADMM-Penalized Algorithm for LDPC Decoding
    Debbabi, Imen
    Le Gal, Bertrand
    Khouja, Nadia
    Tlili, Fethi
    Jego, Christophe
    [J]. IEEE COMMUNICATIONS LETTERS, 2016, 20 (04) : 648 - 651
  • [4] Using linear programming to decode binary linear codes
    Feldman, J
    Wainwright, MJ
    Karger, DR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 954 - 972
  • [5] Efficient ADMM Decoding of LDPC Codes Using Lookup Tables
    Jiao, Xiaopeng
    Mu, Jianjun
    He, Yu-Cheng
    Chen, Chao
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (04) : 1425 - 1437
  • [6] Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes
    Jiao, Xiaopeng
    Mu, Jianjun
    Wei, Haoyuan
    [J]. IEEE COMMUNICATIONS LETTERS, 2017, 21 (03) : 472 - 475
  • [7] LDPC Coding for OFDMA PHY, 2005, C80216E050066R32005
  • [8] The ADMM Penalized Decoder for LDPC Codes
    Liu, Xishuo
    Draper, Stark C.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (06) : 2966 - 2984
  • [9] Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes
    Wei, Haoyuan
    Jiao, Xiaopeng
    Mu, Jianjun
    [J]. IEEE COMMUNICATIONS LETTERS, 2015, 19 (06) : 909 - 912
  • [10] A Hybrid Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes
    Xia, Qiaoqiao
    Wang, Xin
    Liu, Huajun
    Zhang, Qing Lin
    [J]. IEEE COMMUNICATIONS LETTERS, 2021, 25 (01) : 108 - 112