User equipment complexity reduction for physical downlink control channel repetition reception
US-2022304037-A1 · Sep 22, 2022 · US
US12414140B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12414140-B2 |
| Application number | US-202217817230-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 3, 2022 |
| Priority date | Aug 5, 2021 |
| Publication date | Sep 9, 2025 |
| Grant date | Sep 9, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may transmit, to a network node, an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limit associated with the UE. The UE may receive configurations for a plurality of search space sets, wherein the plurality of search space sets includes one or more linked pairs of search space sets with linked PDCCH candidates for PDCCH repetition. The configurations of the one or more linked pairs of search space sets may be based at least in part on the PPU limit associated with the UE. Numerous other aspects are described.
Opening claim text (preview).
What is claimed is: 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. 2. The UE of claim 1 , wherein the one or more processors are individually or collectively configured to cause the UE to: monitor the linked PDCCH candidates in the one or more linked pairs of search space sets based at least in part on the configurations for the one or more linked pairs of search space sets. 3. The UE of claim 1 , wherein the one or more processors are individually or collectively configured to cause the UE to: calculate a total number of PPUs occupied by the linked PDCCH candidates in all of the one or more linked pairs of search space sets at one or more time points associated with linked pairs of monitoring occasions associated with the one or more linked pairs of search space sets. 4. The UE of claim 1 , wherein, for each pair of linked PDCCH candidates, the number of PPUs occupied by that pair of linked PDCCH candidates is based at least in part on an aggregation level associated with that pair of linked PDCCH candidates. 5. The UE of claim 1 , wherein, for each pair of linked PDCCH candidates, the number of PPUs occupied by that pair of linked PDCCH candidates is based at least in part on a mother code length for an aggregation level associated with that pair of linked PDCCH candidates. 6. The UE of claim 1 , wherein, for each pair of linked PDCCH candidates, the number of PPUs occupied by that pair of linked PDCCH candidates is equal to a first value in connection with an aggregation level of 1 associated with that pair of linked PDCCH candidates, a second value, larger than the first value, in connection with an aggregation level of 2 associated with that pair of linked PDCCH candidates, or a third value, larger than the second value, in connection with an aggregation level of 4, 8, or 16 associated with that pair of linked PDCCH candidates. 7. The UE of claim 1 , wherein, for each pair of linked PDCCH candidates, the duration associated with that pair of linked PDCCH candidates is based at least in part on one or more symbols associated with the first PDCCH candidate of that pair of linked PDCCH candidates and one or more symbols associated with the second PDCCH candidate of that pair of linked PDCCH candidates. 8. The UE of claim 1 , wherein, for each pair of linked PDCCH candidates, the duration associated with that pair of linked PDCCH candidates runs from an end of a last symbol associated with the first PDCCH candidate of that pair of linked PDCCH candidates to an end of a last symbol associated with the second PDCCH candidate of that pair of linked PDCCH candidates. 9. The UE of claim 1 , wherein the indication of the PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers. 10. The UE of claim 1 , wherein the indication of the PPU limit associated with the UE indicates a PPU limit for a number of PPUs across one or more component carriers. 11. The UE of claim 1 , wherein the indication of the PPU limit associated with the UE includes a respective PPU limit for each of one or more subcarrier spacings. 12. The UE of claim 1 , wherein a total number of PPUs occupied by the linked PDCCHs in all of the one or more linked pairs of search space sets is required to satisfy the PPU limit associated with the UE. 13. The UE of claim 1 , wherein the one or more processors are individually or collectively configured to cause the UE to: monitor one or more of the linked PDCCH candidates for PDCCH repetition in a linked pair of monitoring occasions in connection with a determination that a total number of PPUs occupied by the linked PDCCHs in all of the one or more linked pairs of search space sets satisfies the PPU limit associated with the UE during a duration associated with the one or more of the linked PDCCH candidates. 14. A network node 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 network node to: receive, from a user equipment (UE), an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limit associated with the UE; and transmit, to the UE, 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. 15. The network node of claim 14 , wherein the one or more processors are individually or collectively configured to cause the network node to: transmit, to the UE, repeated PDCCH transmissions in the linked PDCCH candidates of the one or more linked pairs of search space sets based at least in part on the configurations of the one or more linked pairs of search space sets. 16. The network node of claim 14 , wherein, for each pair of linked PDCCH candidates, the number of PPUs occupied by that pair of linked PDCCH candidates is based at least in part on an aggregation level associated with that pair of linked PDCCH candidates. 17. The network node of claim 14 , wherein the indication of the PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers. 18. The network node of claim 14 , wherein the indication of the PPU limit associated with the UE indicates a PPU limit for a number of PPUs across one or more component carriers. 19. The network node of claim 14 , wherein the indication of the PPU limit associated with the UE includes a respective PPU limit for each of one or more subcarrier spacings. 20. The network node of claim 14 , wherein the configurations for the plurality of search space sets ensure that a total number of PPUs occupied by
in the downlink direction of a wireless link, i.e. towards a terminal · CPC title
by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)} · CPC title
Allocation of signalling, i.e. of overhead other than pilot signals · CPC title
the frequencies being arranged in component carriers · CPC title
based on the type of the allocated resource · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.