Research on LDPC Parallel Hierarchical Decoding Algorithm with Low Complexity
In order to improve the decoding performance of quasi-cyclic low-density parity check(QC_LDPC),reduce the complexity of its decoding algorithm and accelerate the decoding convergence speed,a hierarchical decoding based on min-Sum decoding algorithm is proposed to support QC_LDPC fast decoding,which is obtained by cyclic shift of the basis check matrix,so the check matrix between each layer is independent of each other.Compared with the traditional BP algorithm,the proposed hierarchical algorithm has lower complexity and faster convergence.According to the standard of 5G NR,the algorithm is simulated in various scenarios.When the code length Kis 3960 and the code rate is 1/3,BPSK modulation and AWGN channel are used to simulate,and the results show that this algorithm can achieve a BER of 10-5 at the SNR of about 1.3 dB.This decoding method achieve a performance gain of 0.1 dB,a reduction in iteration times,and an improvement in decoding throughput.
万方数据
维普
