# US 2019/0319770 A1 · Methods and network nodes for scheduling a plurality of tti-bundle transmissions

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

- Number: US 2019/0319770 A1
- Document ID: US20190319770A1
- Status: Published application
- Kind: A1
- Application number: 16/312,714
- Filed: 2016-07-06
- Published: 2019-10-17
- Earliest claimed: 2016-07-06
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget Lm Ericsson (Publ)
- Inventors: Jun WANG
- Web page: https://patentgrep.com/patent/US20190319770A1

## CPC

- H04L 5/0082: {at predetermined intervals}
- H04L 1/0038: {Blind format detection (for detection of modulation format H04L27/0012)}
- H04L 1/1809: Selective-repeat protocols
- H04L 1/1835: {Buffer management}
- H04L 5/0055: {Physical resource allocation for ACK/NACK (for physical mapping arrangements in ARQ protocols H04L1/1861)}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04W 72/0446: Resources in time domain, e.g. slots or frames
- 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 for transmitting data by a user equipment (UE) over a plurality of Transmission Time Interval, TTI, bundles in a communication network is provided. The method comprises: receiving a single control message indicating a uplink scheduling grant for data transmissions; determining a number of TTI-bundles, scheduled for the data transmissions of the UE in accordance with the received control message; and sending the data to the communication network, using the determined number of TTI-bundles. A user equipment for implementing the method is also provided.

## Claims

### Claim at position 1

1-18. (canceled)

### Claim 19

A method for transmitting data by a user equipment (UE) using a plurality of Transmission Time Interval, TTI, bundles in a communication network, the method comprising:
receiving a single control message indicating an uplink scheduling grant for data transmissions;
determining a number of TTI-bundles, allocated for the data transmissions of the UE in accordance with the received control message; and
sending the data to the communication network, using the determined number of TTI-bundles.

### Claim at position 3

20-30. (canceled)

### Claim 31

A network node for scheduling resources for a user equipment (UE) to transmit data in a communication network, the network node comprising a processing circuitry adapted to cause the network node to:
determine a number of Transmission Time Interval (TTI)-bundles based at least on an amount of data to be transmitted from the UE; and
send a single control message to the UE, the control message indicating an uplink scheduling grant for transmissions of the determined number of TTI-bundles.

### Claim 32

(canceled)

### Claim 33

(canceled)

### Claim 34 (depends on 31)

The network node of claim 31, wherein the processing circuitry is adapted to determine one of a number of consecutive TTI bundles and a number of non-consecutive TTI bundles.

### Claim 35 (depends on 31)

The network node of claim 31, wherein the control message is one of a Downlink Control Information format 0 (DCI0) and DCI format 4 (DCI4), which comprises a Resource Indication Value (RIV) field, wherein the RIV field provides a TTI-bundle Scheduling Number (TBSN), which indicates the number of determined TTI-bundles.

### Claim 36

(canceled)

### Claim 37 (depends on 36)

The network node of claim 36, wherein the TBSN is provided by an unused range of values of the RIV field.

### Claim 38 (depends on 31)

The network node of claim 31, wherein the processing circuitry is configured to calculate a value of the TBSN according to
TBSN
=
⌊
RIV
rcv
RIV
max


tti
-
b
⌋
+
1
where RIVrcv is an actual value of the RIV field in the DCI0 and RIVmax tti-b is a maximum RIV value for a TTI-bundle transmission, and defined as: RIVmax tti-b=PRBmaxUL×PRBmaxTTI-B, where PRBmaxUL refers to a maximum number of Physical Resource Block (PRB) allocated for a uplink transmission, and PRBmaxTTI-B refers to a maximum number of PRB allocated for a TTI-bundle transmission.

### Claim 39 (depends on 38)

The network node of claim 38, wherein the processing circuitry is configured to calculate an effective RIV according to RIVeffective=RIVrcv mod RIVmax tti-b, which is used to deduce an actual PRB number and starting position for the transmission of the determined number of TTI-bundles.

### Claim 40

(canceled)

### Claim 41

(canceled)

### Claim 42 (depends on 35)

The network node of claim 35, wherein the TBSN refers to an index of a mapping table, the mapping table providing a transmission pattern for the data transmissions of the determined number of non-consecutive TTI bundles.

### Claim 43 (depends on 42)

The network node of claim 42, wherein the processing circuitry is adapted to send the mapping table to the UE when the UE attaches to the network node and when TTI-bundling is enabled.

### Claim 44

(canceled)

### Claim 45 (depends on 31)

The network node of claim 31, wherein the processing circuitry is adapted to blindly decode received data from one of the determined number of TTI-bundles in two steps, and wherein only one retransmission is allowed.

### Claim 46 (depends on 45)

The network node of claim 45, wherein the processing circuitry is adapted to, if the received data is from an initial transmission or if a feedback for a previous transmission is positive:
decode the received data alone;
if the decoding is successful, send a positive acknowledgement to the UE;
if the decoding fails:
decode the received data together with a current content of a buffer;
if the decoding is successful, determine that the received data is a retransmission and send a positive acknowledgement to the UE;
if the decoding fails, store the received data in the buffer to override the current content of the buffer and send a negative acknowledgement to the UE.

### Claim 47 (depends on 45)

The network node of claim 45, wherein the processing circuitry is further adapted to, if a feedback for a previous transmission is negative:
decode the received data together with a current content of a buffer;
if the decoding is successful, determine that the received data is a retransmission and send a positive acknowledgement to the UE;
if the decoding fails:
decode the received data alone;
if the decoding is successful, determine that the received data is a new transmission and send a positive acknowledgement to the UE;
if the decoding fails, store the received data in the buffer to override the current content of the buffer and send a negative acknowledgement to the UE.

### Claim 48 (depends on 46)

The network node of claim 46, wherein the current content of the buffer includes data from a previous transmission.

### Claim 49

A User Equipment (UE) for transmitting data over a plurality of Transmission Time Interval, TTI, bundles in a communication network, the UE comprising a processing circuitry adapted to cause the UE to:
receive a single control message indicating an uplink scheduling grant for data transmissions;
determine a number of TTI-bundles, scheduled for the data transmissions of the UE in accordance with the received control message; and
send the data to the communication network, using the determined number of TTI-bundles.

### Claim 50

(canceled)

### Claim 51 (depends on 49)

The UE of claim 49, wherein the received control message is one of a Downlink Control Information format 0 (DCI0) and DCI format 4 (DCI4), which includes a Resource Indication Value (RIV) field, wherein the RIV field provides for a TTI bundle Scheduling Number (TBSN), which indicates the number of determined TTI-bundles.

### Claim 52

(canceled)

### Claim 53 (depends on 49)

The UE of claim 49, wherein the processing circuitry is adapted to determine the number of TTI-bundles by calculating a value of the TBSN according to:
TBSN
=
⌊
RIV
rcv
RIV
max


tti
-
b
⌋
+
1
where RIVrcv is an actual value of the RIV field in the DCI0 and RIVmax tti-b is a maximum RIV value for a TTI-bundle transmission, and defined as: RIVmax tti-b=PRBmaxUL×PRBmaxTTI-B, where PRBmaxUL refers to a maximum number of Physical Resource Block (PRB) allocated for a uplink transmission, and PRBmaxTTI-B refers to a maximum number of PRB allocated for a TTI-bundle transmission.

### Claim 54 (depends on 53)

The UE of claim 53, wherein the processing circuitry is further adapted to calculate an effective RIV according to RIVeffective=RIVrcv mod RIVmax tti-b, which is used to deduce an actual PRB number and starting position for the transmission of the determined number of TTI-bundles.

### Claim 55 (depends on 49)

The UE of claim 49, wherein the determined number of TTI-bundles includes one of a number of consecutive TTI bundles and a number of non-consecutive TTI bundles.

### Claim 56 (depends on 51)

The UE of claim 51, wherein the TBSN is given by an unused range of values of the RIV field.

### Claim 57

(canceled)

### Claim 58

(canceled)

### Claim 59

(canceled)

### Claim 60 (depends on 51)

The UE of claim 51, wherein the TBSN refers to an index of a mapping table, the mapping table providing a transmission pattern for the data transmissions of the determined number of non-consecutive TTI bundles.

### Claim 61 (depends on 60)

The UE of claim 60, wherein the processing circuitry is further adapted to receive the mapping table when the UE attaches to a network node and when TTI-bundling is enabled.

### Claim 62

(canceled)

### Claim 63

(canceled)
