Linked PDCCH Candidate Counting for Blind Decoding Overbooking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communications systems face challenges in efficiently managing blind decoding limits and overbooking for physical downlink control channel (PDCCH) repetition, leading to inefficiencies in resource utilization and computational resource use.
Innovation Solution
A UE is configured to count linked PDCCH candidates as multiple monitored candidates towards blind decoding (BD) limits and determine overbooking procedures, considering linked search space sets within a transmission time interval (TTI) to optimize monitoring and resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If PDCCH repetition is configured with multiple search space sets, then reliability of control channel reception is improved, but device complexity and computational resource consumption increase
Solution Approach 1:
The patent segments the monitoring task by introducing a span-based structure where multiple search space sets are organized into spans. Each span contains a subset of search space sets that can be monitored together, dividing the overall monitoring complexity into manageable units while maintaining reliability through repetition across spans.
Solution Approach 2:
The patent implements dynamic monitoring by allowing the UE to adaptively select which search space sets to monitor based on configured rules and current conditions. The monitoring behavior dynamically adjusts based on the span structure and search space set configurations, optimizing the balance between reliability and complexity.
2Reliability
If the number of PDCCH candidates is increased to improve coverage, then blind decoding limit is exceeded, but resource utilization efficiency decreases
Solution Approach 1:
The patent applies local quality by differentiating the treatment of search space sets within spans. Different search space sets can have different monitoring configurations, candidate numbers, and priorities based on their specific roles and requirements, allowing optimized resource allocation rather than uniform treatment of all candidates.
Solution Approach 2:
The patent changes key parameters such as the span length, search space set periodicity, and candidate distribution across spans to optimize the balance between coverage and efficiency. By adjusting these parameters, the system can adapt to different channel conditions and UE capabilities while maintaining blind decoding limits.
3Reliability
If multiple search space sets are monitored simultaneously, then control information reception reliability is improved, but processing time and computational load increase
Solution Approach 1:
The patent segments the monitoring process into span-based units with structured timing relationships. By organizing search space sets into spans with defined temporal patterns, the UE can process monitoring tasks in organized batches rather than as a monolithic operation, reducing processing time through systematic segmentation.
Solution Approach 2:
The patent implements preliminary action by pre-configuring span structures, search space set associations, and monitoring rules before actual PDCCH reception. The UE prepares the monitoring framework in advance, establishing the temporal and spatial relationships between search space sets, which reduces real-time processing complexity and time.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Methods, systems, and devices for wireless communications are described. Generally, individual physical downlink control channel (PDCCH) candidates of a first search space (SS) set in a first transmission time interval (TTI) may be linked to corresponding PDCCH candidates of a second SS set in a second TTI. The UE may count combinations of the PDCCH candidates in the first TTI and the PDCCH candidates in the second TTI toward a blind decoding (BD) limit of only the second TTI, or the BD limit of the first TTI and the BD limit of the second TTI. The first SS set and second SS set may be in the same TTI. The UE may consider, with respect to a BD limit, a first set of PDCCH candidates, a second set of PDCCH candidates, and a combination of the first and second set of PDCCH candidates, together, or separately, or any combination thereof.