Relative-Residual-Based Dynamic Schedule for Decoding of LDPC Codes

doi:10.16182/j.issn1004731x.joss.21-0385

Abstract

Abstract:

In order to solve the problems of the oscillation phenomenon and greedy characteristics in the dynamic scheduling decoding algorithm for low-density parity-check (LDPC) codes, the relative-residual-based dynamic schedule (RRB-BP) algorithm is proposed based on variable-to-check residual belief propagation (VC-RBP) algorithm. The variable nodes are grouped, then the relative residual value of the message passed by the variable nodes to the check node is taken as a reference, and the node with the largest relative residual value is updated in priority to accelerate the decoding convergence speed. For variable nodes oscillating in the decoding process, the posterior LLR (log likelihood ratio) message values before and after updating are processed with weighted average to improve the reliability of oscillating nodes. In the process of algorithm iteration, the relative residual value of messages transmitted from variable node to check node is attenuated to alleviate the greedy characteristic of decoding algorithm. The simulation results show that compared with the VC-RBP algorithm, the decoding performance gain of the proposed algorithm is 0.3~0.4 dB when the bit error rate is 10^-5, and the convergence speed is faster.

Key words: LDPC(low-density parity-check) code, dynamic scheduling, oscillation phenomenon, greedy characteristics, relative-residual

CLC Number:

Fatang Chen, Hebin Li, Zhihao Zhang, Zhiqiang Mei. Relative-Residual-Based Dynamic Schedule for Decoding of LDPC Codes[J]. Journal of System Simulation, 2022, 34(09): 1968-1975.

Figures/Tables 9

Fig. 1

Fig. 2

Fig. 3

Fig. 4

Table 1

Fig. 5

Fig. 6

Table 2

Fig. 7

References 11

[1]	Medova L R, Rybin P S, Sidorenko I E. On the Performance Slope of Short LDPC Codes[C]// 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). Brno, Czech Republic: IEEE, 2020: 67-72.
[2]	Wu H, Wang H. A High Throughput Implementation of QC-LDPC Codes for 5G NR[J]. IEEE Access (S2169-3536), 2019, 7: 185373-185384.
[3]	Nguyen D T, Park Y. Performance Improvement of Optical Satellite Communications by Interleaved IEEE 802.11 LDPC[C]// 2018 Tenth International Conference on Ubiquitous and Future Networks (ICUFN). Prague, Czech Republic: IEEE, 2018: 575-579.
[4]	David J C. Near Shannon Limit Performance of Low Density Parity Check Codes[J]. Electronics Letters (S1350-911X), 1996, 32(18): 1645-1646.
[5]	Nimara S. Reliability Assessment of Flooded Min-Sum LDPC Decoders Based on Sub-Threshold Processing Units[C]// 2019 22nd Euromicro Conference on Digital System Design (DSD). Kallithea, Chalkidiki: IEEE, 2019: 620-623.
[6]	Vila Casado A I, Griot M, Wesel R D. Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes[C]// 2007 IEEE International Conference on Communications. Glasgow: IEEE, 2007: 932-937.
[7]	Kim J H, Nam M Y, Song H Y. Variable-to-Check Residual Belief Propagation for LDPC Codes[J].Electronics Letters (S1350-911X), 2009, 45(2): 117-118.
[8]	Sun R, Hou X, Sun J. Reliability-Based-Layered Belief Propagation for Iterative Decoding of LDPC Codes[C]//2018 IEEE International Symposium on Information Theory (ISIT). Vail, CO, USA: IEEE, 2018: 1156-1160.
[9]	Liu X, Zi L, Yang D. Improved Decoding Algorithms of LDPC Codes Based on Reliability Metrics of Variable Nodes[J]. IEEE Access (S2169-3536), 2019, 7: 35769-35778.
[10]	Gholami M, Nassaj A. LDPC Codes Based on Mobius Transformations[J]. IET Communications (S1751-8628), 2019, 13(11): 1615-1624.
[11]	Liu X, Yang G, Chen X. Variable-Node-Based Belief-Propagation Decoding with Message Pre-Processing for NAND Flash Memory[J]. IEEE Access (S2169-3536), 2019, 7: 58638-58653.

参数	取值
码长/bit	1 056
码率	0.5
最大迭代次数	50
调节因子α	0.9

算法	C2V更新	V2C更新	残差计算	实值比较
Flooding	E	E	0	0
VC-RBP	E		0	M(E-1)
RBL-BP	E		0	N
RM-RBP		E
RRB-BP		E	0	N(N-1)