Systems Engineering and Electronics ›› 2025, Vol. 47 ›› Issue (5): 1698-1705.doi: 10.12305/j.issn.1001-506X.2025.05.32

• Communications and Networks • Previous Articles    

Segmented multi-factor minimum sum decoding algorithm for LDPC

Zhiguo SUN, Yike WANG, Xiaoyan NING   

  1. School of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
  • Received:2024-04-17 Online:2025-06-11 Published:2025-06-18
  • Contact: Xiaoyan NING

Abstract:

In order to solve the issue of inaccurate check node updates and the resulting decoding performance limitations in the minimum sum (MS) decoding algorithm for low-density parity-check (LDPC) codes, a method is proposed to compensate for the verification node updates. This method incorporates segmented correction and linear minimum mean square error estimation parameters. The resulting algorithm is referred to as the linear minimum mean square error segmented multi-factor MS (LMMSE-SMFMS) decoding algorithm. Firstly, a comparative analysis is conducted to assess the performance of the MS decoding algorithm and the belief propagation (BP) decoding algorithm. Subsequently, a compensation method for check node updates is employed using three sets of correction factors based on linear minimum mean square error estimation. Finally, a layered scheduling approach is implemented to expedite the convergence speed during the information propagation process. Theoretical analysis and simulation results demonstrate that for quasi-cyclic-LDPC (QC-LDPC), under the conditions of utilizing linear minimum mean square error estimation and segmented correction factors, the proposed algorithm demonstrates technical gains compared to the MS algorithm in terms of bit error rate, information convergence speed, and other performance aspects.

Key words: low-density parity-check (LDPC), minimum sum (MS) decoding algorithm, segmented multi-factor (SMF), hierarchical scheduling

CLC Number: 

[an error occurred while processing this directive]