# US 2026/0095950 A1 · Random access message transmission schemes with cyclic shift

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

- Number: US 2026/0095950 A1
- Document ID: US20260095950A1
- Status: Published application
- Kind: A1
- Application number: 18/905,074
- Filed: 2024-10-02
- Published: 2026-04-02
- Earliest claimed: 2024-10-02
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Raviteja PATCHAVA; Jing SUN; Xiaoxia ZHANG; Junyi LI; Yan ZHOU; Ori SHENTAL; Jing JIANG
- Web page: https://patentgrep.com/patent/US20260095950A1

## CPC

- H04W 74/0833: Random access procedures, e.g. with 4-step access
- H04W 74/0841: {with collision treatment}
- H04W 76/10: Connection setup
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Methods, systems, and devices for wireless communications are described. A user equipment (UE) may transmit a random access preamble via a random access occasion (RO) in accordance with a cyclic shift (CS) and a CS offset. The UE may receive, from a network entity, a first response message that indicates information associated with one or more random access paths detected by a network entity within a threshold duration. The UE may determine whether one or more collisions occur based on the information and may refrain from transmitting a random access message when two or more estimated random access paths are detected within a threshold duration of its CS and CS offset. The UE may receive a second response message based on refraining from transmitting the random access message. The UE may establish a connection with the network entity based on receiving the second response message.

## Claims

### Claim 1

A user equipment (UE), 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:
transmit a random access preamble via a random access occasion in accordance with a cyclic shift of a set of candidate cyclic shifts and with a cyclic shift offset of a set of candidate cyclic shift offsets;
receive, based at least in part on transmitting the random access preamble, a first response message indicating information associated with one or more estimated random access paths corresponding to one or more random access preambles received by a network entity within a duration, the information comprising an indication of a set of resources for transmitting a random access message of a random access procedure;
refrain from transmitting the random access message when two or more estimated random access paths indicated by the first response message are detected within a threshold duration of the cyclic shift and the cyclic shift offset; and
receive, based at least in part on refraining from transmitting the random access message, a second response message comprising second information indicating a second set of resources for transmitting a second random access preamble associated with a second random access procedure.

### Claim 2 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
select the cyclic shift offset from the set of candidate cyclic shift offsets based at least in part on a pseudo-random function.

### Claim 3 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
receive, prior to transmitting the random access preamble, an indication of the set of candidate cyclic shift offsets; and
select the cyclic shift offset from the set of candidate cyclic shift offsets based at least in part on receiving the indication, wherein transmitting the random access preamble is based at least in part on selecting the cyclic shift offset.

### Claim 4 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
transmit the random access message when a single estimated random access path indicated by the first response message is detected within the threshold duration of the cyclic shift and the cyclic shift offset;
receive a third response message based at least in part on transmitting the random access message; and
establish a connection with a serving cell of the network entity based at least in part on receiving the third response message.

### Claim 5 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
transmit the second random access preamble in accordance with a second random access occasion indicated by the second set of resources based at least in part on receiving the second response message.

### Claim 6 (depends on 5)

The UE of claim 5, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
receive a third response message based at least in part on transmitting the second random access preamble;
transmit a second random access message based at least in part on receiving the third response message; and
establish a connection with a serving cell of the network entity based at least in part on transmitting the second random access message.

### Claim 7 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
receive, via the first response message, an indication of one or more detected cyclic shifts that are detected by the network entity within the duration, each of the one or more detected cyclic shifts corresponding to a respective estimated random access path of the one or more estimated random access paths.

### Claim 8 (depends on 7)

The UE of claim 7, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
calculate, when a single estimated random access path is detected within the threshold duration of the cyclic shift and the cyclic shift offset, a timing advance based at least in part on a difference between a detected cyclic shift and the cyclic shift and the cyclic shift offset used for transmitting the random access preamble; and
transmit the random access message based at least in part on calculating the timing advance.

### Claim 9 (depends on 1)

The UE of claim 1, wherein:
the information further comprises a transmit power control command for each random access path of the one or more estimated random access paths, and
the random access message is transmitted in accordance with the transmit power control command.

### Claim 10 (depends on 1)

The UE of claim 1, wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to:
compare each of the one or more estimated random access paths to the threshold duration; and
detect a quantity of the one or more estimated random access paths within the threshold duration of the cyclic shift and the cyclic shift offset based at least in part on the comparing.

### Claim 11 (depends on 1)

The UE of claim 1, wherein the threshold duration is associated with a round trip time (RTT) between a serving cell and the UE.

### Claim 12

A network entity, 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:
detect a first random access path and a second random access path based at least in part on one or more transmissions of a first random access preamble obtained during a first random access occasion;
output, based at least in part on detecting the first random access path and the second random access path, a first response message comprising information associated with one or more estimated random access paths comprising at least the first random access path and the second random access path, the information comprising an indication of a first set of resources for transmitting a random access message of a first random access procedure;
obtain a first random access message associated with the first random access path based at least in part on outputting the first response message; and
output a second response message associated with the second random access path based at least in part on failing to receive a second random access message associated with the second random access path, the second response message comprising second information associated with a second set of resources for transmitting a second random access preamble associated with a second random access procedure.

### Claim 13 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
allocate, prior to outputting the first response message, the first set of resources for transmitting the random access message, the first set of resources comprising one or more second random access occasions associated with the first random access procedure.

### Claim 14 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
detect a third random access path based at least in part on the one or more transmissions of the first random access preamble obtained during the first random access occasion; and
obtain a third random access message associated with the third random access path based at least in part on outputting the first response message, the third random access message corresponds to a third user equipment (UE).

### Claim 15 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
determine that a collision occurred between the first random access path and the second random access path based at least in part on failing to receive the second random access message, wherein outputting the second response message is based at least in part on determining that the collision occurred.

### Claim 16 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
output, prior to detecting the first random access path and the second random access path, an indication of a set of candidate cyclic shift offsets, wherein obtaining the one or more transmissions of the first random access preamble is based at least in part on outputting the indication of the set of candidate cyclic shift offsets.

### Claim 17 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
output a third response message based at least in part on obtaining the first random access message; and
establish a connection with a first user equipment (UE) associated with the first random access path based at least in part on outputting the third response message.

### Claim 18 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
obtain the second random access preamble in accordance with the second set of resources based at least in part on outputting the second response message; and
output a third response message based at least in part on obtaining the second random access preamble.

### Claim 19 (depends on 18)

The network entity of claim 18, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
obtain a third random access message based at least in part on outputting the third response message; and
establish a connection with a second user equipment (UE) associated with the second random access path based at least in part on obtaining the third random access message.

### Claim 20 (depends on 12)

The network entity of claim 12, wherein the one or more processors are individually or collectively further operable to execute the code to cause the network entity to:
output, via the first response message, an indication of one or more detected cyclic shifts that are detected by the network entity within the first random access occasion, each of the one or more detected cyclic shifts corresponding to a respective estimated random access path of the one or more estimated random access paths.

### Claim 21

A method for wireless communications at a user equipment (UE), comprising:
transmitting a random access preamble via a random access occasion in accordance with a cyclic shift of a set of candidate cyclic shifts and with a cyclic shift offset of a set of candidate cyclic shift offsets;
receiving, based at least in part on transmitting the random access preamble, a first response message indicating information associated with one or more estimated random access paths corresponding to one or more random access preambles received by a network entity within a duration, the information comprising an indication of a set of resources for transmitting a random access message of a random access procedure;
refraining from transmitting the random access message when two or more estimated random access paths indicated by the first response message are detected within a threshold duration of the cyclic shift and the cyclic shift offset; and
receiving, based at least in part on refraining from transmitting the random access message, a second response message comprising second information indicating a second set of resources for transmitting a second random access preamble associated with a second random access procedure.

### Claim 22 (depends on 21)

The method of claim 21, further comprising:
selecting the cyclic shift offset from the set of candidate cyclic shift offsets based at least in part on a pseudo-random function.

### Claim 23 (depends on 21)

The method of claim 21, further comprising:
receiving, prior to transmitting the random access preamble, an indication of the set of candidate cyclic shift offsets; and
selecting the cyclic shift offset from the set of candidate cyclic shift offsets based at least in part on receiving the indication, wherein transmitting the random access preamble is based at least in part on selecting the cyclic shift offset.

### Claim 24 (depends on 21)

The method of claim 21, further comprising:
transmitting the random access message when a single estimated random access path indicated by the first response message is detected within the threshold duration of the cyclic shift and the cyclic shift offset;
receiving a third response message based at least in part on transmitting the random access message; and
establishing a connection with a serving cell of the network entity based at least in part on receiving the third response message.

### Claim 25

A method for wireless communications at a network entity, comprising:
detecting a first random access path and a second random access path based at least in part on one or more transmissions of a first random access preamble obtained during a first random access occasion;
outputting, based at least in part on detecting the first random access path and the second random access path, a first response message comprising information associated with one or more estimated random access paths comprising at least the first random access path and the second random access path, the information comprising an indication of a first set of resources for transmitting a random access message of a first random access procedure;
obtaining a first random access message associated with the first random access path based at least in part on outputting the first response message; and
outputting a second response message associated with the second random access path based at least in part on failing to receive a second random access message associated with the second random access path, the second response message comprising second information associated with a second set of resources for transmitting a second random access preamble associated with a second random access procedure.

### Claim 26 (depends on 25)

The method of claim 25, further comprising:
allocating, prior to outputting the first response message, the first set of resources for transmitting the random access message, the first set of resources comprising one or more second random access occasions associated with the first random access procedure.

### Claim 27 (depends on 25)

The method of claim 25, further comprising:
detecting a third random access path based at least in part on the one or more transmissions of the first random access preamble obtained during the first random access occasion; and
obtaining a third random access message associated with the third random access path based at least in part on outputting the first response message, the third random access message corresponds to a third user equipment (UE).

### Claim 28 (depends on 25)

The method of claim 25, further comprising:
determining that a collision occurred between the first random access path and the second random access path based at least in part on failing to receive the second random access message, wherein outputting the second response message is based at least in part on determining that the collision occurred.

### Claim 29 (depends on 25)

The method of claim 25, further comprising:
outputting, prior to detecting the first random access path and the second random access path, an indication of a set of candidate cyclic shift offsets, wherein obtaining the one or more transmissions of the first random access preamble is based at least in part on outputting the indication of the set of candidate cyclic shift offsets.

### Claim 30 (depends on 25)

The method of claim 25, further comprising:
outputting a third response message based at least in part on obtaining the first random access message; and
establishing a connection with a first user equipment (UE) associated with the first random access path based at least in part on outputting the third response message.
