Relay Node Control Decoding Search Space Pruning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, relay nodes face increased complexity and performance degradation due to large control decoding search spaces, leading to higher false alarm probabilities and unnecessary re-transmissions, especially when assisting multiple user equipment units.
Innovation Solution
A method to generate a reduced subset of control decoding candidates by omitting unschedulable UEs and control decoding candidates from the search space, thereby reducing the complexity and false alarm probability, using techniques such as UE-specific search spaces, aggregation level limitation, and CRC field extension.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If relay nodes monitor and decode control information for all associated UEs using conventional search spaces, then comprehensive coverage of all UEs is achieved, but device complexity and false alarm probability increase
Solution Approach 1:
The patent segments the control decoding search space by dividing UEs into two categories: those scheduled for transmission and those not scheduled. The relay node then processes control information separately for each group, monitoring only the search spaces relevant to scheduled UEs while excluding unscheduled UEs from the decoding process. This segmentation reduces the overall search space size and complexity for the relay node while maintaining coverage for active UEs.
Solution Approach 2:
The patent extracts and removes unscheduled UEs from the control decoding search space. By identifying which UEs are scheduled for transmission and excluding unscheduled UEs from the search space monitoring process, the relay node reduces the number of control decoding candidates it must process, thereby reducing device complexity and false alarm probability while maintaining comprehensive coverage for active UEs.
2Adaptability or versatility
If relay nodes process all control decoding candidates for potential UEs, then all possible UEs are monitored, but false alarm probability and unnecessary re-transmissions increase
Solution Approach 1:
The patent applies preliminary action by determining in advance which UEs are scheduled for transmission before the relay node begins monitoring control information. This scheduling information is obtained beforehand, allowing the relay node to pre-identify which UEs should be monitored and which should be excluded from the search space, thereby preventing false alarms for unscheduled UEs while maintaining reliable monitoring for scheduled UEs.
Solution Approach 2:
The patent extracts unscheduled UEs from the control decoding candidates list. By removing unscheduled UEs from the search space monitoring process, the relay node reduces the number of potential false alarms while maintaining comprehensive monitoring for scheduled UEs, thereby improving reliability and reducing unnecessary re-transmissions.
3Adaptability or versatility
If relay nodes decode control information for all associated UEs, then complete control monitoring is achieved, but processing time and efficiency decrease
Solution Approach 1:
The patent segments the control decoding process by separating scheduled UEs from unscheduled UEs. The relay node then processes control information only for scheduled UEs, excluding unscheduled UEs from the decoding process. This segmentation maintains complete control monitoring coverage for active UEs while significantly improving processing efficiency by reducing the total number of decoding operations required.
Solution Approach 2:
The patent extracts unscheduled UEs from the control decoding process. By removing unscheduled UEs from the search space and decoding candidates, the relay node reduces the processing workload while maintaining complete monitoring coverage for scheduled UEs, thereby improving overall decoding efficiency and productivity.
Data Source
AI summary
Systems and methodologies are described herein that facilitate efficient control decoding to facilitate management of cooperative relay operation in a wireless communication environment. As described herein, a relay node (RN) and/or another entity cooperating with a serving network node for respective users in a potentially assisted group can prune a search space of control decoding candidates corresponding to the respective users. For example, respective control decoding candidates corresponding to, e.g., common and/or user-specific search spaces, aggregation levels, control channel sizes, etc., can be eliminated from a reduced control search space based on various criteria. Further, sets of control decoding candidates corresponding to respective users not schedulable at a given time interval can be eliminated. In addition, control search space pruning can be performed in addition to or in place of increased cyclic redundancy check (CRC) protection for control information, thereby further decreasing the probability of false control detection.