MIMO Resource Allocation for QoS Satisfaction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current radio resource allocation (RRA) solutions in multi-antenna networks fail to maximize data rate while ensuring minimum Quality of Service (QoS) requirements are met, especially in multi-service scenarios, due to the complexity introduced by the spatial dimension and heterogeneous demands of different flows.
Innovation Solution
A method for dynamically allocating spatial and time-frequency resources among data flows, which involves an initial maximum-rate allocation and subsequent reallocation of resources to ensure that a specified minimum number of flows from each service meet their QoS demands, using a reallocation metric that balances data rate improvements and throughput losses.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If advanced MIMO signal processing algorithms are used to maximize data rate, then spectral efficiency is improved, but computational complexity increases making the solution infeasible for practical scenarios
Solution Approach 1:
The patent segments the resource allocation problem into two distinct phases: (1) an initial allocation phase that provides a baseline assignment of time-frequency resources to flows, and (2) a reallocation phase that optimizes spatial resource assignment. This segmentation allows the complex MIMO problem to be broken down into more manageable sub-problems that can be solved with reduced computational complexity while still achieving near-optimal data rates.
Solution Approach 2:
The patent performs preliminary action by establishing an initial resource allocation before optimization. The initial allocation phase pre-assigns time-frequency resources to flows based on channel conditions and QoS requirements, creating a feasible starting point. This preliminary assignment reduces the search space for subsequent optimization, making the overall solution computationally tractable for practical MIMO systems.
2Productivity
If resource allocation optimizes for spectral efficiency, then overall data rate increases, but minimum QoS requirements for individual flows are not fulfilled
Solution Approach 1:
The patent introduces dynamics into the resource allocation process by implementing an iterative reallocation mechanism. The system dynamically adjusts spatial resource assignments based on flow satisfaction status, transitioning from a static initial allocation to an optimized state. This dynamic approach allows the system to balance spectral efficiency with QoS requirements by continuously adapting resource distribution until minimum satisfaction constraints are met.
Solution Approach 2:
The patent implements feedback mechanisms where the system monitors whether minimum QoS requirements are satisfied for each flow. This feedback information drives the reallocation process, guiding which flows receive additional spatial resources. The feedback loop ensures that optimization continues until both spectral efficiency is maximized and QoS constraints are fulfilled, resolving the contradiction between overall performance and individual flow requirements.
3Reliability
If the system guarantees minimum satisfaction for all flows, then QoS reliability is improved, but overall spectral efficiency decreases
Solution Approach 1:
The patent changes key parameters during the reallocation process, including spatial resource assignments, flow priority weights, and allocation constraints. By dynamically adjusting these parameters based on flow satisfaction status, the system transitions from a conservative allocation that guarantees minimum satisfaction to an optimized allocation that improves spectral efficiency while maintaining QoS requirements. This parameter optimization resolves the contradiction by finding the optimal balance point.
Data Source
AI summary
Radio resource allocation techniques for MIMO systems are disclosed, wherein SDMA groups that should be multiplexed on each frequency chunk in order to maximize the total downlink data rate are selected, while guaranteeing that a specified minimum number of flows from each service have their instantaneous QoS demands fulfilled. The disclosed techniques include an unconstrained maximization procedure, in which resources are initially allocated to data flows for each of several data services, followed by a reallocation procedure in which resources are reallocated to satisfy minimum satisfaction constraints for each data service.