CPC H03M 13/1157 (2013.01) [H03M 13/1151 (2013.01); H03M 13/616 (2013.01)] | 18 Claims |
1. A low-density parity-check (LDPC) encoding method, wherein the method comprises:
obtaining, by a transmit end, k information bits to be sent to a receive end, wherein k is an integer greater than 0;
performing, by the transmit end, LDPC encoding on the k information bits by using a first check matrix based on a first transmission code rate R satisfying R=k/(n+j×Z) to obtain a first codeword, wherein:
the first check matrix is a submatrix of the first ((n—k)/Z+j) rows and the first (n/Z+j) columns in a check matrix H, and a code rate of the first check matrix is equal to the first transmission code rate;
n is an integer greater than 0, j is an integer greater than or equal to 0, and Z is an integer greater than 0;
the check matrix H is a matrix of ((n—k)/Z+Q) rows and (n/Z+Q) columns, Q is an integer greater than or equal to j, each element in the check matrix H represents one Z×Z square submatrix, and the square submatrix is a cyclic permutation matrix of an identity matrix or an all-zero matrix;
the check matrix H comprises a matrix HMC, a matrix HIR of Q rows and 24 columns, an all-zero matrix of 4 rows and Q columns, and an identity matrix of Q rows and Q columns; and
the matrix HMCis a matrix of (n—k)/Z rows and n/Z columns, the matrix HMCis located at an upper left corner of the check matrix H, the matrix HIR of Q rows and 24 columns is located at a lower left corner of the check matrix H, the all-zero matrix of 4 rows and Q columns is located at an upper right corner of the check matrix H, and the identity matrix of Q rows and Q columns is located at a lower right corner of the check matrix H; and
sending, by the transmit end, the first codeword comprising the k information bits and (n—k+j×Z) redundant bits to the receive end.
|