Wireless Scheduling Offset Segmentation for Latency and Power
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in efficiently managing power consumption and latency in the transmission and reception of physical downlink and uplink shared channels due to simultaneous configuration with search space set group switching and cross-slot scheduling, leading to potential delays and inefficiencies.
Innovation Solution
The proposed method involves configuring different minimum applicable scheduling offsets for each search space set group, allowing for independent mapping and application timing of these offsets, and adjusting them based on DCI indications to optimize power efficiency and reduce latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If search space set group switching and cross-slot scheduling are simultaneously configured, then scheduling flexibility and power efficiency are improved, but transmission latency increases and processing complexity increases
Solution Approach 1:
The patent segments the search space sets into multiple groups (first search space set group, second search space set group, etc.) and assigns different minimum applicable scheduling offsets to each group. This segmentation allows the system to maintain scheduling flexibility while reducing latency by selecting appropriate offset values for different search space set groups based on specific scheduling requirements.
Solution Approach 2:
The patent introduces dynamic determination of the minimum applicable scheduling offset based on the detected search space set group. The offset value is not fixed but is dynamically selected from multiple possible values according to the specific search space set group being used, allowing the system to adapt to different latency and power efficiency requirements in real-time.
2Loss of energy
If search space set group switching and cross-slot scheduling are simultaneously configured, then power efficiency is improved, but processing complexity increases
Solution Approach 1:
The patent divides search space sets into groups and associates different minimum applicable scheduling offsets with each group. This segmentation enables the system to achieve power efficiency by selecting appropriate offsets for different search space set groups while managing processing complexity through structured organization of the configuration parameters.
Solution Approach 2:
The patent changes the parameter of minimum applicable scheduling offset based on the detected search space set group. By dynamically adjusting this parameter according to the search space set group, the system achieves power efficiency without requiring complete redesign of the scheduling mechanism, thus managing processing complexity.
3Device complexity
If a single minimum applicable scheduling offset is used for all search space set groups, then device complexity is reduced, but transmission latency cannot be optimized
Solution Approach 1:
The patent segments the scheduling offset configuration by search space set group, assigning different minimum applicable scheduling offsets to different groups. This segmentation enables latency optimization for each search space set group while maintaining relatively simple configuration through the structured grouping approach.
Solution Approach 2:
The patent makes the minimum applicable scheduling offset dynamic rather than static, allowing it to change based on the detected search space set group. This dynamic approach optimizes transmission latency for different search space set groups without requiring complex manual configuration, as the system automatically determines the appropriate offset.
Data Source
AI summary
The present disclosure provides a method by which a terminal receives a physical downlink shared channel (PDSCH) in a wireless communication system. Particularly, the method comprises: receiving (i) first information related to a plurality of search space set groups (SSSGs) and (ii) second information for minimum applicable scheduling offsets related to the respective plurality of SSSGs; receiving downlink control information (DCI) through a specific SSSG from among the plurality of SSSGs; and receiving the PDSCH on the basis of the DCI, wherein the PDSCH is scheduled on the basis of the minimum applicable scheduling offset related to the specific SSSG.