# US 2021/0345422 A1 · Information transmission method for a random access process and terminal

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

- Number: US 2021/0345422 A1
- Document ID: US20210345422A1
- Status: Published application
- Kind: A1
- Application number: 17/378,560
- Filed: 2021-07-16
- Published: 2021-11-04
- Earliest claimed: 2019-01-18
- Assignees: Vivo Mobile Communication Co., Ltd.
- Applicants: Vivo Mobile Communication Co., Ltd.
- Inventors: Xiaohang CHEN
- Web page: https://patentgrep.com/patent/US20210345422A1

## CPC

- H04W 74/0833: Random access procedures, e.g. with 4-step access
- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)}
- H04L 5/0094: {Indication of how sub-channels of the path are allocated}
- H04W 72/044: based on the type of the allocated resource
- H04L 5/0026: {Division using four or more dimensions, e.g. beam steering or quasi-co-location [QCL]}
- H04W 74/006: {in the downlink, i.e. towards the terminal}
- H04W 74/0836: with 2-step access
- H04W 74/0838: using contention-free random access [CFRA]
- 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)

## Abstract

An information transmission method for a random access process includes: obtaining a preset mapping relationship between a physical uplink shared channel resource and a physical random access channel resource; and sending a random access message on a random access resource according to the preset mapping relationship. The random access resource comprises the PUSCH resource and the PRACH resource. When a random access channel occasion corresponding to the PRACH resource is not associated with an SSB, the RO is not associated with the PUSCH resource.

## Claims

### Claim 1

An information transmission method for a random access process, applied to a terminal side, wherein the information transmission method for a random access process comprises:
obtaining a preset mapping relationship between a physical uplink shared channel (PUSCH) resource and a physical random access channel (PRACH) resource; and
sending a random access message on a random access resource according to the preset mapping relationship, wherein the random access resource comprises the PUSCH resource and the PRACH resource, when a random access channel occasion (RO) corresponding to the PRACH resource is not associated with a synchronization signal block (SSB), the RO is not associated with the PUSCH resource.

### Claim 2 (depends on 1)

The information transmission method for a random access process according to claim 1, wherein the preset mapping relationship comprises:
a first mapping relationship between the PUSCH resource of the random access resource and the RO corresponding to the PRACH resource; or
a second mapping relationship between the PUSCH resource of the random access resource and an SSB corresponding to the PRACH resource.

### Claim 3 (depends on 2)

The information transmission method for a random access process according to claim 2, wherein the first mapping relationship indicates that N PUSCH resources are associated with one RO, wherein one RO corresponds to R random access preambles, and N and R are both positive integers.

### Claim 4 (depends on 2)

The information transmission method for a random access process according to claim 2, wherein the second mapping relationship indicates that N PUSCH resources are associated with one SSB, wherein one SSB corresponds to R random access preambles of one RO, and N and R are both positive integers.

### Claim 5 (depends on 3)

The information transmission method for a random access process according to claim 3, wherein each of the R random access preambles is associated with the N PUSCH resources.

### Claim 6 (depends on 3)

The information transmission method for a random access process according to claim 3, wherein when R is less than N, P of the R random access preambles are associated with ceil(N, R) PUSCH resources, and (R-P) of the R random access preambles are associated with floor(N, R) PUSCH resources; wherein P=mod(N, R).

### Claim 7 (depends on 3)

The information transmission method for a random access process according to claim 3, wherein when R is greater than or equal to N, Q of the N PUSCH resources are associated with ceil(R, N) random access preambles, and (N-Q) of the N PUSCH resources are associated with floor(R, N) random access preambles; wherein Q=mod(R, N).

### Claim 8 (depends on 3)

The information transmission method for a random access process according to claim 3, wherein each random access preamble in an X group is associated with a PUSCH resource in a Y group, and each random access preamble in an (M-X) group is associated with a PUSCH resource in an (M-Y) group; wherein M is a positive integer, X=mod(R, M), and Y=mod(N, M).

### Claim 9 (depends on 1)

The information transmission method for a random access process according to claim 1, wherein at least a part of time-frequency domain resources of at least two PUSCH resources corresponding to the PRACH resource does not overlap.

### Claim 10

A terminal, wherein the terminal comprises a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, causes the terminal to perform:
obtaining a preset mapping relationship between a physical uplink shared channel (PUSCH) resource and a physical random access channel (PRACH) resource; and
sending a random access message on a random access resource according to the preset mapping relationship, wherein the random access resource comprises the PUSCH resource and the PRACH resource, when a random access channel occasion (RO) corresponding to the PRACH resource is not associated with a synchronization signal block (SSB), the RO is not associated with the PUSCH resource.

### Claim 11 (depends on 10)

The terminal according to claim 10, wherein the preset mapping relationship comprises:
a first mapping relationship between the PUSCH resource of the random access resource and the RO corresponding to the PRACH resource; or
a second mapping relationship between the PUSCH resource of the random access resource and an SSB corresponding to the PRACH resource.

### Claim 12 (depends on 11)

The terminal according to claim 11, wherein the first mapping relationship indicates that N PUSCH resources are associated with one RO, wherein one RO corresponds to R random access preambles, and N and R are both positive integers.

### Claim 13 (depends on 11)

The terminal according to claim 11, wherein the second mapping relationship indicates that N PUSCH resources are associated with one SSB, wherein one SSB corresponds to R random access preambles of one RO, and N and R are both positive integers.

### Claim 14 (depends on 12)

The terminal according to claim 12, wherein each of the R random access preambles is associated with the N PUSCH resources.

### Claim 15 (depends on 12)

The terminal according to claim 12, wherein when R is less than N, P of the R random access preambles are associated with ceil(N, R) PUSCH resources, and (R-P) of the R random access preambles are associated with floor(N, R) PUSCH resources; wherein P=mod(N, R).

### Claim 16

A non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores a computer program, and the computer program, when executed by a processor, causes the processor to perform:
obtaining a preset mapping relationship between a physical uplink shared channel (PUSCH) resource and a physical random access channel (PRACH) resource; and
sending a random access message on a random access resource according to the preset mapping relationship, wherein the random access resource comprises the PUSCH resource and the PRACH resource, when a random access channel occasion (RO) corresponding to the PRACH resource is not associated with a synchronization signal block (SSB), the RO is not associated with the PUSCH resource.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium according to claim 16, wherein the preset mapping relationship comprises:
a first mapping relationship between the PUSCH resource of the random access resource and the RO corresponding to the PRACH resource; or
a second mapping relationship between the PUSCH resource of the random access resource and an SSB corresponding to the PRACH resource.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium according to claim 17, wherein the first mapping relationship indicates that N PUSCH resources are associated with one RO, wherein one RO corresponds to R random access preambles, and N and R are both positive integers.

### Claim 19 (depends on 17)

The non-transitory computer-readable storage medium according to claim 17, wherein the second mapping relationship indicates that N PUSCH resources are associated with one SSB, wherein one SSB corresponds to R random access preambles of one RO, and N and R are both positive integers.

### Claim 20 (depends on 18)

The non-transitory computer-readable storage medium according to claim 18, wherein each of the R random access preambles is associated with the N PUSCH resources.
