Blind Decoding Search Space Segmentation for Power Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Radio communication systems face challenges in reducing the processing power required for blind decoding of downlink control information, as communication devices need to repeatedly search for unscheduled transmissions across various radio resources without precise identification, leading to increased computational load.
Innovation Solution
The method involves selecting predefined combinations of search spaces for unscheduled transmissions based on factors like cell load and channel state information, and transmitting these selections to communication devices, thereby restricting the search spaces and aggregation levels for each transmission technique, reducing the processing power needed for blind decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If communication devices repeatedly search for unscheduled transmissions across various radio resources without precise identification, then the reliability of receiving downlink control information is improved, but the processing power required increases
Solution Approach 1:
The patent segments the search space for blind decoding by dividing it into multiple candidate sets with different aggregation levels. Instead of searching all possible radio resources uniformly, the device divides the search into structured segments (candidate sets) where each set corresponds to specific aggregation levels. This segmentation reduces the total number of decoding attempts required while maintaining reliability, as the search is organized into manageable segments rather than brute-force enumeration of all resources.
Solution Approach 2:
The patent applies preliminary action by pre-configuring candidate sets and their associated aggregation levels before the actual blind decoding process. The search spaces are pre-organized into candidate sets with defined aggregation levels, so that when blind decoding is performed, the device already has a structured framework to follow. This preliminary organization reduces the computational burden during real-time operation, as the search pattern is predetermined rather than computed on-the-fly.
2Reliability
If multiple aggregation levels are searched during blind decoding, then the coverage and reliability of control information reception are improved, but the complexity of the decoding process increases
Solution Approach 1:
The patent segments the multi-level aggregation search into distinct candidate sets, where each candidate set is associated with specific aggregation levels. This segmentation allows the device to systematically handle different aggregation levels in an organized manner rather than treating them as a monolithic complex search. The structured division into candidate sets reduces decoding complexity by providing a clear framework for managing multiple aggregation levels.
Solution Approach 2:
The patent introduces dynamics by allowing flexible configuration of which aggregation levels are included in each candidate set. The system can dynamically adjust the composition of candidate sets based on channel conditions, device capabilities, and traffic requirements. This dynamic adaptability allows the system to optimize the balance between coverage (searching more aggregation levels) and complexity (limiting the search scope) according to real-time conditions.
3Reliability
If the search space for blind decoding is expanded to cover more radio resources, then the probability of successfully receiving control information is improved, but the time required for decoding increases
Solution Approach 1:
The patent applies preliminary action by pre-defining candidate sets that cover specific radio resources and aggregation levels before the blind decoding process begins. These pre-configured candidate sets provide a structured search framework that guides the decoding process through the most likely locations of control information. This preliminary organization allows the system to efficiently cover a broad search space without requiring exhaustive searching of all possible resources, thereby reducing decoding time while maintaining high probability of successful reception.
Solution Approach 2:
The patent segments the expanded search space into multiple candidate sets, each covering specific radio resources and aggregation levels. This segmentation transforms a potentially overwhelming exhaustive search into a series of targeted, organized decoding attempts. By dividing the search space into manageable segments with defined characteristics, the system can systematically cover more resources without linearly increasing decoding time, as the segmented approach allows for efficient processing and early termination when control information is found.
Data Source
Figure 1
Figure 2~3
Figure 4~5
AI summary
A technique, comprising: in a system in which a communication device searches for unscheduled transmissions of downlink control information for said communication device: selecting a combination of search spaces for unscheduled transmissions of downlink control information for a communication device by a plurality of transmission techniques: and transmitting an indication of the result of the selected combination to said communication device.