IP Library › Granted Patent US 11,683,051
Granted Patent B2
US 11,683,051 · App. 17/493,612 · Granted Jun 20, 2023

Method and apparatus for data processing with structured LDPC codes

Inventors: Liguang Li (Guangdong, CN); Jun Xu (Guangdong, CN); Jin Xu (Guangdong, CN)
Assignee: ZTE Corporation
H03M13/1148H03M13/00H03M13/11H03M13/114H03M13/116H03M13/1137H03M13/1185H03M13/2906H03M13/616H03M13/6356H03M13/6516H03M13/09
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,683,051
App. No.
17/493,612
Granted
Jun 20, 2023
Kind
B2
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 (24)

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 is an integer larger than or equal to four and smaller than or equal to 64, and wherein the coding expansion factor Z is equal to a positive integer power of two minus one or a product of a positive integer power of two and a prime number; and

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

2. The method of claim 1 , wherein the prime number comprises one of: 3, 5, 7, 11, or 13.

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

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

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

6. An apparatus for digital communications, comprising a processor that is configured 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 is an integer larger than or equal to four and smaller than or equal to 64, and wherein the coding expansion factor Z is equal to a positive integer power of two minus one or a product of a positive integer power of two and a prime number; and

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

7. The apparatus of claim 6 , wherein the prime number comprises one of: 3, 5, 7, 11, or 13.

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

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

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

11. 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 is an integer larger than or equal to four and smaller than or equal to 64, and wherein the coding expansion factor Z is equal to a positive integer power of two minus one or a product of a positive integer power of two and a prime number; and

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

12. The non-transitory computer readable medium of claim 11 , wherein the prime number comprises one of: 3, 5, 7, 11, or 13.

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

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

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

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2021
From: LI, LIGUANG; XU, JUN; XU, JIN
To: ZTE CORPORATION
Reel/Frame 057696/0495 →
Priority Claims (2)
CN 201610322409.4 · May 13, 2016 · national
CN 201610879343.9 · Sep 30, 2016 · national
Continuity (4)
Continuation 16730962 · Dec 30, 2019
Continuation 16171314 · Oct 25, 2018
Continuation PCTCN2016104744 · Nov 4, 2016
Related Publication 20220038115A1 · Feb 3, 2022
Cited By (2)
US 51,040 US 12,640,842