Research On Coding And Decoding Method Based On LDPC Code

The fifth generation of mobile communications?5G?has opened business applications in2020,and the era of Internet of Things?IoTs?has followed.With the development of Internet of things,"intelligence"has become an essential element in human life.Once communication only existed between people,but now there is one more‘thing'among the communication objects.Data communication and message sharing have become the norm in the Internet of Things era.Although the 5G has been able to satisfy people's basic communication needs,due to the higher requirements for huge traffic and real-time information transmission in the era of the Internet of Things,5G can no longer meet these high requirements.Therefore,there is an urgent need for a new generation of mobile communication technology,6G,to meet new demands such as high-traffic data and low latency.However,the sixth generation mobile communication technology relies on the research and application of channel coding and decoding technology.Therefore,this paper studies the channel coding and decoding technology,and the research focus includes using the algorithm in the channel coding and decoding to solving the satisfiability problems of Boolean polynomial equations.Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science.In this paper,our goal is to propose a non-algebraic method for solving maximal Boolean polynomial equations?Max-PoSSo problem?.Using decoding method in coding theory a greedy algorithm which can prove the existence of all functions as 0 solutions is proposed at first,and the results shows that the solutions satisfying 256 functions are all 0 is non-existent;a random multi bit Flip algorithm is proposed combined the bit flipping decoding algorithm of low-density parity check codes with random numbers.By leveraging channel coding theory and dynamic programming,we propose three deterministic and robust algorithms for solving the satisfiability problems of Boolean polynomial equations.Comparisons are made among the three proposed algorithms and Genetic and Grobner algorithms.Experiment results show that the proposed algorithms exhibit better performance in terms of the largest number of Boolean polynomials equal to 0 compared to the benchmark schemes in the literature.Then,sufficient conditions for the determination of the girth are studied from the perspective of matroid theory.A novel method of constructing high-rate low-density parity-check?LDPC?codes is proposed based on the matroid theory.The parity-check matrices of the constructed LDPC codes are in the form of=[|₂].Simulation results show that the proposed LDPC codes outperform those in the literature over additive white Gaussian noise channels in terms of bit error rate performance.