Method for generating ldpc code check matrix, and the ldpc code encoding method

Abstract

The invention discloses a method for generating an LDPC (Low Density Parity Check) code check matrix and an LDPC code coding method based on the check matrix. The method for generating the LDPC code check matrix comprises the steps of firstly constructing an index matrix and then constructing the check matrix by using the index matrix and specifically comprises the steps of: extending each element axy in the index matrix into a 2<m>-order (0,1) square matrix, namely a formula shown in a drawing, and then forming the check matrix; and constructing an equation shown in a drawing, wherein the element of each square matrix in the position of a formula shown in a drawing is 1, the other elements are all 0, and i is equal to 1, 2, 3 or 2<m>. Furthermore, a combination of the check matrix generated by using the method and a dual-diagonal matrix is provided. The invention further provides the LDPC code coding method adopting the check matrix generated by adopting any of the methods. The methods have the advantages of easiness in design, low coding complexity, small storage space and excellent performance.

Description

technical field [0001] The invention relates to the field of digital communication research, in particular to a method for generating an LDPC code check matrix and an LDPC code encoding method based on the matrix. Background technique [0002] LDPC code (Low Density Parity Check Code, Low Density Parity Check Code) is one of the most popular researches in the field of information and communication, and it is also a typical representative of modern coding theory. Compared with Turbo codes, LDPC codes have stronger error correction capabilities and lower error floors; the iterative decoding algorithm is a parallel algorithm, and the hardware implementation delay is much smaller than Turbo codes; An interleaver needs to be introduced to avoid possible delays. [0003] The excellent decoding performance of LDPC code makes it have a good application prospect. It can replace Turbo code in many fields and has been listed as the key technology of future mobile communication system....

AI Technical Summary

Problems solved by technology

For the QC method, it greatly saves storage space, but usually the performance of the QC method is not good when the bidiagonal matrix is ​​introduced, so it cannot be simply iteratively coded, so that the complexity of the code cannot be reduced, and the main frequency requirements of the processing chip Higher, so it is more difficult to reduce power consumption

Moreover, the QC method is very sensitive to the index matrix, and usually requires a larger order index matrix, which makes its design more difficult.

Images