# US 2025/0062857 A1 · Fast converging low-density parity-check techniques

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

- Number: US 2025/0062857 A1
- Document ID: US20250062857A1
- Status: Published application
- Kind: A1
- Application number: 18/450,280
- Filed: 2023-08-15
- Published: 2025-02-20
- Earliest claimed: 2023-08-15
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Pinar SEN; Wei YANG; Jing JIANG; Gabi SARKIS; Thomas Joseph RICHARDSON
- Web page: https://patentgrep.com/patent/US20250062857A1

## CPC

- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/1168: {wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/6362: {by puncturing}
- H03M 13/6368: {using rate compatible puncturing or complementary puncturing}
- H03M 13/6393: {Rate compatible low-density parity check [LDPC] codes}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

Methods, systems, and devices for wireless communications are described. A transmitting device may perform a lifting procedure on a base graph including multiple variable nodes and multiple check nodes to obtain a lifted graph. The lifting procedure may include replacing each edge between multiple variable nodes and multiple check nodes of the base graph with a respective identity matrices with respective circular shift values. The base graph may include a punctured variable node which corresponds to each of one or more check nodes of the plurality of check nodes via multiple edges. The transmitting device may encode multiple information nodes and multiple parity nodes according to the lifted graph. The transmitting device may transmit a signal including multiple information bits and multiple parity bits based on encoding the multiple information nodes and the multiple parity nodes.

## Claims

### Claim 1

A transmitting device, comprising:
one or more memories storing processor-executable code; and
one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the transmitting device to:
perform a lifting procedure on a base graph comprising a plurality of variable nodes and a plurality of check nodes to obtain a lifted graph based at least in part on replacing each edge between the plurality of variable nodes and the plurality of check nodes of the base graph with a respective plurality of identity matrices with respective circular shift values, wherein a punctured variable node of the plurality of variable nodes corresponds to each of one or more check nodes of the plurality of check nodes via a plurality of edges;
encode a plurality of information nodes and a plurality of parity nodes according to the lifted graph; and
transmit a signal comprising a plurality of information bits and a plurality of parity bits based at least in part on encoding the plurality of information nodes and the plurality of parity nodes.

### Claim 2 (depends on 1)

The transmitting device of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the transmitting device to:
select a size for the lifted graph based at least in part on a quantity of coded bits satisfying a threshold quantity of bits.

### Claim 3 (depends on 1)

The transmitting device of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the transmitting device to:
remove one or more edges from the plurality of edges based at least in part on a quantity of coded bits satisfying a threshold quantity of bits, wherein replacing each edge between the plurality of variable nodes and the plurality of check nodes is based at least in part on removing the one or more edges from the plurality of edges.

### Claim 4 (depends on 1)

The transmitting device of claim 1, wherein the base graph comprises a single punctured node, and the punctured variable node is the single punctured node.

### Claim 5 (depends on 1)

The transmitting device of claim 1, wherein, to encode the plurality of information nodes and the plurality of parity nodes, the one or more processors are individually or collectively operable to execute the code to cause the transmitting device to:
replace the plurality of edges between the punctured variable node and the one or more check nodes with a summation of a respective plurality of identity matrices with respective circular shift values.

### Claim 6 (depends on 1)

The transmitting device of claim 1, wherein a size of the lifted graph is based at least in part on a codeblock length and a length of the base graph.

### Claim 7 (depends on 1)

The transmitting device of claim 1, wherein, to perform the lifting procedure, the one or more processors are individually or collectively operable to execute the code to cause the transmitting device to:
generate multiple copies of the base graph that are connected via edge permutation based at least in part on replacing each edge between the plurality of variable nodes and the plurality of check nodes with the respective plurality of identity matrices with respective circular shift values.

### Claim 8 (depends on 1)

The transmitting device of claim 1, wherein, to perform the lifting procedure, the one or more processors are individually or collectively operable to execute the code to cause the transmitting device to:
determine, from a table, the respective circular shift values of the respective plurality of identity matrices for each edge of the base graph.

### Claim 9 (depends on 8)

The transmitting device of claim 8, wherein the table includes a plurality of circular shift values for each identity matrix applied to the plurality of edges associated with the punctured variable node.

### Claim 10 (depends on 8)

The transmitting device of claim 8, wherein the table includes a singular value indicative of a plurality of circular shift values for each identity matrix applied to the plurality of edges associated with the punctured variable node based at least in part on a size of the lifted graph.

### Claim 11 (depends on 1)

The transmitting device of claim 1, wherein, to encode the plurality of information nodes and the plurality of parity nodes, the one or more processors are individually or collectively operable to execute the code to cause the transmitting device to:
encode the plurality of information nodes and the plurality of parity nodes in accordance with a second degree encoding chain and a first degree hybrid automatic repeat request (HARQ) extension.

### Claim 12 (depends on 1)

The transmitting device of claim 1, wherein a core portion of the base graph comprises a higher density of double edges to check nodes than an extension portion of the base graph.

### Claim 13 (depends on 12)

The transmitting device of claim 12, wherein the extension portion of the base graph comprises a higher density of single edges to check nodes than the core portion of the base graph.

### Claim 14

A receiving device, comprising:
one or more memories storing processor-executable code; and
one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the receiving device to:
receive a signal comprising a plurality of information bits and a plurality of parity bits corresponding to a low-density parity-check code;
generate the low-density parity-check code according to a lifted graph comprising multiple connected copies of a base graph based at least in part on a lifting procedure, the base graph comprising a plurality of variable nodes and a plurality of check nodes, wherein a punctured variable node of the plurality of variable nodes corresponds to each of one or more check nodes of the plurality of check nodes via a plurality of edges; and
decode the plurality of information bits based at least in part on the plurality of parity bits, a plurality of information nodes, and a plurality of parity nodes, the plurality of information nodes and the plurality of parity nodes corresponding to the base graph.

### Claim 15 (depends on 14)

The receiving device of claim 14, wherein, to decode the plurality of information bits, the one or more processors are individually or collectively operable to execute the code to cause the receiving device to:
decode a first set of information bits associated with a first set of information nodes of the plurality of information nodes based at least in part on the first set of information nodes having a single edge and a first degree of edges; and
decode, after the first set of information bits, a second set of information bits associated with a second set of information nodes of the plurality of information nodes having a single edge and a second degree of edges that is greater than the first degree of edges.

### Claim 16 (depends on 14)

The receiving device of claim 14, wherein, to decode the plurality of information bits, the one or more processors are individually or collectively operable to execute the code to cause the receiving device to:
decode a first set of information bits associated with a first check node that is connected to the punctured variable node via a single edge; and
decode, after the first set of information bits, a second set of information bits associated with a second check node of the one or more check nodes that are connected to the punctured variable node via the plurality of edges.

### Claim 17 (depends on 14)

The receiving device of claim 14, wherein the one or more processors are individually or collectively further operable to execute the code to cause the receiving device to:
identify the base graph based at least in part on a quantity of coded bits satisfying a threshold quantity of bits.

### Claim 18 (depends on 14)

The receiving device of claim 14, wherein the one or more processors are individually or collectively further operable to execute the code to cause the receiving device to:
identify one or more edges are removed from the plurality of edges based at least in part on a quantity of coded bits satisfying a threshold quantity of bits, wherein decoding the plurality of information bits is based at least in part on the one or more edges being removed from the plurality of edges.

### Claim 19 (depends on 14)

The receiving device of claim 14, wherein the base graph comprises a single punctured node, and the punctured variable node is the single punctured node.

### Claim 20 (depends on 14)

The receiving device of claim 14, wherein the multiple connected copies of the base graph are connected via edge permutation based at least in part on each edge between the plurality of variable nodes and the plurality of check nodes being replaced with a respective plurality of identity matrices with respective circular shift values.

### Claim 21 (depends on 14)

The receiving device of claim 14, wherein a core portion of the base graph comprises a higher density of double edges to check nodes than an extension portion of the base graph.

### Claim 22 (depends on 21)

The receiving device of claim 21, wherein the extension portion of the base graph comprises a higher density of single edges to check nodes than the core portion of the base graph.

### Claim 23

A method for wireless communications at a transmitting device, comprising:
performing a lifting procedure on a base graph comprising a plurality of variable nodes and a plurality of check nodes to obtain a lifted graph based at least in part on replacing each edge between the plurality of variable nodes and the plurality of check nodes of the base graph with a respective plurality of identity matrices with respective circular shift values, wherein a punctured variable node of the plurality of variable nodes corresponds to each of one or more check nodes of the plurality of check nodes via a plurality of edges;
encoding a plurality of information nodes and a plurality of parity nodes according to the lifted graph; and
transmitting a signal comprising a plurality of information bits and a plurality of parity bits based at least in part on encoding the plurality of information nodes and the plurality of parity nodes.

### Claim 24 (depends on 23)

The method of claim 23, further comprising:
selecting a size for the lifted graph based at least in part on a quantity of coded bits satisfying a threshold quantity of bits.

### Claim 25 (depends on 23)

The method of claim 23, further comprising:
removing one or more edges from the plurality of edges based at least in part on a quantity of coded bits satisfying a threshold quantity of bits, wherein replacing each edge between the plurality of variable nodes and the plurality of check nodes is based at least in part on removing the one or more edges from the plurality of edges.

### Claim 26 (depends on 23)

The method of claim 23, wherein the base graph comprises a single punctured node, and the punctured variable node is the single punctured node.

### Claim 27 (depends on 23)

The method of claim 23, wherein encoding the plurality of information nodes and the plurality of parity nodes comprises:
replacing the plurality of edges between the punctured variable node and the one or more check nodes with a summation of a respective plurality of identity matrices with respective circular shift values.

### Claim 28 (depends on 23)

The method of claim 23, wherein a size of the lifted graph is based at least in part on a codeblock length and a length of the base graph.

### Claim 29 (depends on 23)

The method of claim 23, wherein performing the lifting procedure comprises:
generating a multiple copies of the base graph that are connected via edge permutation based at least in part on replacing each edge between the plurality of variable nodes and the plurality of check nodes with the respective plurality of identity matrices.

### Claim 30

A method for wireless communications at a receiving device, comprising:
receiving a signal comprising a plurality of information bits and a plurality of parity bits corresponding to a low-density parity-check code;
generate the low-density parity-check code according to a lifted graph comprising multiple connected copies of a base graph based at least in part on a lifting procedure, the base graph comprising a plurality of variable nodes and a plurality of check nodes, wherein a punctured variable node of the plurality of variable nodes corresponds to each of one or more check nodes of the plurality of check nodes via a plurality of edges; and
decode the plurality of information bits based at least in part on the plurality of parity bits, a plurality of information nodes, and a plurality of parity nodes, the plurality of information nodes and the plurality of parity nodes corresponding to the base graph.
