# US 2022/0287046 A1 · Resource allocation method, device and system of wireless communication system

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

- Number: US 2022/0287046 A1
- Document ID: US20220287046A1
- Status: Published application
- Kind: A1
- Application number: 17/722,370
- Filed: 2022-04-17
- Published: 2022-09-08
- Earliest claimed: 2018-01-13
- Assignees: Wilus Institute of Standards and Technology Inc.
- Applicants: Wilus Institute of Standards and Technology Inc.
- Inventors: Kyungjun Choi; Minseok Noh; Jinsam Kwak
- Web page: https://patentgrep.com/patent/US20220287046A1

## CPC

- H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA
- H04W 72/12: Wireless traffic scheduling
- H04L 5/001: {the frequencies being arranged in component carriers}
- H04L 5/0092: {Indication of how the channel is divided}
- H04W 72/04: Wireless resource allocation
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04W 72/232: the control data signalling from the physical layer, e.g. DCI signalling
- H04W 72/1263: Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
- Y02D 30/70: in wireless communication networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Disclosed are a UE of a wireless communication system and a wireless communication method using the same. More particularly, the method including receiving scheduling information including resource allocation information, wherein the resource allocation information comprises a RIV determined based on the number of RBs of a first BWP, and transmitting or receiving data on a RB set corresponding to the RIV in a second BWP, wherein the number of RBs of the second BWP is greater than the number of RBs of the first BWP, the starting RB index S and the number of RBs of the RB set corresponding to the RIV in the second BWP are given in powers of 2 and a device for the same are disclosed.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A user equipment (UE) for use in a wireless communication system, the UE comprising:
a processor; and
a communication module,
wherein the processor is configured to:
receive downlink control information (DCI) including a resource indication value (RIV), wherein the RIV is defined to indicate a starting index and a length, with reference to a number NBWP1 of resource blocks (RBs) in a first bandwidth part (BWP); and
transceive a physical shared channel on a contiguous RB set corresponding to the RIV within a second BWP, wherein the second BWP is different from the first BWP and has a number NBWP2 of RBs,
wherein, when NBWP2>NBWP1, a starting index S and a length L of the contiguous RB set have respectively one of the following values, based on the RIV:
the starting index S: {0, K, 2*K, . . . , (NBWP1−1)*K}, and
the length L: {K, 2*K, 3*K, . . . , NBWP1*K},
where K has a value within a set of {1, 2, . . . , 2n}, based on NBWP2/NBWP1, and n represents a positive integer, and
where S and L are expressed in unit of RB.

### Claim 22 (depends on 21)

The UE of claim 21, wherein a relation between the first BWP and the second BWP comprises:
(first BWP, second BWP)=(initial BWP, active BWP), or
(first BWP, second BWP)=(currently activated BWP, newly activated BWP),
where the currently activated BWP is an active BWP at a time when the scheduling information is received, and the newly activated BWP is a BWP indicated by a bandwidth part indicator, BPI, in the DCI.

### Claim 23 (depends on 21)

The UE of claim 21, wherein K and NBWP2/NBWP1 satisfy a relation including at least part of the following table:
X
1 < X < 2
2 ≤ X < 4
4 ≤ X < 8
8 ≤ X < 16
K
1
2
4
8
where X is NBWP2/NBWP1.

### Claim 24 (depends on 21)

The UE of claim 21, wherein the RIV has a value satisfying the following equation:
RIV=NBWP1*(L′−1)+S′, if (L′−1)≤floor(NBWP1/2), and
RIV=NBWP1*(NBWP1−L′+1)+(NBWP1−1−S′), if (L′−1)>floor(NBWP1/2),
where L′ is a value of 1≤L′≤NBWP1−S′ as L/K, and S′ is S/K.

### Claim 25 (depends on 21)

The UE of claim 21, wherein when NBWP1>=NBWP2, the starting index S and the length L of the contiguous RB set have one of the following values, respectively:
the starting RB index S: {0, 1, 2, . . . , NBWP2−1}, and
the length L: {1, 2, 3, . . . , NBWP2}.

### Claim 26

A base station (BS) for use in a wireless communication system, the BS comprising:
a processor; and
a communication module,
wherein the processor is configured to:
transmit downlink control information (DCI) including a resource indication value (RIV) wherein the RIV is defined to indicate a starting index and a length, with reference to a number NBWP1 of resource blocks (RBs) in a first bandwidth part (BWP); and
transceive a physical shared channel on a contiguous RB set corresponding to the RIV within a second BWP, wherein the second BWP is different from the first BWP and has a number NBWP2 of RBs,
wherein, when NBWP2>NBWP1, a starting index S and a length L of the contiguous RB set have respectively one of the following values, based on the RIV:
the starting index S: {0, K, 2*K, . . . , (NBWP1−1)*K}, and
the length L: {K, 2*K, 3*K, . . . , NBWP1*K},
where K has a value within a set of {1, 2, . . . , 2n}, based on NBWP2/NBWP1, and n represents a positive integer, and
where S and L are expressed in unit of RB.

### Claim 27 (depends on 26)

The BS of claim 26, wherein a relation between the first BWP and the second BWP comprises:
(first BWP, second BWP)=(initial BWP, active BWP), or
(first BWP, second BWP)=(currently activated BWP, newly activated BWP),
where the currently activated BWP is an active BWP at a time when the scheduling information is received, and the newly activated BWP is a BWP indicated by a bandwidth part indicator, BPI, in the DCI.

### Claim 28 (depends on 26)

The BS of claim 26, wherein K and NBWP2/NBWP1 satisfy a relation including at least part of the following table:
X
1 < X < 2
2 ≤ X < 4
4 ≤ X < 8
8 ≤ X < 16
K
1
2
4
8
where X is NBWP2/NBWP1.

### Claim 29 (depends on 26)

The BS of claim 26, wherein the RIV has a value satisfying the following equation:
RIV=NBWP1*(L′−1)+S′, if (L′−1)≤floor(NBWP1/2), and
RIV=NBWP1*(NBWP1−L′+1)+(NBWP1−1−S′), if (L′−1)>floor(NBWP1/2),
where L′ is a value of 1≤L′≤NBWP1−S′ as L/K, and S′ is S/K.

### Claim 30 (depends on 26)

The BS of claim 26, wherein when NBWP1>=NBWP2, the starting index S and the length L of the contiguous RB set have one of the following values, respectively:
the starting RB index S: {0, 1, 2, . . . , NBWP2−1}, and
the length L: {1, 2, 3, . . . , NBWP2}.

### Claim 31

A method performed by a user equipment (UE) in a wireless communication system, the method comprising:
receiving downlink control information (DCI) including a resource indication value (RIV) wherein the RIV is defined to indicate a starting index and a length, with reference to a number NBWP1 of resource blocks (RBs) in a first bandwidth part (BWP); and
transceiving a physical shared channel on a contiguous RB set corresponding to the RIV within a second BWP, wherein the second BWP is different from the first BWP and has a number NBWP2 of RBs,
wherein, when NBWP2>NBWP1, a starting index S and a length L of the contiguous RB set have respectively one of the following values, based on the RIV:
the starting index S: {0, K, 2*K, . . . , (NBWP1−1)*K}, and
the length L: {K, 2*K, 3*K, . . . , NBWP1*K},
where K has a value within a set of {1, 2, . . . , 2n}, based on NBWP2/NBWP1, and n represents a positive integer, and
where S and L are expressed in unit of RB.

### Claim 32 (depends on 31)

The method of claim 31, wherein a relation between the first BWP and the second BWP comprises:
(first BWP, second BWP)=(initial BWP, active BWP), or
(first BWP, second BWP)=(currently activated BWP, newly activated BWP),
where the currently activated BWP is an active BWP at a time when the scheduling information is received, and the newly activated BWP is a BWP indicated by a bandwidth part indicator, BPI, in the DCI.

### Claim 33 (depends on 31)

The method of claim 31, wherein K and NBWP2/NBWP1 satisfy a relation including at least part of the following table:
X
1 < X < 2
2 ≤ X < 4
4 ≤ X < 8
8 ≤ X < 16
K
1
2
4
8
where X is NBWP2/NBWP1.

### Claim 34 (depends on 31)

The method of claim 31, wherein the RIV has a value satisfying the following equation:
RIV=NBWP1*(L′−1)+S′, if (L′−1)≤floor(NBWP1/2), and
RIV=NBWP1*(NBWP1−L′+1)+(NBWP1−1−S′), if (L′−1)>floor(NBWP1/2),
where L′ is a value of 1≤L′≤NBWP1−S′ as L/K, and S′ is S/K.

### Claim 35 (depends on 31)

The method of claim 31, wherein when NBWP1>=NBWP2, the starting index S and the length L of the contiguous RB set have one of the following values, respectively:
the starting RB index S: {0, 1, 2, . . . , NBWP2−1}, and
the length L: {1, 2, 3, . . . , NBWP2}.

### Claim 36

A method performed by a base station (BS) in a wireless communication system, the method comprising:
transmitting downlink control information (DCI) including a resource indication value (RIV) wherein the RIV is defined to indicate a starting index and a length, with reference to a number NBWP1 of resource blocks (RBs) in a first bandwidth part (BWP); and
transceiving a physical shared channel on a contiguous RB set corresponding to the RIV within a second BWP, wherein the second BWP is different from the first BWP and has a number NBWP2 of RBs,
wherein, when NBWP2>NBWP1, a starting index S and a length L of the contiguous RB set have respectively one of the following values, based on the RIV:
the starting index S: {0, K, 2*K, . . . , (NBWP1−1)*K}, and
the length L: {K, 2*K, 3*K, . . . , NBWP1*K},
where K has a value within a set of {1, 2, . . . , 2n}, based on NBWP2/NBWP1, and n represents a positive integer, and
where S and L are expressed in unit of RB.

### Claim 37 (depends on 36)

The method of claim 36, wherein a relation between the first BWP and the second BWP comprises:
(first BWP, second BWP)=(initial BWP, active BWP), or
(first BWP, second BWP)=(currently activated BWP, newly activated BWP),
where the currently activated BWP is an active BWP at a time when the scheduling information is received, and the newly activated BWP is a BWP indicated by a bandwidth part indicator, BPI, in the DCI.

### Claim 38 (depends on 36)

The method of claim 36, wherein K and NBWP2/NBWP1 satisfy a relation including at least part of the following table:
X
1 < X < 2
2 ≤ X < 4
4 ≤ X < 8
8 ≤ X < 16
K
1
2
4
8
where X is NBWP2/NBWP1.

### Claim 39 (depends on 36)

The method of claim 36, wherein the RIV has a value satisfying the following equation:
RIV=NBWP1*(L′−1)+S′, if (L′−1)≤floor(NBWP1/2), and
RIV=NBWP1*(NBWP1−L′+1)+(NBWP1−1−S′), if (L′−1)>floor(NBWP1/2),
where L′ is a value of 1≤L′≤NBWP1−S′ as L/K, and S′ is S/K.

### Claim 40 (depends on 36)

The method of claim 36, wherein when NBWP1>=NBWP2, the starting index S and the length L of the contiguous RB set have one of the following values, respectively:
the starting RB index S: {0, 1, 2, . . . , NBWP2−1}, and
the length L: {1, 2, 3, . . . , NBWP2}.
