ePDCCH Candidate Allocation Across Linked Search Space Sets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face challenges in efficiently allocating resources for enhanced Physical Downlink Control Channel (PDCCH) transmissions, particularly when multiple Transmit Receive Points (TRPs) are involved, leading to suboptimal reliability and robustness due to insufficient candidate resource allocation and inefficient dropping schemes.
Innovation Solution
The proposed solution involves enhanced candidate allocation schemes for ePDCCH, which include configuring multiple search space sets for PDCCH repetitions, determining available resources with predefined granularity, and allocating candidates based on priority rules, using joint or individual counting and dropping schemes for linked search space sets to optimize resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple search space sets are configured for ePDCCH repetitions across multiple TRPs, then reliability and robustness of PDCCH transmission is improved, but device complexity and resource allocation overhead increases
Solution Approach 1:
The patent segments the PDCCH transmission across multiple search space sets (first and second search space sets) that are linked together. Each search space set contains specific candidates (first and second candidates) that are independently configured but jointly evaluated for repetition detection. This segmentation allows the system to distribute the reliability improvement across multiple manageable configuration units rather than a monolithic complex structure.
Solution Approach 2:
The patent establishes predetermined relationships between search space sets and candidates before actual PDCCH transmission occurs. The linking between first and second search space sets, and between first and second candidates, is pre-configured with defined priority rules. This preliminary structuring enables efficient resource allocation and reduces runtime complexity when handling multiple TRP repetitions.
2Productivity
If joint counting of candidates from linked search space sets is performed, then resource allocation efficiency is improved, but measurement and detection difficulty increases
Solution Approach 1:
The patent introduces a predetermined priority rule as an intermediary mechanism that mediates the joint counting process between candidates from different search space sets. When resources are limited, the priority rule automatically determines which candidates (first or second) receive allocation based on pre-established criteria. This intermediary structure simplifies the joint counting operation by providing a clear decision-making framework rather than requiring complex real-time evaluations.
Solution Approach 2:
The patent changes the parameter of candidate evaluation from individual independent assessment to joint assessment with priority weighting. By introducing priority rules that assign different weights or preferences to candidates from different search space sets, the system transforms the counting problem into a prioritized resource allocation problem that is more efficient to solve while maintaining accuracy.
3Reliability
If multiple candidates are allocated for PDCCH repetitions, then transmission robustness is improved, but loss of information about available resources increases
Solution Approach 1:
The patent implements a feedback mechanism where the joint counting and priority-based allocation results are used to determine which candidates are actually allocated for PDCCH repetitions. The system monitors resource availability and uses the predetermined priority rules to make allocation decisions that preserve information about resource usage. This feedback loop ensures that robustness is improved through multiple candidates while maintaining accurate tracking of available resources.
Data Source
AI summary
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.