US 12,414,140 B2
Complexity handling for physical downlink control channel repetition
Mostafa Khoshnevisan, San Diego, CA (US); Hari Sankar, San Diego, CA (US); Jae Ho Ryu, San Diego, CA (US); and Hobin Kim, San Diego, CA (US)
Assigned to QUALCOMM Incorporated, San Diego, CA (US)
Filed by QUALCOMM Incorporated, San Diego, CA (US)
Filed on Aug. 3, 2022, as Appl. No. 17/817,230.
Claims priority of provisional application 63/203,962, filed on Aug. 5, 2021.
Prior Publication US 2023/0048970 A1, Feb. 16, 2023
Int. Cl. H04W 72/51 (2023.01); H04L 1/08 (2006.01); H04L 5/00 (2006.01); H04W 72/23 (2023.01); H04W 72/044 (2023.01)
CPC H04W 72/51 (2023.01) [H04L 1/08 (2013.01); H04L 5/001 (2013.01); H04L 5/0053 (2013.01); H04W 72/23 (2023.01); H04W 72/044 (2013.01)] 30 Claims
OG exemplary drawing
 
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, individually or collectively configured to cause the UE to:
transmit, to a network node, an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limit associated with the UE; and
receive, from the network node, configurations for a plurality of search space sets for PDCCH candidates, wherein the plurality of search space sets includes one or more linked pairs of search space sets with linked PDCCH candidates for PDCCH repetition, and wherein the configurations for the one or more linked pairs of search space sets are based at least in part on the PPU limit associated with the UE, wherein the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, where each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and wherein each pair of linked PDCCH candidates occupies a number of PPUs for a duration associated with that pair of linked PDCCH candidates.