RME Uplink Scheduler for MIMO Channel Quality
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face challenges in efficiently scheduling uplink and downlink transmissions in multi-input multi-output (MIMO) transmissions, particularly in managing channel quality indicators, modulation and coding schemes, and resource allocation, leading to performance degradation and increased complexity in scheduling algorithms.
Innovation Solution
The implementation of a Recursive Maximum Expansion (RME) algorithm for uplink scheduling, which employs a 2-step approach of time domain pre-selection and frequency domain packet scheduling, reduces the number of users available for multiplexing, thereby limiting the complexity of the frequency domain packet scheduler and improving spectral efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If the number of users available for multiplexing is reduced through time domain pre-selection, then the complexity of the frequency domain packet scheduler is limited, but the spectral efficiency may be degraded
Solution Approach 1:
The scheduling process is divided into two independent stages: time domain pre-selection that identifies candidate users, and frequency domain packet scheduling that allocates resources. This segmentation allows each stage to focus on specific optimization goals without overwhelming complexity.
Solution Approach 2:
Time domain pre-selection performs preliminary filtering of users based on channel conditions and scheduling criteria before the frequency domain scheduling occurs. This preliminary action reduces the candidate pool size, making the subsequent frequency domain scheduling computationally manageable while preserving spectral efficiency through intelligent pre-filtering.
2Productivity
If Recursive Maximum Expansion algorithm is implemented for uplink scheduling, then throughput is maximized and blocked allocations are minimized, but processing requirements increase
Solution Approach 1:
The RME algorithm dynamically adjusts the expansion process based on current channel conditions, user buffer status, and scheduling priorities. This dynamic adaptation allows the system to achieve near-optimal throughput while avoiding unnecessary processing in scenarios where channel conditions or traffic patterns make extensive expansion unnecessary.
Solution Approach 2:
The algorithm changes key parameters such as expansion depth, candidate user count, and resource block allocation based on system state. By adaptively adjusting these parameters, the RME algorithm balances throughput maximization with processing requirement management.
Data Source
AI summary
Wireless communication between a base station and at least one user equipment comprises the following. Each user equipment periodically measures channel quality of communication with the base station and transmits a channel quality indicator to the base station. The base station schedules communication with the at least one user equipment based upon the periodically transmitted channel quality indicators.