# US 12,010,705 B2 · Communicating repetitions of multiple transport blocks scheduled by single downlink control information

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

- Number: US 12,010,705 B2
- Document ID: US12010705B2
- Status: Granted
- Kind: B2
- Application number: 18/064,618
- Filed: 2022-12-12
- Published: 2023-05-18
- Granted: 2024-06-11
- Earliest claimed: 2019-08-16
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Ayan Sengupta; Alberto Rico Alvarino; Le Liu
- Web page: https://patentgrep.com/patent/US12010705B2

## CPC

- H04L 1/04: using frequency diversity
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04B 1/713: using frequency hopping
- H04B 1/7143: Arrangements for generation of hop patterns
- H04L 1/1816: {with retransmission of the same, encoded, message}
- H04L 1/189: {Transmission or retransmission of more than one copy of a message}
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 1/1893: {Physical mapping arrangements (physical resource mapping in general H04L5/00)}
- 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)
- H04B: TRANSMISSION

## Abstract

Methods, systems, and devices for wireless communications are described. Transport blocks may be scheduled using a single downlink control information (DCI) message. A wireless device may identify mapping pattern for mapping the transport blocks and repetitions of the transport blocks to communication resources. Mapping the transport blocks, or determining a mapping of the transport blocks, to communication resources may include partitioning the communication resources into subunits, where each subunit includes resources spread across each subband of a frequency hopping pattern and at least one instance of each of the scheduled transport blocks.

## Claims

### Claim 1

A method for wireless communication at a user equipment (UE), comprising:
receiving a single downlink control information (DCI) message scheduling the UE to receive a plurality of transport blocks and repetitions of the plurality of transport blocks in accordance with an interleaving granularity over a plurality of resources that are distributed across a plurality of subbands in accordance with a frequency hopping pattern;
determining, based at least in part on the interleaving granularity and the frequency hopping pattern, a mapping of an interleaved version of the plurality of transport blocks and the repetitions of the plurality of transport blocks to the plurality of resources based at least in part on the interleaving granularity, a plurality of subunits of the interleaved version, and values of respective cyclic shifts that are applied to individual subunits of the plurality of subunits of the interleaved version, the respective cyclic shifts being applied based at least in part on whether a frequency diversity associated with at least one transport block of the plurality of transport blocks in an absence of applying the respective cyclic shifts is below a threshold; and
receiving the plurality of transport blocks and the repetitions over the plurality of resources based at least in part on the mapping.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining a length of the plurality of subunits based at least in part on computing LCM[(Nsched*NIL), (NNBch,DL*NNB,hopch,DL)], wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
determining a quantity of the plurality of subunits within a period based at least in part on computing GCF (N┌NNBch,DL*NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining whether a cyclic shift is applied to the plurality of subunits based at least in part on a quotient obtained by dividing a quantity of instances of a transport block of the plurality of transport blocks by a quantity of the plurality of subbands without an application of the cyclic shift being below a threshold rate.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
determining whether a cyclic shift is applied to the plurality of subunits based at least in part on computing [1 mod GCF(Nsched,┌NNBch,DL*NNB,hopch,DL/NIL┐)]*┌NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
determining the quantity of the plurality of transport blocks, Nsched; and
determining a quotient obtained by dividing a quantity of slots in a full frequency hopping interval with the interleaving granularity, NIL,
wherein determining whether the cyclic shift is applied comprises determining an absence of the cyclic shift for the plurality of subunits based at least in part on the quantity of the plurality of transport blocks and the quotient being co-prime.

### Claim 7 (depends on 5)

The method of claim 5, further comprising:
determining the quantity of the plurality of transport blocks, Nsched; and
determining a quotient obtained by dividing a quantity of slots in a full frequency hopping interval with the interleaving granularity, NIL,
wherein determining whether the cyclic shift is applied comprises determining an application of the cyclic shift for the plurality of subunits based at least in part on a greatest common factor of the quantity of the plurality of transport blocks and the quotient being greater than one.

### Claim 8 (depends on 7)

The method of claim 7, wherein a value of the cyclic shift is equivalent to ┌NNBch,DL/NIL┐.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
determining a resource of the plurality of resources comprising an initial transport block of the interleaved version based at least in part on computing └i/NIL┘, wherein i is an index of a slot, and NIL is the interleaving granularity.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
determining whether a cyclic shift is applied to the plurality of subunits based at least in part on computing (┌i/LCM[(Nsched*NNBch,DL),(NNBch,DL*NNB,hopch,DL)]┐*(1 mod GCF(Nsched,┌NNBch,DL*NNB,hopch,DL┐/NIL┐))*└NNBch,DL/NIL┘), wherein i is an index of a transport block of the interleaved version, Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNBch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 11

A method for wireless communication at a network entity, comprising:
interleaving a plurality of transport blocks and repetitions of the plurality of transport blocks in accordance with an interleaving granularity to obtain an interleaved version of the plurality of transport blocks and the repetitions of the plurality of transport blocks;
mapping, to a plurality of resources that are distributed across a plurality of subbands in accordance with a frequency hopping pattern, the interleaved version based at least in part on the interleaving granularity, a plurality of subunits of the interleaved version, and values of respective cyclic shifts that are applied to individual subunits of the plurality of subunits of the interleaved version, the respective cyclic shifts being applied based at least in part on whether a frequency diversity associated with at least one transport block of the plurality of transport blocks in an absence of applying the respective cyclic shifts is below a threshold;
transmitting, to a user equipment (UE), a single downlink control information (DCI) message scheduling the UE to receive the interleaved version over the plurality of resources in accordance with the mapping; and
transmitting, based at least in part on the single DCI message, the interleaved version over the plurality of resources.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
determining a length of the plurality of subunits based at least in part on computing LCM[(Nsched*NIL),(NNBch,DL*NNBch,DL)], wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 13 (depends on 11)

The method of claim 11, further comprising:
determining a quantity of the plurality of subunits within a period based at least in part on computing GCF (Nsched,┌NNBch,DL*NNBch,DL/NIL┐), wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 14 (depends on 11)

The method of claim 11, further comprising:
applying a cyclic shift to the plurality of subunits based at least in part on a quotient obtained by dividing a quantity of instances of a transport block of the plurality of transport blocks by a quantity of the plurality of subbands without an application of the cyclic shift being below a threshold rate.

### Claim 15 (depends on 11)

The method of claim 11, further comprising:
determining whether to apply a cyclic shift to the plurality of subunits based at least in part on computing [1 mod GCF (Nsched,┌NNBch,DL*NNB,hopch,DL/NIL┐)]*┌NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
determining the quantity of the plurality of transport blocks, Nsched; and
determining a quotient obtained by dividing a quantity of slots in a full frequency hopping interval with the interleaving granularity, NIL,
wherein determining whether to apply the cyclic shift comprises refraining from applying the cyclic shift for the plurality of subunits based at least in part on the quantity of the plurality of transport blocks and the quotient being co-prime.

### Claim 17 (depends on 15)

The method of claim 15, further comprising:
determining the quantity of the plurality of transport blocks, Nsched; and
determining a quotient obtained by dividing a quantity of slots in a full frequency hopping interval with the interleaving granularity, NIL,
wherein determining whether to apply the cyclic shift comprises applying the cyclic shift for the plurality of subunits based at least in part on a greatest common factor of the quantity of the plurality of transport blocks and the quotient being greater than one.

### Claim 18 (depends on 17)

The method of claim 17, wherein a value of the cyclic shift is equivalent to ┌NNBch,DL/NIL┐.

### Claim 19 (depends on 11)

The method of claim 11, further comprising:
determining a resource of the plurality of resources comprising an initial transport block of the interleaved version based at least in part on computing └i/NIL┘, wherein i is an index of a slot, and NIL is the interleaving granularity.

### Claim 20 (depends on 11)

The method of claim 11, wherein the interleaved version is mapped to the plurality of resources based at least in part on computing ITB(i)=(└i/NIL┘+└i/LCM[(Nsched*NIL),(NNBch,DL*NNB,hopch,DL)]┘* (1 mod GCF (Nsched,┌NNBch,DL*NNB,hopch,DL/NIL┐))*┌NNBch,DL/NIL┐) mod Nsched, wherein i is an index of a transport block of the interleaved version, Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands, and ITB(i) is the ith transport block of the interleaved version.

### Claim 21

A user equipment (UE) for wireless communication, 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 UE to:
receive a single downlink control information (DCI) message scheduling the UE to receive a plurality of transport blocks and repetitions of the plurality of transport blocks in accordance with an interleaving granularity over a plurality of resources that are distributed across a plurality of subbands in accordance with a frequency hopping pattern;
determine, based at least in part on the interleaving granularity and the frequency hopping pattern, a mapping of an interleaved version of the plurality of transport blocks and the repetitions of the plurality of transport blocks to the plurality of resources based at least in part on the interleaving granularity, a plurality of subunits of the interleaved version, and values of respective cyclic shifts that are applied to individual subunits of the plurality of subunits of the interleaved version, the respective cyclic shifts being applied based at least in part on whether a frequency diversity associated with at least one transport block of the plurality of transport blocks in an absence of applying the respective cyclic shifts is below a threshold; and
receive the plurality of transport blocks and the repetitions over the plurality of resources based at least in part on the mapping.

### Claim 22 (depends on 21)

The UE of claim 21, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
determine a length of the plurality of subunits based at least in part on computing LCM[(Nsched*NIL),(NNBch,DL*NNB,hopch,DL)], wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 23 (depends on 21)

The UE of claim 21, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
determine a quantity of the plurality of subunits within a period based at least in part on computing [1 mod GCF(Nsched,┌NNBch,DL*NNB,hopch,DL/NIL┐)]*┌NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 24 (depends on 21)

The UE of claim 21, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
determine whether a cyclic shift is applied to the plurality of subunits based at least in part on computing [1 mod GCF(Nsched,┌NNBch,DL*NNB,hopch,DL┐)]*┌NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 25 (depends on 21)

The UE of claim 21, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
determine whether a cyclic shift is applied to the plurality of subunits (based at least in part on computing (┌i/LCM[(Nsched*NIL),(NNBch,DL*NNB,hopch,DL)]┐* (1 mod GCF(Nsched,┌(NNBch,DL*NNB,hopch,DL┐))*┌NNBch,DL/NIL┐), wherein i is an index of a transport block of the interleaved version, Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 26

A network entity for wireless communication, 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 network entity to:
interleave a plurality of transport blocks and repetitions of the plurality of transport blocks in accordance with an interleaving granularity to obtain an interleaved version of the plurality of transport blocks and the repetitions of the plurality of transport blocks;
map, to a plurality of resources that are distributed across a plurality of subbands in accordance with a frequency hopping pattern, the interleaved version based at least in part on the interleaving granularity, a plurality of subunits of the interleaved version, and values of respective cyclic shifts that are applied to individual subunits of the plurality of subunits of the interleaved version, the respective cyclic shifts being applied based at least in part on whether a frequency diversity associated with at least one transport block of the plurality of transport blocks in an absence of applying the respective cyclic shifts is below a threshold;
transmit, to a user equipment (UE), a single downlink control information (DCI) message scheduling the UE to receive the interleaved version over the plurality of resources in accordance with the mapping; and
transmit, based at least in part on the single DCI message, the interleaved version over the plurality of resources.

### Claim 27 (depends on 26)

The network entity of claim 26, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
determine a length of the plurality of subunits based at least in part on computing LCM[(Nsched*NIL),(NNBch,DL*NNB,hopch,DL)], wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 28 (depends on 26)

The network entity of claim 26, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
determine a quantity of the plurality of subunits within a period based at least in part on computing GCF(Nsched,┌NNBch,DL*NNBch,DL/NIL┐), wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.

### Claim 29 (depends on 26)

The network entity of claim 26, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
apply a cyclic shift to the plurality of subunits based at least in part on a quotient obtained by dividing a quantity of instances of a transport block of the plurality of transport blocks by a quantity of the plurality of subbands without an application of the cyclic shift being below a threshold rate.

### Claim 30 (depends on 26)

The network entity of claim 26, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
determine whether to apply a cyclic shift to the plural ty of subunits based at least in part on computing [1 mod GCF(Nsched,┌NNBch,DL*NNB,hopch,DL/NIL┐)]*┌NNBch,DL/NIL┐, wherein Nsched is a quantity of the plurality of transport blocks, NIL is the interleaving granularity, NNBch,DL is a hopping interval, and NNB,hopch,DL is a quantity of frequency hops across the plurality of subbands.