LDPC的分段多因子最小和譯碼算法

打開(kāi)文本圖片集

（，黑龍江150001）

Segmented multi-factor minimum sum decoding algorithm for LDPC

SUN Zhiguo，WANG Yike，NING Xiaoyan* (Schoolof InformationandCommunication Engineering，HarbinEnginering University，Harbin150ool,China)

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 eror 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 MSdecoding algorithm and the belief propagation（BP）decoding algorithm.Subsequently，acompensation method for check node updates is employed using three sets of correction factors based on linear minimum mean square error estimation.Finally，a layered schedulingapproach is implemented to expedite the convergence speed during the information propagation process.Theoretical analysis and simulation results demonstrate that for quasi-cyclicLDPC（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.

Keywords:low-density parity-check (LDPC)；minimum sum（MS） decoding algorithm；segmented multifactor（SMF)；hierarchical scheduling

0 引言

究并證明LDPC具有接近香農(nóng)限的譯碼性能[2。（剩余23152字）