Abstract

This paper presents an intelligent protograph construction algorithm. Protograph LDPC codes have shown excellent error correction performance and play an important role in wireless communications. Random search or manual construction are often used to obtain a good protograph, but the efficiency is not high enough and many experience and skills are needed. In this paper, a fast searching algorithm is proposed using the convolution neural network to predict the iterative decoding thresholds of protograph LDPC codes effectively. A special input data transformation rule is applied to provide stronger generalization ability. The proposed algorithm converges faster than other algorithms. The iterative decoding threshold of the constructed proto-graph surpasses greedy algorithm and random search by about 0.53 dB and 0.93 dB respectively under 100 times of density evolution. Simulation results show that quasi-cyclic LDPC (QC-LDPC) codes constructed from the proposed algorithm have competitive performance compared to other papers.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call