# US 2026/0095957 A1 · Method and Apparatus for Random Access

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

- Number: US 2026/0095957 A1
- Document ID: US20260095957A1
- Status: Published application
- Kind: A1
- Application number: 19/411,504
- Filed: 2025-12-08
- Published: 2026-04-02
- Earliest claimed: 2020-08-07
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ).
- Inventors: Zhipeng Lin
- Web page: https://patentgrep.com/patent/US20260095957A1

## CPC

- H04W 72/04: Wireless resource allocation
- H04W 74/0841: {with collision treatment}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Various embodiments of the present disclosure provide a method for random access. The method which may be performed by a terminal device comprises determining a resource overhead for transmission of an uplink shared channel of a message. The message includes data on the uplink shared channel and a random access preamble. The method further comprises transmitting the data on the uplink shared channel of the message to a network node, based at least in part on the determined resource overhead. According to various embodiments of the present disclosure, the resource overhead for message A physical uplink shared channel transmission may be configured flexibly, and the transport block size for message A physical uplink shared channel transmission can be determined adaptively.

## Claims

### Claim 1

A method performed by a terminal device, the method comprising:
determining a resource overhead for transmission of an uplink shared channel of a message, wherein the message includes data on the uplink shared channel and a random access preamble; and
transmitting the data on the uplink shared channel of the message to a network node, based at least in part on the determined resource overhead.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising receiving overhead information from the network node in system information or dedicated radio resource control signaling, wherein the resource overhead for the transmission of the uplink shared channel of the message is determined according to the overhead information.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the overhead information is included in common radio resource control signaling, when the terminal device is in radio resource control idle or inactive mode, or in a two-step contention-based random access procedure.

### Claim 4 (depends on 2)

The method according to claim 2, wherein the overhead information is included in the dedicated radio resource control signaling, when the terminal device is in radio resource control connected mode, or in a two-step contention-free random access procedure.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the resource overhead has a predetermined or fixed value.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the resource overhead has different values for two-step contention-based random access and two-step contention-free random access.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the resource overhead is 0 for two-step contention-based random access.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the resource overhead is 6 for two-step contention-free random access.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the resource overhead is 0 for both of two-step contention-based random access and two-step contention-free random access.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the resource overhead is a number of resources allocated for transmission of any other signals in the message.

### Claim 11

A terminal device comprising:
one or more processors; and
one or more memories comprising computer program codes,
the one or more memories and the computer program codes configured to, with the one or more processors, cause the terminal device at least to:
determine a resource overhead for transmission of an uplink shared channel of a message, wherein the message includes data on the uplink shared channel and a random access preamble; and
transmit the data on the uplink shared channel of the message to a network node, based at least in part on the determined resource overhead.

### Claim 12

A method performed by a network node, the method comprising:
determining a resource overhead for transmission of an uplink shared channel of a message, wherein the message includes data on the uplink shared channel and a random access preamble; and
receiving the data on the uplink shared channel of the message from a terminal device, based at least in part on the determined resource overhead.

### Claim 13 (depends on 12)

The method according to claim 12, further comprising:
transmitting overhead information to the terminal device in system information or dedicated radio resource control signaling, wherein the overhead information indicates the resource overhead for the transmission of the uplink shared channel of the message.

### Claim 14 (depends on 13)

The method according to claim 13, wherein the overhead information is included in common radio resource control signaling, when the terminal device is in radio resource control idle or inactive mode, or in a two-step contention-based random access procedure.

### Claim 15 (depends on 14)

The method according to claim 14, wherein the overhead information is included in the dedicated radio resource control signaling, when the terminal device is in radio resource control connected mode, or in a two-step contention-free random access procedure.

### Claim 16 (depends on 12)

The method according to claim 12, wherein the resource overhead has a predetermined or fixed value.

### Claim 17 (depends on 12)

The method according to claim 12, wherein the resource overhead has different values for two-step contention-based random access and two-step contention-free random access.

### Claim 18

The method according to 12, wherein the resource overhead is 0 for two-step contention-based random access.

### Claim 19 (depends on 12)

The method according to claim 12, wherein the resource overhead is 0 for both of two-step contention-based random access and two-step contention-free random access.

### Claim 20

A network node comprising:
one or more processors; and
one or more memories comprising computer program codes,
the one or more memories and the computer program codes configured to, with the one or more processors, cause the network node at least to:
determine a resource overhead for transmission of an uplink shared channel of a message, wherein the message includes data on the uplink shared channel and a random access preamble; and
receive the data on the uplink shared channel of the message from a terminal device, based at least in part on the determined resource overhead.
