# US 12,192,129 B2 · Data parsing to support resource unit aggregation

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

- Number: US 12,192,129 B2
- Document ID: US12192129B2
- Status: Granted
- Kind: B2
- Application number: 18/448,033
- Filed: 2023-08-10
- Published: 2024-06-06
- Granted: 2025-01-07
- Earliest claimed: 2019-03-22
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Lin Yang; Bin Tian; Sameer Vermani
- Web page: https://patentgrep.com/patent/US12192129B2

## CPC

- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L 1/0013: {Rate matching, e.g. puncturing or repetition of code symbols}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04L 5/0042: {Intra-user or intra-terminal allocation}
- H04L 27/2602: {Signal structure}
- H04L 27/2605: {Symbol extensions, e.g. Zero Tail, Unique Word [UW]}
- H04W 4/00: Services specially adapted for wireless communication networks; Facilities therefor
- H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA
- H04W 72/0466: {the resource being a scrambling code}
- H04W 80/02: Data link layer protocols
- H04W 80/08: Upper layer protocols {(network arrangements or communication protocols for networked applications H04L67/00)}
- H04L 27/2603: {Signal structure ensuring backward compatibility with legacy system}
- H04W 4/027: {using movement velocity, acceleration information}
- H04W 4/70: Services for machine-to-machine communication [M2M] or machine type communication [MTC]
- H04W 4/80: Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

This disclosure provides methods, devices and systems for data parsing for resource unit (RU) aggregation. A wireless communication device (such as an access point (AP) or a station (STA)) may allocate a set of RUs for a receiving device in a basic service set (BSS). The set of RUs may be associated with multiple bandwidth segments of a bandwidth allocation and may be non-contiguous or contiguous. The wireless communication device may determine a data parsing and encoding scheme for a set of information bits. The data parsing may be implemented at a medium access control (MAC) layer or physical (PHY) layer and the encoding may correspond to a joint encoding or a separate encoding for each RU of the allocation. The wireless communication device may then distribute the coded bits to the set of RUs for transmission.

## Claims

### Claim 1

An apparatus for wireless communication, comprising:
one or more memories storing code; and
one or more processors coupled with the one or more memories and operable to execute the code to cause the apparatus to:
encode at least a set of information bits;
parse the set of encoded information bits into one or more spatial streams;
distribute encoded information bits of the one or more spatial streams to a plurality of resource units in accordance with a round robin process, the distribution being based at least in part on a cyclical distribution of respective pluralities of the encoded information bits proportional to available resources of the plurality of resource units; and
output, via the plurality of resource units, the encoded information bits.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the one or more processors are further operable to execute the code to cause the apparatus to:
generate a data payload comprising at least one of the set of information bits, a set of service bits or a set of padding bits, wherein at least one of the encoding, the parsing, or the distribution are associated with the data payload.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the one or more processors are further operable to execute the code to cause the apparatus to:
obtain a resource unit allocation that indicates the plurality of resource units.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the one or more processors are further operable to execute the code to cause the apparatus to:
perform low-density parity-check tone mapping for resource units of the plurality of resource units.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein the one or more processors are further operable to execute the code to cause the apparatus to:
perform bit interleaving with binary convolution coding for resource units of the plurality of resource units.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein, to output the encoded information bits, the one or more processors are operable to execute the code to cause the apparatus to:
output a physical layer convergence protocol (PLCP) protocol data unit (PPDU) comprising the encoded information bits.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein the distribution comprises:
distributing a first bit of the encoded information bits to a first resource unit of the plurality of resource units and a second bit of the encoded information bits to an additional resource unit of the plurality of resource units.

### Claim 8 (depends on 7)

The apparatus of claim 7, wherein the first resource unit is full based at least in part on a first quantity of available resources of the first resource unit, and the one or more processors are further operable to execute the code to cause the apparatus to:
distribute remaining bits of the encoded information bits to one or more additional resource units of the plurality of resource units based at least in part on the first resource unit being full.

### Claim 9 (depends on 1)

The apparatus of claim 1, wherein a first resource unit of the plurality of resource units is non-contiguous in a frequency band with a second resource unit of the plurality of resource units.

### Claim 10

A method for wireless communication at a wireless communication device, comprising:
encoding at least a set of information bits;
parsing the set of encoded information bits into one or more spatial streams;
distributing encoded information bits of the one or more spatial streams to a plurality of resource units in accordance with a round robin process, the distribution being based at least in part on a cyclical distribution of respective pluralities of the encoded information bits proportional to available resources of the plurality of resource units; and
outputting, via the plurality of resource units, the encoded information bits.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
generating a data payload comprising at least one of the set of information bits, a set of service bits, or a set of padding bits, wherein at least one of the encoding, the parsing, or the distribution are associated with the data payload.

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
obtaining a resource unit allocation that indicates the plurality of resource units.

### Claim 13 (depends on 10)

The method of claim 10, further comprising:
performing low-density parity-check tone mapping for resource units of the plurality of resource units.

### Claim 14 (depends on 10)

The method of claim 10, further comprising:
performing bit interleaving with binary convolution coding for resource units of the plurality of resource units.

### Claim 15 (depends on 10)

The method of claim 10, wherein a first resource unit of the plurality of resource units is non-contiguous in a frequency band with a second resource unit of the plurality of resource units.

### Claim 16

A wireless communication device, comprising:
a transceiver;
one or more memories storing code; and
one or more processors coupled with the one or more memories and operable to execute the code to cause the wireless communication device to:
encode at least a set of information bits;
parse the set of encoded information bits into one or more spatial streams;
distribute encoded information bits of the one or more spatial streams to a plurality of resource units in accordance with a round robin process, the distribution being based at least in part on a cyclical distribution of respective pluralities of the encoded information bits proportional to available resources of the plurality of resource units; and
transmit, via the transceiver and the plurality of resource units, the encoded information bits.

### Claim 17 (depends on 16)

The wireless communication device of claim 16, wherein the one or more processors are further operable to execute the code to cause the wireless communication device to:
generate a data payload comprising at least one of the set of information bits, a set of service bits, or a set of padding bits, wherein at least one of the encoding, the parsing, or the distribution are associated with the data payload.

### Claim 18 (depends on 16)

The wireless communication device of claim 16, wherein the one or more processors are further operable to execute the code to cause the wireless communication device to:
receive, via the transceiver, a resource unit allocation that indicates the plurality of resource units.

### Claim 19 (depends on 16)

The wireless communication device of claim 16, wherein the one or more processors are further operable to execute the code to cause the wireless communication device to:
perform low-density parity-check tone mapping for resource units of the plurality of resource units.

### Claim 20 (depends on 16)

The wireless communication device of claim 16, wherein the one or more processors are further operable to execute the code to cause the wireless communication device to:
perform bit interleaving with binary convolution coding for resource units of the plurality of resource units.
