Fairness, power allocation, and CSI quantization in block fading multiuser systems

Abstract

This paper studies the fairness, power allocation, and channel state information (CSI) quantization in multiuser systems utilizing multiple feedback bits per user. For a given set of schedulers, we obtain the system throughput with different power allocation strategies and any combination of different fading distributions. Moreover, the system performance under user different outage probability constraints is investigated. Assuming homogenous users, as a special case, the throughput is determined for fixed and random request networks. Considering nonidentical fading channels between the transmitter and receivers, the throughput is found under the K-significant average feedback bit allocation technique, and two suboptimal fairness schemes are investigated which satisfy different quality-of-service requirements. The results show that using optimal power allocation, the first quantization region (QR) of each user is the only QR for which no power may be allocated. The system outage probability vanishes as the number of users goes to infinity. Users hard outage probability constraints can be satisfied at the cost of one more QR in the channel quantizer. Finally, the proposed fairness schemes are more flexible than the standard proportional fair (PF) scheduling in dealing with the throughput-fairness tradeoff. However, their superiority over PF scheduling depends on the fairness constraint. © 2013 Stolojescu-Crisan and Isar; licensee Springer.