# US 2021/0176798 A1 · Communication Method and Device

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

- Number: US 2021/0176798 A1
- Document ID: US20210176798A1
- Status: Published application
- Kind: A1
- Application number: 17/179,743
- Filed: 2021-02-19
- Published: 2021-06-10
- Earliest claimed: 2018-08-20
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Han Zhou; Meng Hua
- Web page: https://patentgrep.com/patent/US20210176798A1

## CPC

- H04W 74/0841: {with collision treatment}
- H04W 74/0833: Random access procedures, e.g. with 4-step access
- H04W 28/0858: {among entities in the uplink}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A communication method includes determining, by a terminal side device in a mobile communications system, N random access preambles on N uplink bandwidth parts (BWPs) in a random access process, where N is an integer greater than or equal to 2, and sending, by the terminal side device, the N random access preambles to a network side device so that the terminal side device can perform random access on a plurality of uplink BWPs. In this method, the network side device or each terminal side device may subsequently perform random access on any one of the N uplink BWPs.

## Claims

### Claim 1

A method implemented by a terminal side device, wherein the method comprises:
determining N random access preambles on N uplink bandwidth parts (BWPs) in a random access process, wherein N is an integer greater than or equal to 2;
determining a plurality of time resources corresponding to the N uplink BWPs; and
sending, using the time resources, the N random access preambles to a network side device.

### Claim 2 (depends on 1)

The method of claim 1, wherein the time resources do not overlap.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
identifying that a sum of uplink powers on any two of the N uplink BWPs is greater than a total uplink power available to the terminal side device; and
determining, based on the identifying, that the time resources do not overlap.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
sending a first random access preamble on an ith uplink BWP, wherein the first random access preamble is of the N random access preambles; and
sending second random access preambles on an (i+1)th uplink BWP to an Nth uplink BWP within a random access response time window corresponding to the first random access preamble, wherein i is any integer from 1 to N-2, and wherein the second random access preambles are of the N random access preambles.

### Claim 5 (depends on 2)

The method of claim 2, further comprising:
sending a first random access preamble on a jth uplink BWP, wherein the first random access preamble is of the N random access preambles; and
sending a second random access preamble on a (j+1)th uplink BWP within a random access response time window corresponding to the first random access preamble, wherein j is any integer from 1 to N-1, and wherein the second random access preamble is of the N random access preambles.

### Claim 6 (depends on 1)

The method of claim 1, wherein at least two of the time resources corresponding to at least two uplink BWPs in the N uplink BWPs overlap.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
identifying that a sum of uplink powers on the at least two uplink BWPs is less than or equal to a total uplink power available to the terminal side device; and
determining, based on the identifying, that the at least two of the time resources overlap.

### Claim 8 (depends on 1)

The method of claim 1, wherein after sending the N random access preambles, the method further comprises:
receiving M random access responses from the network side device, wherein M is a positive integer less than or equal to N;
selecting a first random access response from the M random access responses; and
sending a first message to the network side device based on the first random access response, wherein the first message requests a contention conflict resolution for random access corresponding to the first random access response.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
receiving M random access responses from the network side device, wherein M is a positive integer less than or equal to N; and
sending a first message to the network side device based on a kth random access response in the M random access responses, wherein the first message requests a contention conflict resolution for random access corresponding to the kth random access response, and wherein k is any integer from 1 to M.

### Claim 10

An apparatus comprising:
a memory configured to store instructions; and
a processor coupled to the memory, wherein the instructions cause the processor to be configured to:
determine N random access preambles on N uplink bandwidth parts (BWPs) in a random access process, wherein N is an integer greater than or equal to 2;
determine a plurality of time resources corresponding to the N uplink BWPs; and
send, using the time resources, the N random access preambles to a network side device.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the time resources corresponding to the N uplink BWPs do not overlap.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the instructions further cause the processor to be configured to:
identify that a sum of uplink power on any two of the N uplink BWPs is greater than a total uplink power available to the apparatus; and
determine, based on the identifying, that the time resources do not overlap.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the instructions further cause the processor to be configured to:
send a first random access preamble on an ith uplink BWP, wherein the first random access preamble is of the N random access preambles; and
send a second random access preambles on an (i+1)th uplink BWP to an Nth uplink BWP within a random access response time window corresponding to the first random access preamble, wherein i is any integer from 1 to N-2, and wherein the second random access preambles are of the N random access preambles.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the instructions further cause the processor to be configured to:
send a first random access preamble on a jth uplink BWP, wherein the first random access preamble is of the N random access preambles; and
send a second random access preamble on a (j+1)th uplink BWP within a random access response time window corresponding to the first random access preamble, wherein j is any integer from 1 to N-1, and wherein the second random access preamble is of the N random access preambles.

### Claim 15 (depends on 10)

The apparatus of claim 10, wherein at least two time resources corresponding to at least two uplink BWPs in the N uplink BWPs overlap.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein the instructions further cause the processor to be configured to:
identify that a sum of uplink power on the at least two uplink BWPs is less than or equal to a total uplink power available to the apparatus; and
determine, based on the identifying, that the at least two time resources overlap.

### Claim 17 (depends on 10)

The apparatus of claim 10, wherein the instructions further cause the processor to be configured to:
receive M random access responses from the network side device, wherein M is a positive integer less than or equal to N;
select a first random access response from the M random access responses; and
send a first message to the network side device based on the first random access response, wherein the first message requests a contention conflict resolution for random access corresponding to the first random access response.

### Claim 18 (depends on 10)

The apparatus of claim 10, wherein the instructions further cause the processor to be configured to:
receive M random access responses from the network side device, wherein M is a positive integer less than or equal to N; and
send a first message to the network side device based on a kth random access response in the M random access responses, wherein the first message requests a contention conflict resolution for random access corresponding to the kth random access response, and wherein k is any integer from 1 to M.

### Claim 19

An apparatus comprising:
a memory configured to store instructions; and
a processor coupled to the memory, wherein the instructions cause the processor to be configured to:
receive P random access preambles on P uplink bandwidth parts (BWPs) from a terminal side device, wherein the P uplink BWPs are part of N uplink BWPs, wherein N is an integer greater than or equal to 2, and wherein P is a positive integer less than or equal to N;
send P random access responses to the terminal side device based on the P random access preambles, wherein the P random access responses comprise a first random access response; and
receive a first message from the terminal side device and in response to the first random access response,
wherein the first message requests a contention conflict resolution for random access corresponding to the first random access response.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the instructions further cause the processor to be configured to receive a second message in response to a second random access response from the terminal side device, wherein the second random access response is one of P-1 random access responses other than the first random access response in the P random access responses, and wherein the second message indicates to cancel random access corresponding to the second random access response.
