Method and apparatus for data processing with structured LDPC codes

• US 10,523,237 B2
• Filed: 10/25/2018
• Issued: 12/31/2019
• Est. Priority Date: 05/13/2016
• Status: Active Grant

• Current Assignee: ZTE Corporation
• Original Assignee: ZTE Corporation
• Inventors: Li, Liguang, Xu, Jun, Xu, Jin
• Primary Examiner(s): Rizk, Samir W
• Application Number:
  US16/171,314
• Publication Number:
  US 20190068224A1
• Time in Patent Office: 432 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 digital communications, comprising:

obtaining 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 set of coding expansion factors includes a set of natural numbers; and

encoding or decoding a data sequence based on the basic check matrix and the coding expansion factor z,

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, and wherein kb is equal to nb minus mb.

2. The method of claim 1, wherein each value in the set of coding expansion factors is equal to a product of a power of two and an odd number.

3. The method of claim 1, wherein each value in the set of coding expansion factors is equal to a product of a positive integer and a prime number.

4. The method of claim 1, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number comprises one of:

3, 5, or 7.

5. The method of claim 1, wherein the set of the coding expansion factors includes at least 6, 12, 24, 48, 96, 192, and 384.

6. The method of claim 1, wherein the set of the coding expansion factors includes at least 10, 20, 40, 80, 160, and 320.

7. The method of claim 1, wherein the set of the coding expansion factors includes at least 14, 28, 56, 112, and 224.

8. The method of claim 1, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number includes 11 or 13.

9. An apparatus for digital communications, comprising:

an obtaining module configured to obtain a code block size for Low Density Parity Check (LDPC) coding;

a determining module configured to 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 set of coding expansion factors includes a set of natural numbers; and

a processing module configured to encode or decode a data sequence based on the basic check matrix and the coding expansion factor z,

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, and wherein kb is equal to nb minus mb.

10. The apparatus of claim 9, wherein each value in the set of coding expansion factors is equal to a product of a power of two and an odd number.

11. The apparatus of claim 9, wherein each value in the set of coding expansion factors is equal to a product of a positive integer and a prime number.

12. The apparatus of claim 9, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number comprises one of:

3, 5, or 7.

13. The apparatus of claim 9, wherein the set of the coding expansion factors includes at least 6, 12, 24, 48, 96, 192, and 384.

14. The apparatus of claim 9, wherein the set of the coding expansion factors includes at least 10, 20, 40, 80, 160, and 320.

15. The apparatus of claim 9, wherein the set of the coding expansion factors includes at least 14, 28, 56, 112, and 224.

16. The apparatus of claim 9, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number includes 11 or 13.

17. 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:

obtaining 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 set of coding expansion factors includes a set of natural numbers; and

encoding or decoding a data sequence based on the basic check matrix and the coding expansion factor z,

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, and wherein kb is equal to nb minus mb.

18. The non-transitory computer readable medium of claim 17, wherein each value in the set of coding expansion factors is equal to a product of a power of two and an odd number.

19. The non-transitory computer readable medium of claim 17, wherein each value in the set of coding expansion factors is equal to a product of a positive integer and a prime number.

20. The non-transitory computer readable medium of claim 17, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number comprises one of:

3, 5, or 7.

21. The non-transitory computer readable medium of claim 17, wherein the set of the coding expansion factors includes at least 6, 12, 24, 48, 96, 192, and 384.

22. The non-transitory computer readable medium of claim 17, wherein the set of the coding expansion factors includes at least 10, 20, 40, 80, 160, and 320.

23. The non-transitory computer readable medium of claim 17, wherein the set of the coding expansion factors includes at least 14, 28, 56, 112, and 224.

24. The non-transitory computer readable medium of claim 17, wherein each value in the set of the coding expansion factors is equal to a product of a positive integer and a prime number, wherein the positive integer is a power of two, and the prime number includes 11 or 13.