# US 2024/0205959 A1 · Methods and apparatus of enhanced candidate allocation schemes for enhanced pdcch

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

- Number: US 2024/0205959 A1
- Document ID: US20240205959A1
- Status: Published application
- Kind: A1
- Application number: 18/551,243
- Filed: 2021-03-22
- Published: 2024-06-20
- Earliest claimed: 2021-03-22
- Assignees: Lenovo (Beijing) Limited
- Applicants: Lenovo (Beijing) Limited
- Inventors: Yi Zhang; Chenxi Zhu; Bingchao Liu; Wei Ling; Lingling Xiao
- Web page: https://patentgrep.com/patent/US20240205959A1

## CPC

- H04W 72/56: based on priority criteria
- H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 5/0023: {Time-frequency-space}
- H04L 5/0035: {Resource allocation in a cooperative multipoint environment}
- 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

Methods and apparatus of enhanced candidate allocation schemes for enhanced PDCCH are disclosed. The method includes: receiving, by a receiver, configurations of a plurality of search space sets that are linked for a Physical Downlink Control Channel (PDCCH) transmission with a plurality of repetitions; wherein the plurality of repetitions of the PDCCH are transmitted on a plurality of candidates; determining, by a processor, according to a priority rule with a predefined granularity, by counting the candidates from the linked search space sets, whether there is sufficient candidate resource available for allocation; and allocating, by the processor, the candidates, upon determining that there is sufficient candidate resource available for allocation.

## Claims

### Claim 1

A method, comprising:
receiving configurations of search space sets that are linked for a physical downlink control channel (PDCCH) transmission with a plurality of repetitions that are transmitted on candidates;
determining, according to a priority rule with a predefined granularity, by counting the candidates from the linked search space sets, whether there is sufficient candidate resource available for allocation; and
allocating the candidates based on the determining that there is the sufficient candidate resource available for allocation.

### Claim 2 (depends on 1)

The method of claim 1, wherein, based on the determining that there is insufficient candidate resource available for allocation, the candidates are dropped with a granularity of the linked search space sets.

### Claim 3 (depends on 1)

The method of claim 1, wherein the priority rule comprises one of the linked search space sets as a reference search space set, and wherein a priority of the linked search space sets is determined based on an identifier (ID) of the reference search space set.

### Claim 4 (depends on 3)

The method of claim 3, wherein a smaller ID of a search space set represents a higher priority.

### Claim 5 (depends on 3)

The method of claim 3, wherein the reference search space set is one of the linked search space sets with a smaller ID.

### Claim 6

(canceled)

### Claim 7 (depends on 1)

The method of claim 1, wherein the candidates are linked as candidate pairs, and based on the determining that there is insufficient candidate resource available for allocation, the candidates are dropped with granularity of a linked candidate pair.

### Claim 8 (depends on 7)

The method of claim 7, wherein the candidate pairs are allocated according to an order in a concatenated candidate set according to one of multiple concatenation schemes comprising:
a first scheme at a first level on a candidate pair in one aggregation, and a second level on an aggregation level;
a second scheme at the first level on the candidate pair in the one aggregation, and the second level on the aggregation level in a reverse order; or
a third scheme at the first level on the aggregation level in the reverse order, and the second level on the candidate pair in the one aggregation.

### Claim 9 (depends on 1)

The method of claim 1, wherein the candidates from the linked search space sets are counted jointly.

### Claim at position 10

10-13. (canceled)

### Claim 14 (depends on 1)

The method of claim 1, wherein two of the linked search space sets are configured with successive search space set identifiers (IDs).

### Claim 15

(canceled)

### Claim 16

A user equipment (UE) for wireless communication, comprising:
at least one memory; and
at least one processor coupled with the at least one memory and configured to cause the UE to:
receive configurations of search space sets that are linked for a physical downlink control channel (PDCCH) transmission with a plurality of repetitions that are transmitted on candidates; and
allocate the candidates based on a determination that there is sufficient candidate resource available for allocation, the determination according to a priority rule with a predefined granularity, and by counting the candidates from the linked search space sets.

### Claim 17 (depends on 16)

The UE of claim 16, wherein, based on a determination that there is insufficient candidate resource available for allocation, the candidates are dropped with a granularity of the linked search space sets.

### Claim 18 (depends on 16)

The UE of claim 16, wherein the priority rule comprises one of the linked search space sets as a reference search space set, and wherein a priority of the linked search space sets is determined based on an identifier (ID) of the reference search space set.

### Claim 19 (depends on 18)

The UE of claim 18, wherein a smaller ID of a search space set represents a higher priority.

### Claim 20 (depends on 18)

The UE of claim 18, wherein the reference search space set is one of the linked search space sets with a smaller ID.

### Claim 21 (depends on 16)

The UE of claim 16, wherein the candidates are linked as candidate pairs, and based on a determination that there is insufficient candidate resource available for allocation, the candidates are dropped with granularity of a linked candidate pair.

### Claim 22 (depends on 20)

The UE of claim 20, wherein the candidate pairs are allocated according to an order in a concatenated candidate set according to one of multiple concatenation schemes comprising:
a first scheme at a first level on a candidate pair in one aggregation, and a second level on an aggregation level;
a second scheme at the first level on the candidate pair in the one aggregation, and the second level on the aggregation level in a reverse order; or
a third scheme at the first level on the aggregation level in the reverse order, and the second level on the candidate pair in the one aggregation.

### Claim 23 (depends on 16)

The UE of claim 16, wherein the candidates from the linked search space sets are counted jointly.

### Claim 24 (depends on 16)

The UE of claim 16, wherein two of the linked search space sets are configured with successive search space set identifiers (IDs).

### Claim 25

A processor for wireless communication, comprising:
at least one controller coupled with at least one memory and configured to cause the processor to:
receive configurations of search space sets that are linked for a physical downlink control channel (PDCCH) transmission with a plurality of repetitions that are transmitted on candidates; and
allocate the candidates based on a determination that there is sufficient candidate resource available for allocation, the determination according to a priority rule with a predefined granularity, and by counting the candidates from the linked search space sets.

### Claim 26

A network equipment (NE) for wireless communication, comprising:
at least one memory; and
at least one processor coupled with the at least one memory and configured to cause the NE to:
transmit configurations of search space sets that are linked for a physical downlink control channel (PDCCH) transmission with a plurality of repetitions that are to be transmitted on candidates;
allocate the candidates based on a determination that there is sufficient candidate resource available for allocation, the determination according to a priority rule with a predefined granularity, and by counting the candidates from the linked search space sets; and
transmit the plurality of repetitions of the PDCCH on the candidates.
