Decoding Algorithm Based on Dynamic Threshold Truncation Strategy for Nonbinary LDPC Codes

被引:0
|
作者
Sun Y. [1 ,2 ]
Huang Y. [1 ]
Li S. [1 ]
Chen H. [1 ,2 ]
Li X. [1 ,2 ]
机构
[1] School of Computer, Electronics and Information, Guangxi University, Nanning
[2] Guangxi Key Laboratory of Multimedia Communication and Network Technology, Guangxi University, Nanning
关键词
dynamic threshold; extended min-sum algorithm; non-binary low-density parity-check codes; truncation strategy;
D O I
10.13190/j.jbupt.2022-209
中图分类号
TN911 [通信理论];
学科分类号
081002 ;
摘要
A new dynamic threshold truncation strategy based on the distributions of the message-vector reliability is designed for solving the high complexity problem of non-binary low-density parity-check codes (LDPC) decoding algorithms. The proposed strategy dynamically selects the truncation threshold based on the difference between the maximum and the sub-maximum reliability values, which can reduce the finite filed elements involved in message computing. In the iterative process, the decoding messages are determined by the truncation threshold, which can effectively reduce the number of the states and branches in the trellis, resulting in lower decoding complexity in average. A dynamic threshold extended min-sum (DT-EMS) algorithm is further presented based on the new truncation strategy. Simulation results show that the proposed DT-EMS algorithm performs almost as well as the well-known q-ary sum-product algorithm (QSPA) and the threshold based-EMS algorithm. Moreover, the proposed algorithm achieves lower decoding complexity than the threshold based-EMS algorithm and has much lower complexity than the QSPA. © 2023 Beijing University of Posts and Telecommunications. All rights reserved.
引用
下载
收藏
页码:99 / 105
页数:6
相关论文
共 14 条
  • [11] CHU W X, HU T A, LEE H C, Et al., An efficient short high-order nonbinary LDPC decoder architecture using a message-adaptation EMS algorithm, IEEE Access, 9, pp. 161520-161532, (2021)
  • [12] SONG S W, TIAN J, LIN J, Et al., An improved reliability-based decoding algorithm for NB-LDPC codes, IEEE Communications Letters, 25, 4, pp. 1153-1157, (2021)
  • [13] ZENG L, LAN L, TAI Y, Et al., Constructions of nonbinary quasi-cyclic LDPC codes: a finite field approach, IEEE Transactions on Communications, 56, 4, pp. 545-554, (2008)
  • [14] HU X, ELEFTHERIOU E, ARNOLD D., Regular and irregular progressive edge-growth tanner graphs, IEEE Transactions on Information Theory, 51, 1, pp. 386-398, (2005)