# US 2025/0330201 A1 · Enhanced design and use of longer low-density parity-check wi-fi codewords

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

- Number: US 2025/0330201 A1
- Document ID: US20250330201A1
- Status: Published application
- Kind: A1
- Application number: 18/870,773
- Filed: 2022-07-01
- Published: 2025-10-23
- Earliest claimed: 2022-07-01
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Xiaogang CHEN; Thomas J. KENNEY; Qinghua LI; Hao SONG; Robert STACEY
- Web page: https://patentgrep.com/patent/US20250330201A1

## CPC

- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/255: {with 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/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/6393: {Rate compatible low-density parity check [LDPC] codes}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0063: {Single parity check}
- 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

This disclosure describes systems, methods, and devices related to for low-density parity-check (LDPC) Wi-Fi coding and decoding. A device may identify a first base matrix to generate LDPC codewords of 1944 bits; identify a mask matrix to generate a second base matrix based on the first base matrix used to generate LDPC codewords of 3888 bits, the entries of the mask matrix having values of 0, 1, and −1; generate the second base matrix by multiplying each the first base matrix by the mask matrix, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix; generate a parity check matrix by multiplying the second base matrix by the identity matrix; generate a LDPC codeword of 3888 bits based on the parity check matrix; and transmit a frame including the LDPC codeword.

## Claims

### Claim 1

An apparatus of a device for low-density parity-check (LDPC) Wi-Fi coding and decoding, the apparatus comprising processing circuitry coupled to storage, the processing circuitry configured to:
identify a first base matrix associated with generating LDPC codewords of 1944 bits, the first base matrix consisting of four rows and 24 columns;
identify a mask matrix associated with generating a second base matrix based on the first base matrix, the mask matrix consisting of four rows and 24 columns, the entries of the mask matrix consisting of values of 0, 1, and −1, and the second base matrix associated with generating LDPC codewords of 3888 bits;
generate the second base matrix by multiplying each entry of the first base matrix by each entry of the mask matrix, the second base matrix consisting of eight rows and 48 columns, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix consisting of 81 rows and 81 columns;
generate a parity check matrix by multiplying each entry of the second base matrix by each entry of the identity matrix, the parity check matrix consisting of 648 rows and 3888 columns;
generate a LDPC codeword consisting of 3888 bits based on the parity check matrix; and
cause the device to transmit a frame comprising the LDPC codeword.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein to multiply each entry of the first base matrix by each entry of the mask matrix comprises:
for an entry of x applied to an entry of 0, to generate a first 2×2 matrix of x and −1 in a first row and −1 and x in a second row,
for an entry of x applied to an entry of 1, to generate a second 2×2 matrix of −1 and x in a first row and x and −1 in a second row, and
for an entry of −1 applied to an entry of −1, to generate a third 2×2 matrix of −1 and −1 in a first row, and −1 and −1 in a second row.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein for a code rate of 5/6, a first row of the mask matrix is [0 0 0 0 0 0 0 0 0 0 0 0 −1 0 0 0 0 0 0 −1 0 0 −1 −1].

### Claim 4 (depends on 3)

The apparatus of claim 3, wherein a second row of the mask matrix is [1 1 1 1 1 1 1 1 1 1 1 −1 1 −1 1 1 1 1 0 0 −1 0 0 −1].

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein a third row of the mask matrix is [0 0 0 0 0 0 0 0 0 0 0 0 0 0 −1 0 −1 0 −1 0 0 −1 0 0].

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein for a code rate of 3/4, a first row of the mask matrix is [0 0 0 0 0 0 −1 −1 −1 0 0 0 −1 −1 −1 0 0 0 0 0 −1 −1 −1 −1].

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein a second row of the mask matrix is [1 1 1 1 1 1 −1 −1 −1 1 1 1 1 1 −1 1 −1 −1 −1 0 0 −1 −1 −1].

### Claim 8 (depends on 7)

The apparatus of claim 7, wherein a third row of the mask matrix is [0 0 0 0 0 0 0 −1 0 0 −1 −1 −1 0 0 −1 −1 0 −1 −1 0 0 −1 −1].

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein a fourth row of the mask matrix is [1 1 1 1 1 1 1 1 −1 −1 −1 1 −1 −1 −1 1 1 0 −1 −1 0 0 −1].

### Claim 10

(canceled)

### Claim 11

(canceled)

### Claim 12 (depends on 1)

The apparatus of claim 1, wherein the frame comprises a symbol of 94080 bits, the symbol comprising 48 LDPC codewords comprising the LDPC codeword.

### Claim 13

A non-transitory computer-readable storage medium comprising instructions to cause processing circuitry of a device for low-density parity-check (LDPC) Wi-Fi coding and decoding, upon execution of the instructions by the processing circuitry, to:
identify a first base matrix associated with generating LDPC codewords of 1944 bits, the first base matrix consisting of four rows and 24 columns;
identify a mask matrix associated with generating a second base matrix based on the first base matrix, the mask matrix consisting of four rows and 24 columns, the entries of the mask matrix consisting of values of 0, 1, and −1, and the second base matrix associated with generating LDPC codewords of 3888 bits;
generate the second base matrix by multiplying each entry of the first base matrix by each entry of the mask matrix, the second base matrix consisting of eight rows and 48 columns, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix consisting of 81 rows and 81 columns;
generate a parity check matrix by multiplying each entry of the second base matrix by each entry of the identity matrix, the parity check matrix consisting of 648 rows and 3888 columns;
generate a LDPC codeword consisting of 3888 bits based on the parity check matrix; and
cause the device to transmit a frame comprising the LDPC codeword.

### Claim 14 (depends on 13)

The non-transitory computer-readable medium of claim 13, wherein to multiply each entry of the first base matrix by each entry of the mask matrix comprises:
for an entry of x applied to an entry of 0, to generate a first 2×2 matrix of x and −1 in a first row and −1 and x in a second row,
for an entry of x applied to an entry of 1, to generate a second 2×2 matrix of −1 and x in a first row and x and −1 in a second row, and
for an entry of −1 applied to an entry of −1, to generate a third 2×2 matrix of −1 and −1 in a first row, and −1 and −1 in a second row.

### Claim 15 (depends on 13)

The non-transitory computer-readable medium of claim 13, wherein for a code rate of 5/6, a first row of the mask matrix is [0 0 0 0 0 0 0 0 0 0 0 0 −1 0 0 0 0 0 −1 0 0 −1 −1].

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein a second row of the mask matrix is [1 1 1 1 1 1 1 1 1 1 1 −1 1 −1 1 1 1 1 0 0 −1 0 0 −1].

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein a third row of the mask matrix is [0 0 0 0 0 0 0 0 0 0 0 0 0 0 −1 0 −1 0 −1 0 0 −1 0 0].

### Claim 18 (depends on 13)

The non-transitory computer-readable medium of claim 13, wherein for a code rate of 3/4, a first row of the mask matrix is [0 0 0 0 0 0 −1 −1 −1 0 0 0 −1 −1 −1 0 0 0 0 0 −1 −1 −1 −1].

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein a second row of the mask matrix is [1 1 1 1 1 1 −1 −1 −1 1 1 1 1 1 −1 1 −1 −1 −1 0 0 −1 −1 −1].

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein a third row of the mask matrix is [0 0 0 0 0 0 0 −1 0 0 −1 −1 −1 0 0 −1 −1 0 −1 −1 0 0 −1 −1].

### Claim 21 (depends on 20)

The non-transitory computer-readable medium of claim 20, wherein a fourth row of the mask matrix is [1 1 1 1 1 1 1 1 −1 −1 −1 1 −1 −1 −1 1 1 0 −1 −1 0 0 −1].

### Claim 22

(canceled)

### Claim 23

(canceled)

### Claim 24

A method for low-density parity-check (LDPC) Wi-Fi coding and decoding, the method comprising:
identifying, by processing circuitry of a device, a first base matrix associated with generating LDPC codewords of 1944 bits, the first base matrix consisting of four rows and 24 columns;
identifying, by the processing circuitry, a mask matrix associated with generating a second base matrix based on the first base matrix, the mask matrix consisting of four rows and 24 columns, the entries of the mask matrix consisting of values of 0, 1, and −1, and the second base matrix associated with generating LDPC codewords of 3888 bits;
generating, by the processing circuitry, the second base matrix by multiplying each entry of the first base matrix by each entry of the mask matrix, the second base matrix consisting of eight rows and 48 columns, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix consisting of 81 rows and 81 columns;
generating, by the processing circuitry, a parity check matrix by multiplying each entry of the second base matrix by each entry of the identity matrix, the parity check matrix consisting of 648 rows and 3888 columns;
generating, by the processing circuitry, a LDPC codeword consisting of 3888 bits based on the parity check matrix; and
causing, by the processing circuitry, the device to transmit a frame comprising the LDPC codeword.

### Claim 25

(canceled)
