•  
  •  
 

Journal of System Simulation

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.

First Page

1968

Revised Date

2021-08-16

Last Page

1975

CLC

TP911.22;TP391

Recommended Citation

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.

Corresponding Author

Hebin Li,1511090958@qq.com

DOI

10.16182/j.issn1004731x.joss.21-0385

Share

COinS