Systems Engineering and Electronics ›› 2022, Vol. 44 ›› Issue (7): 2350-2356.doi: 10.12305/j.issn.1001-506X.2022.07.32

• Communications and Networks • Previous Articles     Next Articles

Improved algorithm based on offset min-sum decoding for LDPC codes

Fatang CHEN, Hebin LI*, Ping'an LI   

  1. School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2021-04-15 Online:2022-06-22 Published:2022-06-28
  • Contact: Hebin LI

Abstract:

To solve the problem that in the low-density parity-check (LDPC) code offset min-sum (OMS) algorithm, the selection of the offset factor is not accurate, this article proposes an OMS algorithm based on order statistics (OR-OMS). The algorithm uses two different offset factors to modify the check node update results. One offset factor is used to modify the first minimum value result, and the other offset factor is used to modify the second minimum value result. Use order statistics to perform theoretical analysis, and obtain the two optimal offset factor values. The proposed algorithm uses a hierarchical scheduling message delivery method to speed up the convergence speed of the algorithm. The simulation results show that compared with the traditional OMS algorithm, the decoding performance of the proposed algorithm can obtain a gain of about 0.35 dB, when the bit error rate (BER) is 10-5, and the average iteration times can be reduced by up to 34.28%. Meanwhile, the proposed algorithm has better convergence performance.

Key words: low-density parity-check (LDPC) code, offset min-sum (OMS), order statistics, hierarchical scheduling

CLC Number: 

[an error occurred while processing this directive]