Search

BR-112019026818-B1 - Encoding method, decoding method, device, communications device, terminal, base station and computer-readable media.

BR112019026818B1BR 112019026818 B1BR112019026818 B1BR 112019026818B1BR-112019026818-B1

Abstract

This application discloses a coding method, an apparatus, a communications device, and a communications system. The method includes: encoding an input bit sequence using the LDPC low-density parity-checking matrix, wherein the LDPC matrix is obtained based on a Z-elevation factor and a base matrix, the base matrix including row 0 to row 4 and column 0 to column 26 in one of the matrices shown in Figure 3b-1 to Figure 3b-10, or the base matrix includes row 0 to row 4 and some of column 0 to column 26 in one of the matrices shown in Figure 3b-1 to Figure 3b-10. The coding method, the apparatus, the communications device, and the communications system in this application can satisfy a channel coding requirement.

Inventors

  • Liang Ma
  • Chen Zheng
  • Xiaojian Liu
  • Yuejun Wei
  • Xin Zeng

Assignees

  • HUAWEI TECHNOLOGIES CO., LTD

Dates

Publication Date
20260310
Application Date
20180621
Priority Date
20170627

Claims (20)

  1. 1. Encoding method, CHARACTERIZED in that it comprises: determining a raising factor Z and a base matrix corresponding to the raising factor; performing low-density parity checking (LDPC) encoding on an input sequence c based on the raising factor Z and the base matrix to obtain an encoded sequence, wherein the base matrix comprises a plurality of non-zero elements (i, j), where i is a row index, j is a column index, an element in the base matrix is either a zero element or a non-zero element, each zero element corresponds to a null matrix of size Z x Z, each non-zero element (i, j) corresponds to a circular permutation matrix I(Pi,j) of size Z x Z, wherein Pi,j = mod (Vi,j, Z), and each of the non-zero elements (i, j) and Vi,j corresponding in row 0 to row 4 are as follows: i = 0, j = 0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, and Vi,j are respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0; i = 1, j = 0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, and Vi,j are respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0; i = 2, j = 0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, and Vi, j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0; i = 3, j = 0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, and Vi,j are respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0; ei = 4, j = 0, 1, 26, and Vi,j are respectively 246, 235, 0; and the remaining elements in row 0 to row 4 are zero elements.
  2. 2. Method, according to claim 1, CHARACTERIZED in that performing LDPC encoding on an input sequence c based on the elevation factor Z and the base matrix to obtain an encoded sequence comprises: obtaining an LDPC matrix H or LDPC matrix H parameters based on the elevation factor Z and the base matrix; encoding the input sequence c based on the LDPC matrix H or LDPC matrix H parameters to obtain the encoded sequence.
  3. 3. Method, according to claim 1, CHARACTERIZED in that performing LDPC encoding on an input sequence c based on the elevation factor Z and the base matrix to obtain an encoded sequence comprises: encoding the input sequence c based on the elevation factor Z and a transformed matrix of the base matrix to obtain the encoded sequence, wherein the transformed matrix of the base matrix corresponds to a matrix obtained by performing row transformation, column transformation, or row transformation and column transformation on the base matrix.
  4. 4. Method, according to any one of claims 1 to 3, CHARACTERIZED in that the input sequence is represented as c = {c0, c1, c2, ..., cK-1}, the encoded sequence is represented as d = {d0, d1, d2, ..., dN-1}, where both K and N are positive integers; the encoded sequence d comprises K-2Z bits of the input sequence c and parity bits in a parity sequence w, the parity sequence is represented as w={w0, w1, w2, ..., wN+2.Z -K-1}, where K is an integer multiple of Z.
  5. 5. Method according to claim 4, characterized in that K = 22Z N = 66-Z.
  6. 6. A method, according to any one of claims 2, 4, or 5, characterized in that the parity sequence we and the input sequence c satisfy: in which , 0T is a column vector, and the values of all elements of 0T are 0.
  7. 7. Decoding method, CHARACTERIZED by the fact that it comprises: determining a raising factor Z and a basis matrix corresponding to the raising factor; Decode a sequence of smooth values from a low-density parity-checking codeword, LDPC, based on the elevation factor Z and the base matrix to obtain a sequence of information, wherein the base matrix comprises a plurality of non-zero elements (i, j), where i is a row index, j is a column index, each non-zero element (i, j) corresponds to a circular permutation matrix I(Pi,j) of size Z x Z, wherein Pi,j = mod (Vi,j, Z), and each of the non-zero elements (i, j) and Vi,j corresponding in rows 0 to 4 are as follows: i = 0, j = 0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, and Vi,j is respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0; i = 1, j = 0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, and Vi,j is respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0;i = 2, j = 0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, and Vi,j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0;i = 3, j = 0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, and Vi,j is respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0; ei = 4, j = 0, 1, 26, and Vi,j is respectively 246, 235, 0; and the remaining elements in row 0 to row 4 are zero elements.
  8. 8. Method, according to any one of claims 1 to 7, CHARACTERIZED in that the basis matrix is a matrix of m rows and n columns, wherein m < 46, and n < 68.
  9. 9. Method according to claim 8, CHARACTERIZED in that the base matrix additionally comprises the following non-zero elements (i, j), and the corresponding values Vi,j of the non-zero elements (i, j) in rows 5 to 45 are as follows: i = 5, j = 0, 1, 3, 12, 16, 21, 22, 27 and Vi,j is respectively 261, 181, 72, 283, 254, 79, 144, 0; i = 6, j = 0, 6, 10, 11, 13, 17, 18, 20, 28, and Vi,j is respectively 80, 144, 169, 90, 59, 177, 151, 108, 0; i = 7, j = 0, 1, 4, 7, 8, 14, 29, and Vi,j are respectively 169, 189, 154, 184, 104, 164, 0; i = 8, j = 0, 1, 3, 12, 16, 19, 21, 22, 24, 30, and Vi,j are respectively 54, 0, 252, 41, 98, 46, 15, 230, 54, 0; i = 9, j = 0, 1, 10, 11, 13, 17, 18, 20, 31, and Vi,j are respectively 162, 159, 93, 134, 45, 132, 76, 209, 0;i = 10, j = 1, 2, 4, 7, 8, 14, 32, and Vi,j are respectively 178, 1, 28, 267, 234, 201, 0;i = 11, j = 0, 1, 12, 16, 21, 22, 23, 33, and Vi,j are respectively 55, 23, 274, 181, 273, 39, 26, 0;i = 12, j = 0, 1, 10, 11, 13, 18, 34, and Vi,j are respectively 225, 162, 244, 151, 238, 243, 0;i = 13, j = 0, 3, 7, 20, 23, 35, and Vi,j are respectively 231, 0, 216, 47, 36, 0; i = 14, j = 0, 12, 15, 16, 17, 21, 36, and Vi,j are respectively 0, 186, 253, 16, 0, 79, 0; i = 15, j = 0, 1, 10, 13, 18, 25, 37, and Vi,j are respectively 170, 0, 183, 108, 68, 64, 0; i = 16, j = 1, 3, 11, 20, 22, 38, and Vi,j are respectively 270, 13, 99, 54, 0, 0; i = 17, j = 0, 14, 16, 17, 21, 39, and Vi,j are respectively 153, 137, 0, 0, 162, 0; i = 18, j = 1, 12, 13, 18, 19, 40, and Vi,j are respectively 161, 151, 0, 241, 144, 0; i = 19, j = 0, 1, 7, 8, 10, 41, and Vi,j are respectively 0, 0, 118, 144, 0, 0; i = 20, j = 0, 3, 9, 11, 22, 42, and Vi,j are respectively 265, 81, 90, 144, 228, 0; i = 21, j = 1, 5, 16, 20, 21, 43, and Vi,j are respectively 64, 46, 266, 9, 18, 0; i = 22, j = 0, 12, 13, 17, 44, and Vi,j are respectively 72, 189, 72, 257, 0; i = 23, j = 1, 2, 10, 18, 45, and Vi,j are respectively 180, 0, 0, 165, 0; i = 24, j = 0, 3, 4, 11, 22, 46, and Vi,j are respectively 236, 199, 0, 266, 0, 0; i = 25, j = 1, 6, 7, 14, 47, and Vi,j are respectively 205, 0, 0, 183, 0; i = 26, j = 0, 2, 4, 15, 48, and Vi,j is respectively 0, 0, 0, 277, 0; i = 27, j = 1, 6, 8, 49, and Vi,j is respectively 45, 36, 72, 0; i = 28, j = 0, 4, 19, 21, 50, and Vi,j is respectively 275, 0, 155, 62, 0; i = 29, j = 1, 14, 18, 25, 51, and Vi,j is respectively 0, 180, 0, 42, 0; i = 30, j = 0, 10, 13, 24, 52, and Vi,j is respectively 0, 90, 252, 173, 0; i = 31, j = 1, 7, 22, 25, 53, and Vi,j is respectively 144, 144, 166, 19, 0; i = 32, j = 0, 12, 14, 24, 54, and Vi,j is respectively 0, 211, 36, 162, 0; i = 33, j = 1, 2, 11, 21, 55, and Vi,j is respectively 0, 0, 76, 18, 0; i = 34, j = 0, 7, 15, 17, 56, and Vi,j is respectively 197, 0, 108, 0, 0; i = 35, j = 1, 6, 12, 22, 57, and Vi,j are respectively 199, 278, 0, 205, 0; i = 36, j = 0, 14, 15, 18, 58, and Vi,j are respectively 216, 16, 0, 0, 0; i = 37, j = 1, 13, 23, 59, and Vi,j are respectively 72, 144, 0, 0; i = 38, j = 0, 9, 10, 12, 60, and Vi,j are respectively 190, 0, 0, 0, 0; i = 39, j = 1, 3, 7, 19, 61, and Vi,j are respectively 153, 0, 165, 117, 0; i = 40, j = 0, 8, 17, 62, and Vi,j is respectively 216, 144, 2, 0; i = 41, j = 1, 3, 9, 18, 63, and Vi,j is respectively 0, 0, 0, 183, 0; i = 42, j = 0, 4, 24, 64, and Vi,j is respectively 27, 0, 35, 0; i = 43, j = 1, 16, 18, 25, 65, and Vi,j is respectively 52, 243, 0, 270, 0; i = 44, j = 0, 7, 9, 22, 66, and Vi,j is respectively 18, 0, 0, 57, 0; ei = 45, j = 1, 6, 10, 67, and Vi,j is respectively 168, 0, 144, 0; and the remaining elements in row 5 to row 45 are zero elements.
  10. 10. Method, according to any one of claims 1 to 9, CHARACTERIZED in that Z is one of 9, 18, 36, 72, 144, and 288.
  11. 11. Apparatus, CHARACTERIZED by the fact that it comprises an encoder and a determination unit, wherein the determination unit is configured to determine an elevation factor Z and a basis matrix corresponding to the elevation factor; The encoder is configured to perform low-density parity-checking (LDPC) encoding on the input sequence based on the elevation factor Z and the base matrix to obtain an encoded sequence, wherein the base matrix comprises a plurality of non-zero elements (i, j), where i is a row index, j is a column index, an element in the base matrix is either a zero element or a non-zero element, each zero element corresponds to a null matrix of size Z x Z, each non-zero element (i, j) corresponds to a circular permutation matrix I(Pi,j) of size Z x Z, wherein Pi,j = mod (Vi,j, Z), and each of the non-zero elements (i, j) and corresponding Vi,j in row 0 to row 4 are as follows: i = 0, j = 0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, and Vi,j are respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0; i = 1, j = 0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, and Vi,j are respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0; i = 2, j = 0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, and Vi, j is respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0; i = 3, j = 0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, and Vi,j are respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0; ei = 4, j = 0, 1, 26, and Vi,j are respectively 246, 235, 0; and the remaining elements in row 0 to row 4 are zero elements.
  12. 12. Apparatus, according to claim 11, CHARACTERIZED in that the encoder is configured to: obtain an LDPC H matrix or LDPC H matrix parameters based on the elevation factor Z and the base matrix; encode the input sequence c based on the LDPC H matrix or LDPC H matrix parameters to obtain the encoded sequence.
  13. 13. Apparatus, according to claim 11, CHARACTERIZED in that the encoder is configured to: encode the input sequence c based on the elevation factor Z and on a transformed matrix of the base matrix to obtain the encoded sequence, wherein the transformed matrix of the base matrix corresponds to a matrix obtained by performing row transformation, column transformation, or row transformation and column transformation on the base matrix.
  14. 14. Apparatus, according to any one of claims 11 to 13, CHARACTERIZED in that the input sequence is represented as c = {c0, c1, c2, ..., cK-1}, the encoded sequence is represented as d = {d0, d1, d2, ..., dN-1}, wherein both K and N are positive integers; the encoded sequence d comprises K-2Z bits of the input sequence c and parity bits in a parity sequence w, the parity sequence is represented as w = {w0, w1, w2, ..., wN+2Z-K-1}, wherein K is an integer multiple of Z.
  15. 15. Apparatus according to claim 14, characterized in that K = 22-Z, N = 66Z
  16. 16. Apparatus, according to any one of claims 12, 14 or 15, CHARACTERIZED in that the parity sequence we and the input sequence c satisfy: in which 0T is a column vector, and the values of all elements in 0T are 0.
  17. 17. Apparatus, CHARACTERIZED in that it comprises a decoder and an acquisition unit, wherein the acquisition unit is configured to obtain a sequence of smooth values from a low-density parity-checking codeword, LDPC, and an elevation factor Z; the decoder is configured to decode a sequence of smooth values from an LDPC codeword based on a base matrix corresponding to the elevation factor Z to obtain a sequence of information, wherein the base matrix comprises a plurality of non-zero elements (i, j), where i is a row index, j is a column index, an element in the base matrix is either a zero element or a non-zero element, each zero element corresponds to a null matrix of size Z x Z, each non-zero element (i, j) corresponds to a circular permutation matrix I(Pi,j) of size Z x Z, wherein Pi j = mod (Vi,j, Z), and each of the non-zero elements (i, j) and Vi,j corresponding in row 0 The values in line 4 are as follows: i = 0, j = 0, 1, 2, 3, 5, 6, 9, 10, 11, 12, 13, 15, 16, 18, 19, 20, 21, 22, 23, and Vi, j are respectively 211, 198, 188, 186, 219, 4, 29, 144, 116, 216, 115, 233, 144, 95, 216, 73, 261, 1, 0; i = 1, j = 0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, and Vi,j are respectively 179, 162, 223, 256, 160, 76, 202, 117, 109, 15, 72, 152, 158, 147, 156, 119, 0, 0, 0; i = 2, j = 0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 17, 18, 19, 20, 24, 25, and Vi,j are respectively 258, 167, 220, 133, 243, 202, 218, 63, 0, 3, 74, 229, 0, 216, 269, 200, 234, 0, 0; i = 3, j = 0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 25, and Vi,j are respectively 187, 145, 166, 108, 82, 132, 197, 41, 162, 57, 36, 115, 242, 165, 0, 113, 108, 1, 0; and i = 4, j = 0, 1, 26, and Vi,j are respectively 246, 235, 0; and the remaining elements in row 0 to row 4 are zero elements.
  18. 18. Apparatus, according to any one of claims 11 to 17, CHARACTERIZED in that the base matrix is a matrix of m rows and n columns, wherein m < 46, and n < 68.
  19. 19. Apparatus, according to claim 18, CHARACTERIZED in that the base matrix additionally comprises the following non-zero elements (i, j), and the corresponding values Vi,j of the non-zero elements (i, j) in rows 5 to 45 are as follows: i = 5, j = 0, 1, 3, 12, 16, 21, 22, 27, and Vi,j is respectively 261, 181, 72, 283, 254, 79, 144, 0; i = 6, j = 0, 6, 10, 11, 13, 17, 18, 20, 28, and Vi,j is respectively 80, 144, 169, 90, 59, 177, 151, 108, 0; i = 7, j = 0, 1, 4, 7, 8, 14, 29, and Vi,j are respectively 169, 189, 154, 184, 104, 164, 0; i = 8, j = 0, 1, 3, 12, 16, 19, 21, 22, 24, 30, and Vi,j are respectively 54, 0, 252, 41, 98, 46, 15, 230, 54, 0; i = 9, j = 0, 1, 10, 11, 13, 17, 18, 20, 31, and Vi,j are respectively 162, 159, 93, 134, 45, 132, 76, 209, 0; i = 10, j = 1, 2, 4, 7, 8, 14, 32, and Vi,j are respectively 178, 1, 28, 267, 234, 201, 0; i = 11, j = 0, 1, 12, 16, 21, 22, 23, 33, and Vi,j are respectively 55, 23, 274, 181, 273, 39, 26, 0; i = 12, j = 0, 1, 10, 11, 13, 18, 34, and Vi,j are respectively 225, 162, 244, 151, 238, 243, 0; i = 13, j = 0, 3, 7, 20, 23, 35, and Vi,j are respectively 231, 0, 216, 47, 36, 0; i = 14, j = 0, 12, 15, 16, 17, 21, 36, and Vi,j are respectively 0, 186, 253, 16, 0, 79, 0; i = 15, j = 0, 1, 10, 13, 18, 25, 37, and Vi,j are respectively 170, 0, 183, 108, 68, 64, 0; i = 16, j = 1, 3, 11, 20, 22, 38, and Vi,j are respectively 270, 13, 99, 54, 0, 0; i = 17, j = 0, 14, 16, 17, 21, 39, and Vi,j are respectively 153, 137, 0, 0, 162, 0; i = 18, j = 1, 12, 13, 18, 19, 40, and Vi,j are respectively 161, 151, 0, 241, 144, 0; i = 19, j = 0, 1, 7, 8, 10, 41, and Vi,j are respectively 0, 0, 118, 144, 0, 0; i = 20, j = 0, 3, 9, 11, 22, 42, and Vi,j are respectively 265, 81, 90, 144, 228, 0; i = 21, j = 1, 5, 16, 20, 21, 43, and Vi,j are respectively 64, 46, 266, 9, 18, 0; i = 22, j = 0, 12, 13, 17, 44, and Vi,j are respectively 72, 189, 72, 257, 0; i = 23, j = 1, 2, 10, 18, 45, and Vi,j are respectively 180, 0, 0, 165, 0; i = 24, j = 0, 3, 4, 11, 22, 46, and Vi,j are respectively 236, 199, 0, 266, 0, 0; i = 25, j = 1, 6, 7, 14, 47, and Vi,j are respectively 205, 0, 0, 183, 0;i = 26, j = 0, 2, 4, 15, 48, and Vi,j are respectively 0, 0, 0, 277, 0;i = 27, j = 1, 6, 8, 49, and Vi,j are respectively 45, 36, 72, 0;i = 28, j = 0, 4, 19, 21, 50, and Vi,j are respectively 275, 0, 155, 62, 0;i = 29, j = 1, 14, 18, 25, 51, and Vi,j are respectively 0, 180, 0, 42, 0;i = 30, j = 0, 10, 13, 24, 52, and Vi,j are respectively 0, 90, 252, 173, 0;i = 31, j = 1, 7, 22, 25, 53, and Vi,j is respectively 144, 144, 166, 19, 0; i = 32, j = 0, 12, 14, 24, 54, and Vi,j is respectively 0, 211, 36, 162, 0; i = 33, j = 1, 2, 11, 21, 55, and Vi,j is respectively 0, 0, 76, 18, 0; i = 34, j = 0, 7, 15, 17, 56, and Vi,j is respectively 197, 0, 108, 0, 0; i = 35, j = 1, 6, 12, 22, 57, and Vi,j is respectively 199, 278, 0, 205, 0; i = 36, j = 0, 14, 15, 18, 58, and Vi,j is respectively 216, 16, 0, 0, 0; i = 37, j = 1, 13, 23, 59, and Vi,j are respectively 72, 144, 0, 0; i = 38, j = 0, 9, 10, 12, 60, and Vi,j are respectively 190, 0, 0, 0, 0; i = 39, j = 1, 3, 7, 19, 61, and Vi,j are respectively 153, 0, 165, 117, 0; i = 40, j = 0, 8, 17, 62, and Vi,j are respectively 216, 144, 2, 0; i = 41, j = 1, 3, 9, 18, 63, and Vi,j are respectively 0, 0, 0, 183, 0; i = 42, j = 0, 4, 24, 64, and Vi,j are respectively 27, 0, 35, 0; i = 43, j = 1, 16, 18, 25, 65, and Vi,j are respectively 52, 243, 0, 270, 0; i = 44, j = 0, 7, 9, 22, 66, and Vi,j are respectively 18, 0, 0, 57, 0; and i = 45, j = 1, 6, 10, 67, and Vi,j are respectively 168, 0, 144, 0; and the remaining elements in row 5 to row 45 are zero elements.
  20. 20. Apparatus according to any one of claims 11 to 19, CHARACTERIZED in that Z is one of 9, 18, 36, 72, 144, and 288.

Description

TECHNICAL FIELD [0001] The modalities of the present application relate to the field of communications and, in particular, to a method of information processing and a communications apparatus. FUNDAMENTALS [0002] Low-density parity-check (LDPC) code is a type of linear block code with a sparse parity-check matrix and is characterized by a flexible structure and low decoding complexity. Because LDPC code decoding uses a partially parallel iterative decoding algorithm, LDPC code has a higher throughput than a conventional turbo code. LDPC code can be used as an error correction code in a communications system to increase channel transmission reliability and energy utilization. LDPC code can be even more widely applied to space communication, fiber optic communication, personal communication systems, ADSL, magnetic recording devices, and the like. Currently, the LDPC code scheme has been considered as one of the channel coding schemes in 5th generation mobile communication. [0003] In practical applications, LDPC arrays characterized by different special structures can be used. An LDPC H array, with a special structure, can be obtained by expanding a base LDPC array with a quasi-cyclic (QC) structure. A coding scheme using QC-LDPC arrays is suitable for hardware with a high degree of parallelism and provides a higher throughput. The LDPC array can be designed as applicable to channel coding. [0004] QC-LDPC is suitable for hardware with a high degree of parallelism and provides a higher transfer rate. The LDPC array can be designed to be applicable to channel coding. SUMMARY [0005] The embodiments of the present application provide a method of information processing, and a communications apparatus and system, for supporting the encoding and decoding of information bit sequences of a plurality of lengths. [0006] According to a first aspect, an encoding method and an encoder are provided. The encoder encodes an input sequence using a low-density parity-checking matrix (LDPC). [0007] According to a second aspect, a decoding method and a decoder are provided. The decoder decodes an input sequence using a low-density parity-checking matrix (LDPC). [0008] In a first implementation of the first aspect or the second aspect, the LDPC matrix is obtained based on an elevation factor Z and a base matrix. [0009] Based on the previous implementation, a basis matrix of a basis graph 30a may include row 0 to row 4 and column 0 to column 26 in one of the matrices 30b-10, 30b-11, 30b-20, 30b-21, 30b-30, 30b-40, 30b-50, 30b-60, 30b-70 and 30b-80, or the basis matrix may include row 0 to row 4 and part of column 0 to column 26 in one of the matrices 30b-10, 30b-11, 30b-20, 30b-21, 30b-30, 30b-40, 30b-50, 30b-60, 30b-70 and 30b-80, or the basis matrix may be a matrix obtained Performing row/column permutations on a matrix including row 0 to row 4 and column 0 to column 26 in one of the matrices 30b-10 to 30b-80, or the base matrix can be a matrix obtained by performing row/column permutations on a matrix including row 0 to row 4 and part of column 0 to column 26 in one of the matrices 30b-10, 30b-11, 30b-20, 30b-21, 30b-30, 30b-40, 30b-50, 30b-60, 30b-70 and 30b-80. [0010] Additionally, the basis matrix of the basis graph 30a may additionally include row 0 to row (m-1) and column 0 to column (n-1) in one of the matrices 30b-10, 30b-11, 30b-20, 30b-21, 30b-30, 30b-40, 30b-50, 30b-60, 30b-70 and 30b-80, or the basis matrix may be a matrix obtained by performing row/column permutation in a matrix including row 0 to row (m-1) and column 0 to column (n-1) in one of the matrices 30b-10, 30b-11, 30b-20, 30b-21, 30b-30, 30b-40, 30b-50, 30b-60, 30b-70 and 30b-80, where 5 - m - 46, and 27 - n - 68. [0011] To support different code block lengths, an LDPC code needs different Z-elevation factors. Based on the previous implementation, in a possible implementation, based on the different Z-elevation factors, base matrices corresponding to the different Z-elevation factors are used. For example, Z = ax 2j, 0 - j < 7, ea e{2,3,5,7,9,11,13,15} . [0012] a = 2, the basis matrix may include row 0 to row 4 and column 0 to column 26 in the 30b-10 or 30b-11 matrix, or the basis matrix includes row 0 to row 4 and part of column 0 to column 26 in the 30b-10 or 30b-11 matrix. Additionally, the basis matrix also includes row 0 to row (m-1) and column 0 to column (n-1) in the 30b-10 or 30b-11 matrix. [0013] If a = 3, the basis matrix may include row 0 to row 4 and column 0 to column 26 in the 30b-20 or 30b-21 matrix, or the basis matrix includes row 0 to row 4 and part of column 0 to column 26 in the 30b-20 or 30b-21 matrix. Additionally, the basis matrix also includes row 0 to row (m-1) and column 0 to column (n-1) in the 30b-20 or 30b-21 matrix. [0014] If a = 5, the basis matrix may include row 0 to row 4 and column 0 to column 26 in the 30b-30 matrix, or the basis matrix includes row 0 to row 4 and part of column 0 to column 26 in the 30b-30 matrix. Additio