The Channel Serial-Dynamic Mixed Scheduling Decoding Strategy Based On 5G LDPC Codes

In the new era of massiveness,diversification,and diversification of information,the communication system has been unprecedentedly improved,perfected,and developed.It shows irreplaceable promotion effects on all levels of politics,economy,society,and culture.As a technology to ensure the reliability of information transmission,channel coding has become a hot spot for domestic and foreign communication scholars in recent years.LDPC codes have the overall advantages of flexibility,convenient decoding,and close to the Shannon limit.LDPC codes become a long code standard for 5G channel codes.Based on the structural characteristics of 5G NR LDPC codes,this article focuses on the effect of the channel serial-dynamic mixed scheduling strategy on decoding.The full text is divided into six chapters:In the first chapter,Introduction,we introduce the overall background and research progress of communication system,5G,channel coding,and LDPC codes;In the second chapter,we outline the form and structure of LDPC codes;In the third chapter,based on the fundamental of graph theory,we introduce the graphic representation,message passing process and trapping sets of the LDPC codes;Chapter 4 summarizes the iterating and judging process and the evolution of Belief Propagation algorithm,which is part of the subject of the article;In order to reduce the risk of the trapping sets,Chapter 5 gives a "Serial-Dynamic" mixed scheduling strategy,and analyzes the impact of multiple elements such as the switch condition,algorithmic combination,and adaptive convert condition,which is the main innovation part;In the sixth chapter,we summarize what we have done,and make further prospects.First of all,we improve the " minimum punching minimum degree"(LPLD)selection strategy.It is an algorithm model used to determine the update order of the check nodes.Simulation results verify the feasibility of this scheme.Then,based on the balanced relationship between performance and complexity,we propose the "Serial-Dynamic" mixed scheduling strategy.It is better than serial scheduling in performance,because it significantly reduces the possibility of trapping sets;It is far less than dynamic scheduling in complexity,because it significantly reduces the number of computing and comparative operations.At the same time,through a large number of experimental comparisons,we deeply analyze the basis of the choice of switch condition and algorithmic combination.Finally,relying on the convergence curve of the block error rate,we give the CTA adaptive convert condition and corresponding algorithm.It can quickly find the appropriate condition for algorithm switching.A large number of comparison experiments show the rationality of this strategy.