# US 12,184,412 B2 · Transport block over multiple slots coding chain

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

- Number: US 12,184,412 B2
- Document ID: US12184412B2
- Status: Granted
- Kind: B2
- Application number: 17/747,926
- Filed: 2022-05-18
- Published: 2023-03-30
- Granted: 2024-12-31
- Earliest claimed: 2021-09-30
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Runxin Wang; Gokul Sridharan; Hung Dinh Ly; Peter Gaal; Sanghoon Kim
- Web page: https://patentgrep.com/patent/US12184412B2

## CPC

- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0064: {Concatenated codes}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 5/0016: {Time-frequency-code}
- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals}
- H04L 5/0094: {Indication of how sub-channels of the path are allocated}
- H04L 25/03866: {using scrambling}
- H04W 28/04: Error control
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)}
- H04W 28/065: {using assembly or disassembly of packets}
- 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

A method of wireless communication at a user equipment (UE) includes receiving, from a network node, a message indicating slots for transmitting a transport block on a physical uplink shared channel (PUSCH). The method also includes segmenting the transport block into code blocks. The method further includes encoding the code blocks to produce encoded code blocks. Each code block may be encoded at a coding path from a group of coding paths associated with a coding chain. The method still further includes transmitting the encoded code blocks in the slots on the PUSCH.

## Claims

### Claim 1

A method of wireless communication at a user equipment (UE), comprising:
receiving, from a network node, a message indicating a plurality of slots for transmitting a transport block on a physical uplink shared channel (PUSCH);
segmenting the transport block into a plurality of code blocks;
encoding the plurality of code blocks to produce a plurality of encoded code blocks, each of the plurality of code blocks encoded at a respective coding path of a plurality of coding paths associated with a coding chain;
transmitting the plurality of encoded code blocks in the plurality of slots on the PUSCH; and
concatenating the plurality of encoded code blocks to generate a concatenated encoded code block; and segmenting the concatenated encoded code block based on a quantity of the plurality of slots.

### Claim 2 (depends on 1)

The method of claim 1, in which segmenting the transport block into the plurality of code blocks comprises:
segmenting the transport block into a plurality of sub-transport blocks based on a quantity of the plurality of slots, each slot of the plurality of slots corresponding to a set of sub-transport blocks of the plurality of sub-transport blocks; and
segmenting the plurality of sub-transport blocks into the plurality of code blocks.

### Claim 3 (depends on 2)

The method of claim 2, in which a size of each sub-transport block may be based on the quantity of the plurality of slots.

### Claim 4 (depends on 1)

The method of claim 1, further comprising segmenting the plurality of code blocks based on a quantity of the plurality of slots, such that each slot is associated with one or more different code blocks of the plurality of code blocks.

### Claim 5 (depends on 4)

The method of claim 4, in which the quantity of the plurality of code blocks is greater than the quantity of the plurality of slots.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
segmenting a bit sequence of each code block of the plurality of code blocks at the coding chain associated with the code block based on a quantity of the plurality of slots; and
concatenating, at a concatenation stage associated with each slot of the plurality of slots, a plurality of bit sequence segments to generate the concatenated plurality of bit sequence segments of each slot, each bit sequence segment of the plurality of bit sequence segments corresponding to a different code block.

### Claim 7 (depends on 6)

The method of claim 6, further comprising bit interleaving each bit sequence segment prior to concatenating the plurality of bit sequence segments.

### Claim 8 (depends on 6)

The method of claim 6, further comprising bit interleaving the concatenated plurality of bit sequence segments of each slot.

### Claim 9 (depends on 6)

The method of claim 6, further comprising bit interleaving the bit sequence of each code block prior to segmenting the bit sequence of each code block.

### Claim 10 (depends on 1)

The method of claim 1, further comprising scrambling each slot of the plurality of slots based on a different scrambling sequence.

### Claim 11 (depends on 1)

The method of claim 1, further comprising scrambling the plurality of slots based on a single scrambling sequence.

### Claim 12 (depends on 1)

The method of claim 1, further comprising bit interleaving the plurality of encoded code blocks prior to segmenting the concatenated encoded code block.

### Claim 13 (depends on 12)

The method of claim 12, further comprising bit interleaving each code block prior to concatenating the plurality of encoded code blocks.

### Claim 14 (depends on 1)

The method of claim 1, further comprising bit interleaving each segment of the concatenated encoded code block.

### Claim 15 (depends on 12)

The method of claim 12, further comprising bit interleaving each code block prior to concatenating the plurality of encoded code blocks.

### Claim 16

An apparatus for wireless communications at a user equipment (UE), comprising:
means for receiving, from a network node, a message indicating a plurality of slots for transmitting a transport block on a physical uplink shared channel (PUSCH);
means for segmenting the transport block into a plurality of code blocks;
means for encoding the plurality of code blocks to produce a plurality of encoded code blocks, each of the plurality of code blocks encoded at a respective coding path of a plurality of coding paths associated with a coding chain;
means for transmitting the plurality of encoded code blocks in the plurality of slots on the PUSCH;
means for concatenating the plurality of encoded code blocks to generate a concatenated encoded code block; and
means for segmenting the concatenated encoded code block based on a quantity of the plurality of slots.

### Claim 17 (depends on 16)

The apparatus of claim 16, in which the means for segmenting the transport block into the plurality of code blocks further comprises:
means for segmenting the transport block into a plurality of sub-transport blocks based on a quantity of the plurality of slots, each slot of the plurality of slots corresponding to a set of sub-transport blocks of the plurality of sub-transport blocks; and
means for segmenting the plurality of sub-transport blocks into the plurality of code blocks.

### Claim 18 (depends on 16)

The apparatus of claim 16, further comprising means for segmenting the plurality of code blocks based on a quantity of the plurality of slots, such that each slot is associated with one or more different code blocks of the plurality of code blocks.

### Claim 19 (depends on 16)

The apparatus of claim 16, further comprising:
means for segmenting a bit sequence of each code block of the plurality of code blocks at the coding chain associated with the code block based on a quantity of the plurality of slots; and
means for concatenating, at a concatenation stage associated with each slot of the plurality of slots, a plurality of bit sequence segments to generate the concatenated plurality of bit sequence segments of each slot, each bit sequence segment of the plurality of bit sequence segments corresponding to a different code block.

### Claim 20

An apparatus for wireless communications at a user equipment (UE), comprising:
a processor; and
a memory coupled with the processor and storing instructions operable, when executed by the processor, to cause the apparatus to:
receive, from a network node, a message indicating a plurality of slots for transmitting a transport block on a physical uplink shared channel (PUSCH);
segment the transport block into a plurality of code blocks;
encode the plurality of code blocks to produce a plurality of encoded code blocks, each of the plurality of code blocks encoded at a respective coding path of a plurality of coding paths associated with a coding chain;
transmit the plurality of encoded code blocks in the plurality of slots on the PUSCH;
concatenate the plurality of encoded code blocks to generate a concatenated encoded code block; and
segment the concatenated encoded code block based on a quantity of the plurality of slots.

### Claim 21 (depends on 20)

The apparatus of claim 20, in which execution of the instructions that cause the apparatus to segment the transport block into the plurality of code blocks further cause the apparatus to:
segment the transport block into a plurality of sub-transport blocks based on a quantity of the plurality of slots, each slot of the plurality of slots corresponding to a set of sub-transport blocks of the plurality of sub-transport blocks; and
segment the plurality of sub-transport blocks into the plurality of code blocks.

### Claim 22 (depends on 20)

The apparatus of claim 20, in which execution of the instructions further cause the apparatus to segment the plurality of code blocks based on a quantity of the plurality of slots, such that each slot is associated with one or more different code blocks of the plurality of code blocks.

### Claim 23 (depends on 20)

The apparatus of claim 20, in which execution of the instructions further cause the apparatus to:
segment a bit sequence of each code block of the plurality of code blocks at the coding chain associated with the code block based on a quantity of the plurality of slots; and
concatenate, at a concatenation stage associated with each slot of the plurality of slots, a plurality of bit sequence segments to generate the concatenated plurality of bit sequence segments of each slot, each bit sequence segment of the plurality of bit sequence segments corresponding to a different code block.

### Claim 24

A non-transitory computer-readable medium having program code recorded thereon for wireless communication at a user equipment (UE), the program code executed by a processor and comprising:
program code to receive, from a network node, a message indicating a plurality of slots for transmitting a transport block on a physical uplink shared channel (PUSCH);
program code to segment the transport block into a plurality of code blocks;
program code to encode the plurality of code blocks to produce a plurality of encoded code blocks, each of the plurality of code blocks encoded at a respective coding path of a plurality of coding paths associated with a coding chain;
program code to transmit the plurality of encoded code blocks in the plurality of slots on the PUSCH; and
program code to segment a bit sequence of each code block of the plurality of code blocks at the coding chain associated with the code block based on a quantity of the plurality of slots; and
program code to concatenate, at a concatenation stage associated with each slot of the plurality of slots, a plurality of bit sequence segments to generate the concatenated plurality of bit sequence segments of each slot, each bit sequence segment of the plurality of bit sequence segments corresponding to a different code block.

### Claim 25 (depends on 24)

The non-transitory computer-readable medium of claim 24, in which the program code to segment the transport block into the plurality of code blocks further comprises:
program code to segment the transport block into a plurality of sub-transport blocks based on a quantity of the plurality of slots, each slot of the plurality of slots corresponding to a set of sub-transport blocks of the plurality of sub-transport blocks; and
program code to segment the plurality of sub-transport blocks into the plurality of code blocks.

### Claim 26 (depends on 24)

The non-transitory computer-readable medium of claim 24, in which the program code further comprises program code to segment the plurality of code blocks based on a quantity of the plurality of slots, such that each slot is associated with one or more different code blocks of the plurality of code blocks.