Thresholds Optimization for One-Bit Feedback Multi-User Scheduling

TL;DR

This paper introduces a one-bit feedback scheduling scheme for multi-user systems that closely approaches the performance of full channel state information, optimizing user rates with a new heuristic method.

Contribution

It proposes a novel one-bit feedback scheme with optimal and heuristic solutions for multi-user scheduling, achieving near-ideal sum rates.

Findings

The 2-user case is concave and optimally solvable.

The heuristic method performs close to full CSI performance.

Sum rate approaches the upper bound of full channel information.

Abstract

We propose a new one-bit feedback scheme with scheduling decision based on the maximum expected weighted rate. We show the concavity of the $2$-user case and provide the optimal solution which achieves the maximum weighted rate of the users. For the general asymmetric M-user case, we provide a heuristic method to achieve the maximum expected weighted rate. We show that the sum rate of our proposed scheme is very close to the sum rate of the full channel state information case, which is the upper bound performance.