Short code length QC-LDPC code construction method based on Stanley sequence and genetic algorithm

By constructing short code-length QC-LDPC codes using Stanley sequences and genetic algorithms, the problems of high coding complexity and insufficient error correction performance in existing technologies are solved, achieving low-complexity and high-efficiency error correction performance improvement, which is suitable for fields such as 5G communication.

CN121907256APending Publication Date: 2026-04-21CHONGQING UNIV OF POSTS & TELECOMM
0 Cites 0 Cited by

Patent Information

Application Number
CN202512001176.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-12-29
Publication Date
2026-04-21

AI Technical Summary

Technical Problem

In existing technologies, the construction methods of short code long QC-LDPC codes have problems such as high encoding and decoding complexity, difficulty in hardware implementation, and insufficient error correction performance, which makes it difficult to meet the high reliability requirements, especially in real-time communication scenarios such as 5G.

Method used

The first two rows of the exponent matrix that satisfy the condition of no 4-ring are constructed using Stanley sequences. The third row is then searched using a genetic algorithm to construct an exponent matrix with a ring length of at least 8 and a small number of trap sets. By expanding the exponent matrix, a parity check matrix is ​​obtained, and a regular short code length QC-LDPC code is designed.

Benefits of technology

The constructed short-code-length QC-LDPC code outperforms existing methods in error correction performance, has flexible code length and code rate, low coding complexity, and no obvious error layering phenomenon. Simulation results show that the net coding gain is improved, making it suitable for fields such as 5G communication.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention relates to a short code length QC-LDPC (Quasi-Cyclic Low-Density Parity-Check) code construction method based on a Stanley sequence and a genetic algorithm. According to the method, a Stanley sequence is used for forming first two rows of an index matrix meeting the condition that no four rings exist, then a genetic algorithm is used for searching a third row element which enables the index matrix to meet the requirements that the ring length is at least 8 and the number of trap sets is small, and therefore the index matrix with the girth length being at least 8 is obtained, the genetic algorithm can guarantee that the number of the trap sets is minimum, and the number of trap sets is small. And finally, the index matrix is expanded to obtain a parity check matrix of the index matrix, so that four rings and six rings do not exist in a Tanner graph of the check matrix, the number of trap sets is small, the storage space required by code words is small, and hardware implementation is easy. Simulation shows that compared with an HS-QC-LDPC code, an MT-QC-LDPC code and an SES-QC-LDPC code which have the same code rate and code length, the SS-QC-LDPC code constructed by the method has the advantages that the net coding gain is improved to a certain extent, and the constructed SS-QC-LDPC code has better waterfall region performance in a high signal-to-noise ratio region and has no obvious error leveling phenomenon.
Need to check novelty before this filing date? Find Prior Art