METHOD AND APPARATUS FOR DATA PROCESSING WITH STRUCTURED LDPC CODES

• US 20200136648A1
• Filed: 12/30/2019
• Published: 04/30/2020
• Est. Priority Date: 05/13/2016
• Status: Active Grant

• Current Assignee: ZTE Corporation
• Original Assignee: ZTE Corporation
• Inventors: Li, Liguang, Xu, Jun, Xu, Jin
• Granted Patent: US 11,139,835 B2
• Time in Patent Office: Days
• CPC Class Codes: H03M 13/00 Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes error detection or error correction for analogue/digital, digital/analogue or code conversion H03M1/00 – H03M11/00; specially adapted for digital computers G06F11/08; for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B20/18; for static stores G11C
• CPC Class Codes: H03M 13/09 Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
• CPC Class Codes: H03M 13/11 using multiple parity bits
• CPC Class Codes: H03M 13/1137 Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel
• CPC Class Codes: H03M 13/114 Shuffled, staggered, layered or turbo decoding schedules
• CPC Class Codes: H03M 13/1148 Structural properties of the code parity-check or generator matrix
• CPC Class Codes: H03M 13/116 Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
• CPC Class Codes: H03M 13/1185 wherein the parity-check matrix comprises a part with a double-diagonal
• CPC Class Codes: H03M 13/2906 using block codes H03M13/2957 takes precedence
• CPC Class Codes: H03M 13/616 Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
• CPC Class Codes: H03M 13/6356 by repetition or insertion of dummy data, i.e. rate reduction
• CPC Class Codes: H03M 13/6516 Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields

Abstract

The embodiments of the present disclosure provide a method and an apparatus for data processing with structured LDPC codes. The method includes: obtaining a code block size for structured LDPC coding; determining a coding expansion factor z based on at least one of the code block size, a parameter kb of a basic check matrix, a positive integer value p or the basic check matrix having mb rows and nb columns; and encoding a data sequence to be encoded, or decoding a data sequence to be decoded, based on the basic check matrix and the coding expansion factor. The present disclosure is capable of solving the problem in the related art associated with low flexibility in data processing with LDPC coding and improving the flexibility in data processing with LDPC coding.

Claims

1. A method for wireless communication, comprising:

determining a code block size for Low Density Parity Check (LDPC) coding;

determining a coding expansion factor Z from a set of coding expansion factors based on the code block size and a parameter kb associated with a basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1;

encoding a data sequence based on the basic check matrix and the coding expansion factor Z; and

transmitting a subset of the encoded data sequence, the subset excluding q*Z bits corresponding to q columns of the basic matrix, q being a positive integer.

2. The method of claim 1, wherein the code block size is determined based on a set of code block sizes organized in an ascending order.

3. The method of claim 1, wherein q=2.

4. The method of claim 1, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

5. The method of claim 1, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.

6. A method for wireless communication, comprising:

receiving a data sequence, wherein the data sequence is a subset of an encoded sequence that excludes q*Z bits corresponding to q columns of a basic check matrix, q being a positive integer and Z being a coding expansion factor, wherein the coding expansion factor Z is selected from a set of coding expansion factors based on a code block size and a parameter kb associated with the basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1; and

decoding the data sequence based on the basic check matrix and the coding expansion factor Z.

7. The method of claim 6, wherein the code block size is determined based on a set of code block sizes organized in an ascending order.

8. The method of claim 6, wherein q=2.

9. The method of claim 6, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

10. The method of claim 6, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.

11. An apparatus for digital communications, comprising:

a processor; and

a memory including processor-executable instructions stored thereon, the processor-executable instructions upon execution by the processor configure the processor to;

determine a code block size for Low Density Parity Check (LDPC) coding;

determine a coding expansion factor Z from a set of coding expansion factors based on the code block size and a parameter kb associated with a basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1;

encode a data sequence based on the basic check matrix and the coding expansion factor Z; and

transmit a subset of the encoded data sequence, the subset excluding q*Z bits corresponding to q columns of the basic matrix, q being a positive integer.

12. The apparatus of claim 11, wherein the processor is configured to determine the code block size based on a set of code block sizes organized in an ascending order.

13. The apparatus of claim 11, wherein q=2.

14. The apparatus of claim 11, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

15. The apparatus of claim 11, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.

16. An apparatus for digital communications, comprising:

a processor; and

a memory including processor-executable instructions stored thereon, the processor-executable instructions upon execution by the processor configure the processor to;

receive a data sequence, wherein the data sequence is a subset of an encoded sequence that excludes q*Z bits corresponding to q columns of a basic check matrix, q being a positive integer and Z being a coding expansion factor, wherein the coding expansion factor Z is selected from a set of coding expansion factors based on a code block size and a parameter kb associated with the basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1; and

decode the data sequence based on the basic check matrix and the coding expansion factor Z.

17. The apparatus of claim 16, wherein the processor is configured to determine the code block size based on a set of code block sizes organized in an ascending order.

18. The apparatus of claim 16, wherein q=2.

19. The apparatus of claim 16, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

20. The apparatus of claim 16, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.

21. A non-transitory computer readable medium having code stored thereon, the code when executed by a processor, causing the processor to implement a method that comprises:

determining a code block size for Low Density Parity Check (LDPC) coding;

determining a coding expansion factor Z from a set of coding expansion factors based on the code block size and a parameter kb associated with a basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1;

encoding a data sequence based on the basic check matrix and the coding expansion factor Z; and

transmitting a subset of the encoded data sequence, the subset excluding q*Z bits corresponding to q columns of the basic matrix, q being a positive integer.

22. The non-transitory computer readable medium of claim 21, wherein the code block size is determined based on a set of code block sizes organized in an ascending order.

23. The non-transitory computer readable medium of claim 21, wherein q=2.

24. The non-transitory computer readable medium of claim 21, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

25. The non-transitory computer readable medium of claim 21, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.

26. A non-transitory computer readable medium having code stored thereon, the code when executed by a processor, causing the processor to implement a method that comprises:

receiving a data sequence, wherein the data sequence is a subset of an encoded sequence that excludes q*Z bits corresponding to q columns of a basic check matrix, q being a positive integer and Z being a coding expansion factor, wherein the coding expansion factor Z is selected from a set of coding expansion factors based on a code block size and a parameter kb associated with the basic check matrix, wherein the parameter kb and the coding expansion factor Z are integers larger than 1, and wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb; and

decoding the data sequence based on the basic check matrix and the coding expansion factor Z.

27. The non-transitory computer readable medium of claim 26, wherein the code block size is determined based on a set of code block sizes organized in an ascending order.

28. The non-transitory computer readable medium of claim 26, wherein q=2.

29. The non-transitory computer readable medium of claim 26, wherein each of the q columns of the basic check matrix is given a column weight to indicate a number of elements each representing a square matrix obtained by cyclically shifting an identify matrix, and wherein a difference between column weights of any two of q columns is equal to 1.

30. The non-transitory computer readable medium of claim 26, wherein the basic check matrix has mb rows and nb columns, kb being equal to nb minus mb.