Search

BR-112019027876-B1 - Encoding method for wireless communication, encoder, decoding method, decoder, communication device, computer-readable storage medium, and communication system.

BR112019027876B1BR 112019027876 B1BR112019027876 B1BR 112019027876B1BR-112019027876-B1

Abstract

The present invention relates to an encoding method, a device, a communication device, and a communication system. The method comprises: encoding an input bit sequence by using a low-density parity-checking (LDPC) matrix, wherein the LDPC matrix is obtained based on a Z-elevation factor and a base matrix. The base matrix includes rows 0 to 6 and columns 0 to 16 of one of the matrices shown in FIGS. 3b-1 to 3b-8. Alternatively, the base matrix includes rows 0 to 6 and some of the columns 0 to 16 in any matrix shown in FIGS. 3b-1 to 3b-8. The encoding method, the device, the communication device, and the communication system in this application can support encoding requirements for information bit sequences with a plurality of lengths.

Inventors

  • Jie Jin
  • IVAN LEONIDOVICH MAZURENKO
  • ALEKSANDR ALEKSANDROVICH PETIUSHKO
  • Chaolong Zhang

Assignees

  • HUAWEI TECHNOLOGIES CO., LTD

Dates

Publication Date
20260310
Application Date
20180627
Priority Date
20170627

Claims (20)

  1. 1. Low-density parity-checking (LDPC) coding method, characterized in that it comprises: determining a raising factor Z and a basis matrix corresponding to the raising factor Z, wherein the raising factor Z is one of 5, 10, 20, 40, 80, 160, or 320; encoding an input sequence c based on the raising factor Z and the basis matrix to obtain an encoded sequence d, and outputting the encoded sequence d; wherein the basis matrix comprises a plurality of consecutive rows and columns respectively starting from row 0 and column 0 of an HB matrix, wherein an element in the basis matrix is either a zero element or a non-zero element, which are respectively represented by their row index i and column index j, wherein each zero element in the basis matrix corresponds to an all-zero matrix of size Z*Z, wherein a non-zero element in row i and column j in the basis matrix corresponds to a circular permutation matrix of size Z*Z, and The circular permutation matrix corresponds to an identity matrix of size Z*Z shifted circularly to the right by Pi,j times, where Pi,j = mod(Vi,j,Z); and where all elements except the non-zero elements in matrix HB are zero elements, the non-zero elements of matrix HB whose row indices (i), column indices (j), and corresponding Vi,j values are as follows:
  2. 2. Method, according to claim 1, characterized in that the elevation factor Z is determined according to a length K of the input sequence c.
  3. 3. Method, according to claim 1 or 2, characterized in that the determination of the elevation factor Z and of a basis matrix corresponding to the elevation factor Z comprises: determining the elevation factor Z; and determining the basis matrix according to an index adjusted from the elevation factor Z.
  4. 4. Method, according to claim 2 or 3, characterized in that the encoded sequence d has a length of N, where N=50Z.
  5. 5. A method, according to any one of claims 1 to 4, characterized in that the input sequence c is a sequence emitted from a code block segmentation.
  6. 6. A method according to any one of claims 1 to 5, characterized in that Z is a minimum value that satisfies Kb Z ≥ K, and Kb is one of 6, 8, 9, and 10.
  7. 7. Method according to claim 6, characterized in that Kb satisfies:
  8. 8. A method according to any one of claims 2 to 7, characterized in that K is an integer multiple of Z.
  9. 9. A method according to any one of claims 2 to 8, characterized in that K is 5 times Z, 6 times Z, 7 times Z, 8 times Z, 9 times Z, or 10 times Z.
  10. 10. Method, according to any one of claims 2 to 9, characterized in that the input sequence ce and the encoded sequence d satisfy: for k = 2Z a K-1, if dk-2z = ck; else ck = 0; dk-2Z = <null>; close if close for.
  11. 11. A method, according to any one of claims 1 to 10, characterized in that encoding an input sequence c based on the elevation factor Z and the basis matrix to obtain an encoded sequence d comprises: obtaining a low-density parity check (LDPC) matrix H according to the elevation factor Z and the basis matrix; encoding the input sequence c to obtain the encoded sequence d according to the LDPC matrix H.
  12. 12. Method, according to any one of claims 1 to 11, characterized in that it comprises: generating a parity sequence w, the parity sequence w comprising N+2Z-K bits, where K is the length of the input sequence c, N is the length of the encoded sequence d, the parity sequence w is represented as WO,WI,W2,...,WN+2Z-K-I.
  13. 13. Method, according to claim 11 or 12, characterized in that the LDPC matrix H, the deparity sequence wea, and the input sequence c satisfy: , where c=[c0,c1,c2,.,cK-1]T, w=[w0,w1,w2,.,wN+2z-K-1]T, 0 represents a column vector, and the values of all elements in 0 are 0.
  14. 14. Method, according to claim 12 or 13, characterized in that the encoded sequence d and the parity sequence w satisfy: for k = K a N+2Z-1, dk-2Z = wk-K.
  15. 15. A method, according to any one of claims 1 to 14, characterized in that encoding an input sequence c based on the raising factor Z and the basis matrix to obtain an encoded sequence d comprises: encoding an input sequence c according to the raising factor Z and a transformation matrix to obtain the encoded sequence d, wherein the transformation matrix is a matrix obtained by performing row transformation, column transformation, or row and column transformation on the basis matrix.
  16. 16. Method, according to any one of claims 1 to 15, characterized in that the basis matrix is a matrix of m rows and n columns, where m<42 and n<52.
  17. 17. A method, according to any one of claims 1 to 16, characterized in that the number of rows and columns of the base matrix is determined based on a code rate.
  18. 18. Encoder, characterized in that the encoder is configured to perform the method as defined in any one of claims 1 to 17.
  19. 19. Low-density parity-checking (LDPC) decoding method, characterized in that it comprises: determining a Z-factor and a basis matrix corresponding to the Z-factor, wherein the Z-factor is one of 5, 10, 20, 40, 80, 160, or 320; decoding an input sequence based on the Z-factor and the basis matrix to obtain a decoded sequence, and outputting the decoded sequence; wherein the basis matrix comprises a plurality of consecutive rows and columns respectively starting from row 0 and column 0 of an HB matrix, wherein each element in the basis matrix is either a zero element or a non-zero element, which are respectively represented by their row index i.e. column index j, wherein each zero element in the basis matrix corresponds to an all-zero matrix of size Z*Z, wherein a non-zero element in row i.e. column j in the basis matrix corresponds to a circular permutation matrix of size Z*Z, and The circular permutation matrix corresponds to an identity matrix of size Z*Z shifted circularly to the right by Pi,j times, where Pi,j = mod(Vi,j,Z); and where all elements except the non-zero elements in matrix HB are zero elements, the non-zero elements of matrix HB whose row indices (i), column indices (j), and corresponding Vi,j values are as follows:
  20. 20. Method, according to claim 19, characterized in that the elevation factor Z is determined according to a length K of the input sequence.

Description

TECHNICAL FIELD [0001] The embodiments of this application relate to the field of communications, and in particular to a method of information processing and a communication device. BACKGROUND [0002] A Low-Density Parity Check (LDPC) code is a type of linear block code characterized by a sparse check matrix, and has a flexible structure and low decoding complexity. Because a partially parallel iterative decoding algorithm can be used to decode an LDPC-encoded codeword, the LDPC code has a higher throughput than a conventional Turbo code. The LDPC code can be used as an error correction code in a communication system, in order to improve reliability and energy utilization in channel-based transmission. The LDPC code can also be widely used in space communications, fiber optic communications, personal communication systems, asymmetric digital subscriber cycle (ADSL), magnetic logging devices, and the like. Currently, the LDPC code has been considered as one of the channel coding schemes in fifth-generation (5G) mobile communication systems. [0003] In current applications, LDPC matrices having different special structures can be used. An LDPC H matrix, having a special structure, can be obtained by expansion (also called elevation) of a base LDPC matrix having a quasi-cycle (QC) structure. A coding scheme using QC-LDPC matrices is suitable for hardware with a high degree of parallelism, and provides higher throughput. The LDPC-QC matrix can be designed to be suitable for channel coding. [0004] A coding scheme using QC-LDPC arrays is suitable for hardware with a high degree of parallelism, and provides higher throughput. LDPC-QC arrays can be designed to be suitable for channel coding. SUMMARY [0005] The embodiments of the present application provide a method of information processing, and a communication apparatus and system, in order to support encoding and decoding of bit sequences of information with a plurality of lengths. [0006] According to a first aspect, a decoding method and an encoder are provided. The encoder encodes an input sequence by using a low-density parity check (LDPC) matrix. [0007] According to a second aspect, a decoding method and a decoder are provided. The decoder decodes an input sequence by using an LDPC matrix. [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 basis matrix. [0009] Based on the preceding implementation, a basis matrix of a basis graph includes one of the following: the basis matrix includes row 0 to row 6, column 0 to column 16 of one of the matrices shown in Figures 3b-1 to 3b-8, or the basis matrix includes row 0 to row 6, some columns from column 0 to column 16 in one of the matrices shown in Figures 3b-1 to 3b-8, or the basis matrix is a matrix obtained by performing row transformation/column transformation on row 0 to row 6, column 0 to column 16 in one of the matrices shown in Figures 3b-1 to 3b-8, or the basis matrix is a matrix obtained by performing row transformation/column transformation on row 0 to row 6, some columns from column 0 to column 16 in one of the matrices shown in Figures 3b-1 to 3b-8. [0010] To support different code block lengths, different elevation factors Z are needed for an LDPC code. Based on previous implementations, basis matrices corresponding to different elevation factors Z are used based on the different elevation factors Z. In some implementations, Z=a*2j where 0<j<7, and a ∈ {2,3,5,7,9,11,13,15}. [0011] Additionally, based on previous implementations, the LDPC matrix can be obtained based on a Z-elevation factor and an Hs matrix that is obtained by offsetting the preceding basis matrix. Alternatively, the LDPC matrix can be obtained based on a Z-elevation factor and a matrix that is obtained by performing row transformation/column transformation on an Hs matrix, and Hs is obtained by offsetting the preceding basis matrix. The offsetting of the preceding basis matrix can be increasing or decreasing a change value greater than or equal to 0 in one or more columns by offsetting. [0012] The base graph and the base matrix of the LDPC matrix in previous implementations can satisfy a code block performance requirement of a plurality of block lengths. [0013] The Z-elevation factor can be determined by the encoder or decoder based on a length K of the input sequence, or it can be determined by another device and provided to the encoder or decoder as an input parameter. Optionally, the LDPC matrix can be obtained based on the obtained Z-elevation factor and a base matrix corresponding to the Z-elevation factor. [0014] In a second implementation of the first aspect or the second aspect, the LDPC matrix is obtained based on the elevation factor Z and parameter(s) of the LDPC matrix. [0015] The LDPC matrix parameters may include a row index, a column index of a column in which a non-zero element is located, and a change value of the non-zero element. Th