# US 2026/0254562 A1 · LDPC Code-Based Communication Method and Communication Apparatus

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0254562 A1
- Document ID: US20260254562A1
- Status: Published application
- Kind: A1
- Application number: 19/540,260
- Filed: 2026-02-13
- Published: 2026-08-27
- Earliest claimed: 2023-08-14
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Ke Liu; Huazi Zhang; Jiajie Tong; Xianbin Wang; Jun Wang
- Web page: https://patentgrep.com/patent/US20260254562A1

## CPC

- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H04L 1/0063: {Single parity check}
- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/11: using multiple parity bits
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/618: {Shortening and extension of codes}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M 13/1117: {using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule}
- H03M 13/1188: {wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three}
- H03M 13/27: using interleaving techniques
- H03M 13/6362: {by puncturing}
- H03M 13/6393: {Rate compatible low-density parity check [LDPC] codes}
- H03M 13/6561: {Parallelized implementations}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In an LDPC code-based communication method, through row grouping and column grouping, an LDPC base matrix may be divided into a plurality of units of a same scale. The plurality of units include three types: a first unit, a second unit, and a third unit. A column weight of each column of the first unit is 1. A column weight of at least one column of the second unit is 1, and a column weight of a remaining column is 0. A column weight of each column of the third unit is 0. None of the column weights of the columns of the first unit, the second unit, and the third unit is greater than 1.

## Claims

### Claim 1

A method comprising:
obtaining an information bit sequence;
performing low-density parity check (LDPC) encoding on the information bit sequence based on a first base matrix to obtain a first LDPC codeword sequence, wherein a (q×(i−1)+1)th row to a (q×i)th row of a first part of the first base matrix comprise Mi first units, Fi second units, and Gi third units, wherein the first part is a matrix region comprising a 1st column to an xth column of the first base matrix, wherein each of the first Mi first units is a first matrix comprising q first rows and k first columns, wherein all of the k first columns have a first column weight of 1, wherein each of the Fi second units is a second matrix comprising q second rows and k second columns, wherein at least one column of the k second columns has the first column weight and the k second columns other than the at least one column have a second column weight of 0, wherein each of the Gi third units is a third matrix comprising q third rows and k third columns, wherein all of the k third columns have the first column weight, wherein i, q, and Mi are positive integers, wherein x and k are integers greater than or equal to 2, and wherein Fi and Gi are nonnegative integers; and
outputting a second LDPC codeword sequence based on the first LDPC codeword sequence.

### Claim 2 (depends on 1)

The method of claim 1, wherein outputting the second LDPC codeword sequence comprises:
performing interleaving between a second part that is in the first LDPC codeword sequence and that corresponds to an information column of the first base matrix and a third part that is in the first LDPC codeword sequence and that corresponds to a kernel check column of the first base matrix to obtain the second LDPC codeword sequence, wherein the interleaving is at a granularity of columns whose quantity is a lifting value, and wherein a second quantity of the Fi second units comprised in a second base matrix corresponding to the second LDPC codeword sequence is less than a first quantity of the Fi second units comprised in the first base matrix; and
outputting the second LDPC codeword sequence.

### Claim 3

A method comprising:
receiving a second LDPC codeword sequence; and
decoding the second LDPC codeword sequence based on a base matrix,
wherein a (q×(i−1)+1)th row to a (q×i)th row of a first part of the base matrix comprise Mi first units, Fi second units, and Gi third units,
wherein the first part is a first matrix region comprising a 1st column to an xth column of the base matrix,
wherein each of the Mi first units is a first matrix comprising q first rows and k first columns,
wherein all of the k first columns have a first column weight of 1,
wherein each of the Fi second units is a second matrix comprising q second rows and k second columns,
wherein at least one column of the k second columns has the first column weight and the k second columns other than the at least one column have a second column weight of 0,
wherein each of the Gi third units is a third matrix comprising q third rows and k third columns,
wherein all of the k third columns have the first column weight,
wherein i, q, and Mi are positive integers,
wherein x and k are integers greater than or equal to 2, and
wherein Fi and Gi are nonnegative integers.

### Claim 4 (depends on 3)

The method of claim 3, wherein decoding the second LDPC codeword sequence comprises:
performing column transformation between an information column and a kernel check column of the base matrix to obtain a transformed base matrix, wherein the column transformation is at a granularity of columns whose quantity is a lifting value, and wherein a first quantity of the Fi second units comprised in the base matrix obtained through the column transformation is less than a second quantity of the Fi second units comprised in the base matrix on which the column transformation is not performed; and
decoding the second LDPC codeword sequence based on the transformed base matrix.

### Claim 5 (depends on 3)

The method of claim 3, wherein Fi1 is greater than Fi2 wherein i1 is less than i2, wherein Fi1 is a value of Fi when i=i1, and wherein Fi2 is a value of Fi when i=i2.

### Claim 6 (depends on 3)

The method of claim 3, wherein a value range of i comprises a consecutive subranges, wherein same subranges of the consecutive subranges correspond to a same Fi, and wherein Fi decreases in order of the consecutive subranges.

### Claim 7 (depends on 6)

The method of claim 6, wherein is Fi is greater than 0 when i is less than a first value, and wherein Fi is 0 when i is greater than or equal to the first value.

### Claim 8 (depends on 6)

The method of claim 6, wherein Fi is a less than or equal a threshold Vi, wherein Vi is 2 when i is less than a second value, 1 when i is greater than or equal to the second value and less than a third value, and 0 when i is greater than or equal to the third value.

### Claim 9 (depends on 3)

The method of claim 3, wherein the Mi first units, the Fi second units, and the Gi third units are comprised in a non-punctured information column in the 1st column to the xth column of the base matrix, an information column in the 1st column to the xth column of the base matric, or a non-punctured column in the 1st column to the xth column of the base matrix.

### Claim 10 (depends on 3)

The method of claim 3, wherein q=1.

### Claim 11 (depends on 10)

The method of claim 10, wherein a sum of shifting values of non-zero elements in the first unit is an integer multiple of a lifting value.

### Claim 12 (depends on 10)

The method of claim 10, wherein Fi is 0 when a target code rate is greater than a code rate threshold.

### Claim 13 (depends on 12)

The method of claim 12, wherein the code rate threshold is 0.96, 22/24, 22/25, or 22/26.

### Claim 14 (depends on 3)

The method of claim 3, wherein the base matrix comprises a punctured column, and wherein one of the Fi second units comprises the punctured column.

### Claim 15 (depends on 3)

The method of claim 3, wherein a second matrix region corresponding to a non-punctured information column of the base matrix does not comprise one of the Fi second units.

### Claim 16 (depends on 3)

The method of claim 3, wherein the first part comprises a subpart, wherein the subpart is a second matrix region comprising a 1st row to a uth row and a (y+1)th column to an xth column of the first part, wherein u is an integer greater than or equal to 1, wherein u−1=x−y−1, wherein y<x, wherein diagonal elements in the subpart are all non-zero elements, wherein the subpart comprises N blocks that are square matrices and comprise the diagonal elements, wherein one of the diagonal elements in each of the N blocks overlaps one of the diagonal elements in the subpart, wherein the N blocks do not overlap each other, wherein a part or all of the N blocks comprise rows, and wherein non-zero elements in at least two of the rows have a proper inclusion relationship.

### Claim 17 (depends on 16)

The method of claim 16, wherein the N blocks comprise N1 first blocks of size k×k and a second block of size k′×k′, wherein N1 is a positive integer, wherein k is a nonnegative integer, and wherein k′ is less than k.

### Claim 18 (depends on 16)

The method of claim 16, wherein each element other than the N blocks in the subpart is a zero element.

### Claim 19 (depends on 3)

The method of claim 3, wherein the first part comprises a subpart, wherein the subpart is a second matrix region comprising a 1st row to a uth row and a (y+1)th column to the xth column of the first part, wherein u is an integer greater than or equal to 1, wherein u−1=x−y−1, wherein y<x, wherein when u−1=x−y−1=3, first locations of zero elements in the subpart and second locations of non-zero elements in the subpart are shown in the following matrix:
[
1
1
0
0
1
0
0
0
1
]
,
wherein when u−1=x−y−1=4, the first locations and the second locations are shown in either of the following matrices:
[
1
1
0
0
0
1
0
0
0
0
1
1
0
0
0
1
]
⁢
or
[
1
1
1
0
0
1
1
0
0
0
1
0
0
0
0
1
]
,
wherein when u−1=x−y−1=5, the first locations and the second locations are shown in any one of the following matrices:
[
1
1
0
0
0
0
1
0
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
]
,
[
1
1
1
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
1
0
0
0
0
1
]
,
or
[
1
1
1
1
0
0
1
1
1
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
]
,
wherein 0 represents a zero element and 1 represents a non-zero element.

### Claim 20

A communication apparatus comprising:
one or more processors configured to:
obtain an information bit sequence;
perform low-density parity check (LDPC) encoding on the information bit sequence based on a first base matrix to obtain a first LDPC codeword sequence, wherein a (q×(i−1)+1)th row to a (q×i)th row of a first part of the first base matrix comprise Mi first units, Fi second units, and Gi third units, wherein the first part is a matrix region comprising a 1st column to an xth column of the first base matrix, wherein each of the Mi first units is a first matrix comprising q first rows and k first columns, wherein all of the k first columns have a first column weight of 1, wherein each of the Fi second units is a second matrix comprising q second rows and k second columns, wherein at least one column of the k second columns has the first column weight and the k second columns other than the at least one column have a second column weight of 0, wherein each of the Gi third units is a third matrix comprising q third rows and k third columns, wherein all of the k third columns have the first column weight, wherein i, q, and Mi are positive integers, wherein x and k are integers greater than or equal to 2, and wherein Fi and Gi are nonnegative integers; and
output a second LDPC codeword sequence based on the first LDPC codeword sequence.
