Differentiated rate scheduling for the down-link of cellular systems

Abstract

We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must satisfy certain constraints on their ratios. When full channel state information (CSI) is available at the transmitter and receivers, the problem can be readily solved using dirty paper coding (DPC) and the application of convex optimization techniques on the dual problem which is the multiple access channel (MAC). Since in many practical application full CSI may not be feasible and computational complexity prohibitive when the number of users is large, we focus on other simple schemes that require very little CSI: time-division opportunistic (TO) beamforming where in different time slots (of different lengths) the transmitter performs opportunistic beamforming to the users requiring the same rate, and weighted opportunistic (WO) beamforming where the random beams are assigned to those users having the largest weighted SINR. For single antenna systems we also look at the capacity-achieving superposition coding (SC) scheme. In all cases, we determine explicit schedules to guarantee the rate constraints and show that, in the limit of large number of users, the throughput loss compared to the unconstrained throughput (sum-rate capacity) tends to zero. We further provide bounds on the rate of convergence of the sum-rates of these schemes to the sum-rate capacity. Finally, we provide simulation results of the performance of different scheduling schemes considered in the paper.

Files

Additional details