Blind Decoding Limits and Overbooking for PDCCH Repetition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless communication systems face challenges in efficiently managing blind decoding limits and overbooking for physical downlink control channel repetition, particularly in counting and monitoring PDCCH candidates across multiple transmission time intervals, which affects system resource utilization and efficiency.
Innovation Solution
A method where user equipment (UE) receives configuration messages to link PDCCH candidates across different search spaces and time intervals, allowing for counting and monitoring based on specific rules to determine overbooking conditions, enabling efficient resource allocation and utilization by counting combinations of PDCCH candidates towards blind decoding limits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If PDCCH candidates are counted separately in each TTI, then the blind decoding limit compliance is simplified, but the resource utilization efficiency deteriorates due to redundant counting of linked candidates
Solution Approach 1:
The patent segments the counting process into two distinct parts: (1) counting individual PDCCH candidates in each TTI separately for blind decoding limit compliance, and (2) counting combinations of linked PDCCH candidates across TTIs for overbooking evaluation. This segmentation allows each counting method to serve its specific purpose optimally without interference.
Solution Approach 2:
The patent introduces a new dimension to the counting problem by evaluating combinations of linked PDCCH candidates across multiple TTIs as a separate metric. This adds a temporal dimension to the traditional per-TTI counting approach, enabling more nuanced resource allocation and overbooking decisions.
2Measurement precision
If combinations of PDCCH candidates across TTIs are counted towards both BD limits, then overbooking detection becomes more accurate, but the computational complexity increases
Solution Approach 1:
The patent performs preliminary counting of individual PDCCH candidates in each TTI against the blind decoding limit before evaluating combinations across TTIs. This preliminary action establishes a baseline compliance status, allowing the system to focus computational resources only on combination evaluation when necessary.
Solution Approach 2:
The patent introduces an intermediary evaluation step that assesses whether counting combinations towards both BD limits results in overbooking. This intermediary mechanism acts as a bridge between the simple per-TTI counting and the complex multi-TTI combination counting, enabling accurate overbooking detection while managing computational load.
3Reliability
If PDCCH candidates are monitored with strict BD limit enforcement, then the system reliability is improved, but the flexibility in resource allocation deteriorates
Solution Approach 1:
The patent implements a dynamic resource allocation mechanism where the counting approach adapts based on the specific TTI configuration and linking patterns. The system can dynamically switch between counting individual candidates and counting combinations, providing flexibility while maintaining reliability through configurable evaluation modes.
Solution Approach 2:
The patent changes the counting parameters based on the evaluation purpose: using individual candidate counting for blind decoding limit compliance and combination counting for overbooking detection. This parameter change allows the system to maintain strict reliability enforcement while adapting resource allocation flexibility to specific operational contexts.
Data Source
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.