Matrix constructing method and equipment, and encoding and decoding methods and equipment

Abstract

The embodiment of the invention provides a matrix constructing method and equipment, and encoding and decoding methods and equipment. The encoding method comprises the following steps: encoding information sequence according to an expanded archetype graph matrix to obtain a checkout sequence; punching the checkout sequence; and generating a codeword bit sequence according to the information sequence and the rest of bits after punching of the checkout sequence. The expanded archetype graph matrix comprises submatrixes a<1>, b<1>, c<1>, t<1> and e<1> which are obtained through expanding submatrixes a, b, c, t and e in an LDPC (Low Density Parity Check) code archetype graph adjacency matrix, and a submatrix D1 obtained through expanding all non-zero elements in the submatrix d into a 1-row 1-line matrix according to both the quantity and the cyclic shift amount of one-step restored nodes in an expanded matrix corresponding to all non-zero elements in the preset submatrix d. By adopting the technical scheme provided by the embodiment of the invention, the quantity of bits hit off and decoded and restored in one step through iteration is more, and the decoding performance is improved.

Description

technical field [0001] The present invention relates to the field of encoding technology, in particular to a matrix construction method and equipment, and an encoding and decoding method and equipment. Background technique [0002] Low Density Parity Check (LDPC, Low Density Parity Check) code has the characteristics of excellent error correction performance, high decoding throughput, simple decoding, etc., so it has become a research hotspot in the field of channel coding and decoding, and LDPC code and hybrid automatic The combination of the retransmission request (HARQ, Hybrid Automatic RepeatreQuest) technology is the current research focus in this field. [0003] In mobile communication systems, HARQ is almost a necessary technology, which requires the constructed LDPC code not only to have excellent error correction performance, but also to have good code rate compatibility. [0004] Existing variable code rate LDPC codes can be classified into LDPC codes with pre-pun...

AI Technical Summary

Problems solved by technology

[0010] In the prior art, the LDPC code parity check matrix is ​​obtained by quasi-cyclic expansion of each sub-matrix in the adjacency matrix of the LDPC code prototype graph, because the sub-matrix d in the LDPC code prototype graph adjacency matrix is ​​quasi-cyclically expanded to obtain the sub-matrix D, so according to the received information bit information and check bit information, as well as the matrix D and matrix C in the LDPC matrix, a check equation can be used to restore the deleted check bits using one-step decoding iterations The number is very small, and most of the knocked out parity bits need to be restored by multi-step decoding iterations, thus affecting the decoding performance

Images