A Caltech Library Service

Differentiated Rate Sceduling for MIMO Broadcast Channels

Vakili, Ali and Dana, Amir and Sharif, Masoud and Hassibi, Babak (2005) Differentiated Rate Sceduling for MIMO Broadcast Channels. In: 43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol.4. Univeristy of Illinois , Urbana-Champaign, IL, pp. 2003-2012. ISBN 9781604234916.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We consider the problem of differentiated rate scheduling for the fading MIMO Gaussian broadcast channel, in the sense that the rates required by different users must satisfy certain rational rate constraints. When full channel state information (CSI) is available at the transmitter, the problem can be readily solved using dirty paper coding (DPC) and con- vex optimization techniques on the dual multiple-access channel (MAC). However, since in many practical applications full CSI is not feasible, and since the computational complexity may be prohibitive when the number of users is large, we focus on two simple schemes that require very little CSI: time-division opportunistic (TO) beamforming where in different time-slots the transmitter performs opportunistic beamforing only to users requiring the same rate, and weighted opportunistic (WO) beamforing where the random beams are assigned to those users having the largest weighted SINR. In both cases we determine explicit schedules to guarantee the rate constraints and show that, in the limit of a large number of users, the throughput loss compared to the unconstrained sum-rate capacity tends to zero. As a side result, we show that, in this regime, the sum-rate of opportunistic beamforming converges to the optimal sum-rate achieved by DPC, which is a stronger result than the order-optimal results of (10, 13).

Item Type:Book Section
Alternate Title:Differentiated rate scheduling for MIMO Gaussian broadcast channels
Additional Information:This work was supported in part by the National Science Foundation under grants no. CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking.
Funding AgencyGrant Number
David and Lucille Packard FoundationUNSPECIFIED
Caltech’s Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20150223-070813329
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55076
Deposited By: Shirley Slattery
Deposited On:03 Mar 2015 23:51
Last Modified:03 Oct 2019 08:02

Repository Staff Only: item control page