A Low Complexity Space-Frequency Multiuser Scheduling Algorithm

TL;DR

This paper introduces a low complexity, space-frequency multiuser scheduling algorithm that maximizes ergodic sum rate using dual optimization and stochastic approximation for efficient online resource allocation in MIMO systems.

Contribution

It proposes a novel low complexity scheduling algorithm that exploits temporal diversity and incorporates weighted sum rate for user prioritization, suitable for real-time MIMO systems.

Findings

Algorithm achieves comparable performance to benchmarks

Reduces computational complexity significantly

Effective under real system conditions

Abstract

This work presents a resource allocation algorithm in K-user, M-subcarrier and NT-antenna systems for on-line scheduling. To exploit temporal diversity and to reduce complexity, the ergodic sum rate is maximized instead of the instantaneous one. Dual optimization is applied to further diminish complexity together with a stochastic approximation, which is more suitable for online algorithms. Weighted sum rate is considered so that users can be either prioritized by higher layers or differentiated by proportional rate constraints. The performance and complexity of this algorithm is compared with well-known benchmarks and also evaluated under real system conditions for the MIMO Broadcast channel.