ePDCCH Blind Decoding Candidate Distribution via PRB Pair Differentiation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In LTE systems, the blind decoding of ePDCCH messages is computationally intensive and inefficient due to the need for UEs to search through numerous blind decoding candidates, often resulting in overlapping search spaces and increased signaling overhead, especially with the current hash function limitations in Rel-8.
Innovation Solution
Differentiating between sets of PRB pairs in the ePDCCH control region to define blind decoding candidates, allowing for proportional assignment and randomization of these candidates, ensuring they occur in separate PRB pairs and varying their order across UEs, thereby improving distribution and reducing conflicts.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If UEs search through numerous blind decoding candidates in the current ePDCCH structure, then control information can be transmitted to multiple UEs, but the computational complexity and processing time increase significantly
Solution Approach 1:
The ePDCCH search space is segmented into multiple groups based on PRB pair indices. Each group contains a subset of blind decoding candidates, allowing UEs to search through organized segments rather than a single large set. This segmentation reduces the computational complexity by dividing the search space into manageable portions while maintaining comprehensive coverage for multiple UEs.
2Ease of manufacture
If blind decoding candidates are assigned without differentiation between PRB pair sets, then the assignment process is simple, but search spaces overlap and signaling overhead increases
Solution Approach 1:
The patent applies local quality by differentiating the assignment of blind decoding candidates based on the specific PRB pair set characteristics. Different groups of PRB pairs receive differently assigned candidates, creating localized optimization in each region. This prevents search space overlap between UEs while maintaining a systematic assignment process that does not require complex global coordination, thus reducing signaling overhead.
3Productivity
If all blind decoding candidates are considered in a single unified search space, then resource utilization is maximized, but the time required to process and identify valid candidates increases
Solution Approach 1:
The patent implements preliminary action by pre-organizing blind decoding candidates into distinct groups based on their associated PRB pair indices before the actual decoding process. This pre-grouping allows UEs to immediately narrow down the search to relevant groups based on received scheduling information, rather than sequentially checking all candidates. This reduces processing time while maintaining efficient resource utilization across the ePDCCH bandwidth.
Data Source
Figure 1A~1B
Figure 1C~1D
Figure 1E
AI summary
Methods of operating a network node (1 100) are provided. Various embodiments may provide methods of processing enhanced phystca! downlink conirol channel, ePDCCH, information by a network node (M OO) of a radio telecommunications system. The methods may include differentiating (300) between sets of physical resource block, PRB, pairs in an ePDCCH control region when defining blind decoding candidates (Xs). Moreover, the methods may include scheduling (301) a resource for a User Equipment, UE, in response to differentiating (300) between the sets of PRB pairs. Related network nodes (1100) and UEs (1200) are also described.