# US 2026/0095277 A1 · Reduced overhead signaling of references for resolving collisions

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

- Number: US 2026/0095277 A1
- Document ID: US20260095277A1
- Status: Published application
- Kind: A1
- Application number: 18/905,048
- Filed: 2024-10-02
- Published: 2026-04-02
- Earliest claimed: 2024-10-02
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Harikumar KRISHNAMURTHY; Alberto RICO ALVARINO; Ayan SENGUPTA
- Web page: https://patentgrep.com/patent/US20260095277A1

## CPC

- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 1/189: {Transmission or retransmission of more than one copy of a message}
- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L 5/006: {Quality of the received signal, e.g. BER, SNR, water filling}
- H04W 74/0838: using contention-free random access [CFRA]
- H04L 5/0092: {Indication of how the channel is divided}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive, from a network node, a transmission configuration associated with a set of transmission occasions comprising two or more transmission occasions that are each associated with a set of resources for contention-based transmissions. The UE may transmit, to the network node, a plurality of copies of a message in a plurality of transmission occasions selected from the set of transmission occasions, wherein each copy of the message is transmitted in a resource selected from the set of resources, and wherein each copy of the message includes a reference associated with one or more other copies of the message. Numerous other aspects are described.

## Claims

### Claim 1

A user equipment (UE) for wireless communication, comprising:
one or more memories; and
one or more processors, coupled to the one or more memories, configured to cause the UE to:
receive, from a network node, a transmission configuration associated with a set of transmission occasions comprising two or more transmission occasions that are each associated with a set of resources for contention-based transmissions; and
transmit, to the network node, a plurality of copies of a message in a plurality of transmission occasions selected from the set of transmission occasions, wherein each copy of the message is transmitted in a resource selected from the set of resources, and wherein each copy of the message includes a reference associated with one or more other copies of the message.

### Claim 2 (depends on 1)

The UE of claim 1, wherein the reference indicates at least one of a transmission occasion or a resource associated with each copy of the message.

### Claim 3 (depends on 1)

The UE of claim 1, wherein the reference indicates at least one of a transmission occasion or a resource associated with a subset of the plurality of copies of the message.

### Claim 4 (depends on 1)

The UE of claim 1, wherein the one or more processors further cause the UE to:
select at least one of the resource or the plurality of transmission occasions based on a pseudo random number generator that is seeded with a reference value associated with the reference.

### Claim 5 (depends on 4)

The UE of claim 4, wherein the reference value is a function of a random access occasion group number or a radio frame number associated with the plurality of copies of the message.

### Claim 6 (depends on 4)

The UE of claim 4, wherein the reference value is based on a hash value of data within the plurality of copies of the message.

### Claim 7 (depends on 1)

The UE of claim 1, wherein the one or more processors further cause the UE to:
generate a seed value based on a hash value of data within the plurality of messages;
generate a resource offset based on a pseudo random number generator (PRNG) that is seeded with the seed value; and
select either the plurality of transmission occasions or the resource associated with each copy of the message according to a randomly-generated reference resource or according to the resource offset applied to the randomly-generated reference resource.

### Claim 8 (depends on 1)

The UE of claim 1, wherein the one or more processors further cause the UE to:
generate a seed value based on a hash value of data within the plurality of messages;
select the plurality of transmission occasions based on a pseudo random number generator (PRNG) that is seeded with the seed value;
generate a resource offset based on the PRNG that is seeded with the seed value; and
select the resource associated with each copy of the message according to a randomly-generated reference resource or according to the resource offset applied to the randomly-generated reference resource.

### Claim 9

A network node for wireless communication, comprising:
one or more memories; and
one or more processors, coupled to the one or more memories, configured to cause the network node to:
receive, from a user equipment (UE), a plurality of copies of a message in a plurality of transmission occasions selected from a set of transmission occasions comprising two or more transmission occasions that are each associated with a set of resources for contention-based transmissions, wherein each copy of the message is transmitted in a resource selected from a set of resources for contention-based transmissions, and wherein each copy of the message includes a reference associated with one or more other copies of the message;
decode a copy of the message and the reference included with the copy of the message;
identify a transmission occasion of each remaining copy of the message based on the decoded reference associated with the decoded copy of the message; and
perform signal interference cancellation on the remaining copies of the message based on the decoded copy of the message.

### Claim 10 (depends on 9)

The network node of claim 9, wherein the reference indicates at least one of a transmission occasion or a resource associated with each copy of the message.

### Claim 11 (depends on 9)

The network node of claim 9, wherein the decoded reference indicates at least one of a transmission occasion or a resource associated with a subset of the plurality of copies of the message.

### Claim 12 (depends on 9)

The network node of claim 9, wherein at least one of the resource or the plurality of transmission occasions are identified based on a pseudo random number generator that is seeded with a reference value associated with the decoded reference.

### Claim 13 (depends on 12)

The network node of claim 12, wherein the reference value is a function of a random access occasion group number or a radio frame number associated with the plurality of copies of the message.

### Claim 14 (depends on 12)

The network node of claim 12, wherein the reference value is associated with a hash value generated based on data within the decoded copy of the message.

### Claim 15 (depends on 9)

The network node of claim 9, wherein the one or more processors are further configured to cause the network node to:
hash data within the decoded copy of the message to obtain a seed value; and
identify one or more of the plurality of transmission occasions or the resources associated with the plurality of copies of the message based on a pseudo random number generator that is seeded with the seed value.

### Claim 16

A method of wireless communication performed by a user equipment (UE), comprising:
receiving, from a network node, a transmission configuration associated with a set of transmission occasions comprising two or more transmission occasions that are each associated with a set of resources for contention-based transmissions; and
transmitting, to the network node, a plurality of copies of a message in a plurality of transmission occasions selected from the set of transmission occasions, wherein each copy of the message is transmitted in a resource selected from the set of resources, and wherein each copy of the message includes a reference associated with one or more other copies of the message.

### Claim 17 (depends on 16)

The method of claim 16, wherein the reference indicates at least one of a transmission occasion or a resource associated with each copy of the message.

### Claim 18 (depends on 16)

The method of claim 16, wherein the reference indicates at least one of a transmission occasion or a resource associated with a subset of the plurality of copies of the message.

### Claim 19 (depends on 16)

The method of claim 16, further comprising:
selecting at least one of the resource or the plurality of transmission occasions based on a pseudo random number generator that is seeded with a reference value associated with the reference.

### Claim 20 (depends on 19)

The method of claim 19, wherein the reference value is randomly generated.

### Claim 21 (depends on 19)

The method of claim 19, wherein the reference value is a function of a random access occasion group number or a radio frame number associated with the plurality of copies of the message.

### Claim 22 (depends on 19)

The method of claim 19, wherein the reference value is based on a hash value of data within the message.

### Claim 23 (depends on 16)

The method of claim 16, further comprising:
generating a seed value based on a hash value of data within the plurality of messages;
generating a resource offset based on a pseudo random number generator (PRNG) that is seeded with the seed value; and
selecting either the plurality of transmission occasions or the resource associated with each copy of the message according to a randomly-generated reference resource or according to the resource offset applied to the randomly-generated reference resource.

### Claim 24 (depends on 16)

The method of claim 16, wherein the selected resource includes at least one of a time resource, a frequency resource, or an orthogonal cover code associated with the transmission.

### Claim 25

A method of wireless communication performed by a network node, comprising:
receiving, from a user equipment (UE), a plurality of copies of a message in a plurality of transmission occasions selected from a set of transmission occasions comprising two or more transmission occasions that are each associated with a set of resources for contention-based transmissions, wherein each copy of the message is transmitted in a resource selected from a set of resources for contention-based transmissions, and wherein each copy of the message includes a reference associated with one or more other copies of the message;
decoding a copy of the message and the reference included with the copy of the message;
identifying a transmission occasion of each remaining copy of the message based on the decoded reference associated with the decoded copy of the message; and
performing successive interference cancellation on the remaining copies of the message based on the decoded copy of the message.

### Claim 26 (depends on 25)

The method of claim 25, wherein the reference indicates at least one of a transmission occasion or a resource associated with each copy of the message.

### Claim 27 (depends on 25)

The method of claim 25, wherein the decoded reference indicates at least one of a transmission occasion or a resource associated with a subset of the plurality of copies of the message.

### Claim 28 (depends on 25)

The method of claim 25, wherein the plurality of transmission occasions are identified based on a pseudo random number generator that is seeded with a reference value associated with the decoded reference.

### Claim 29 (depends on 28)

The method of claim 28, wherein the reference value is a function of a random access occasion group number or a radio frame number associated with the plurality of copies of the message.

### Claim 30 (depends on 28)

The method of claim 28, wherein the reference value is associated with a hash value generated based on data within the decoded copy of the message.
