Systems Engineering and Electronics ›› 2024, Vol. 46 ›› Issue (12): 4231-4237.doi: 10.12305/j.issn.1001-506X.2024.12.32

• Communications and Networks • Previous Articles    

Hierarchical adaptive minimum sum decoding algorithm for LDPC code

Renle ZHENG1,2, Dongyang LI1,2, Wenxue LIU1,2, Jintao WAN1,2, Xueyong LIU1,2, Jinha LI1,2,*   

  1. 1. Communication and Information Engineering Research and Development Center, Institute of Microelectronics of the Chinese Academy of Sciences, Beijing 100029, China
    2. School of Integrated Circuits, University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2023-11-15 Online:2024-11-25 Published:2024-12-30
  • Contact: Jinha LI

Abstract:

To address the issue of larger errors in the normalized minimum sum decoding algorithm compared to the belief propagation decoding algorithm, an adaptive minimum sum decoding algorithm is proposed. By calculating the hard decision values of the current iteration posterior probability and the previous iteration posterior probability, the normalization factor and offset factor are dynamically adjusted to make the improved algorithm closer to the belief propagation decoding algorithm. Based on this, a hierarchical scheduling strategy is applied to propose a hierarchical adaptive minimum sum decoding algorithm, which improves the convergence speed of the decoding algorithm. Simulation results show that when the bit error rate is 10-6, the proposed decoding algorithm has a gain of 0.25 dB of bit error performance compared to the hierarchical normalized minimum sum decoding algorithm. Compared with the hierarchical belief propagation decoding algorithm, the proposed decoding performance has a similar performance, with only one increase in iteration times sum better convergence performance.

Key words: low-density parity check (LDPC) code, hierarchical adaptive minimum sum decoding algorithm, normalization factor, offset factor

CLC Number: 

[an error occurred while processing this directive]