CaltechAUTHORS
  A Caltech Library Service

Differentiated rate scheduling for Gaussian broadcast channels

Sharif, Masoud and Dana, Amir F. and Hassibi, Babak (2005) Differentiated rate scheduling for Gaussian broadcast channels. In: International Symposium on Information Theory, 2005 (ISIT 2005), Adelaide, Australia, 4-9 September 2005. IEEE , Piscataway, NJ, pp. 2179-2183. ISBN 0-7803-9151-9 http://resolver.caltech.edu/CaltechAUTHORS:SHAisit05

[img]
Preview
PDF
See Usage Policy.

238Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SHAisit05

Abstract

In this paper, we consider a fading broadcast channel where users have different rate demands. In particular, we assume users are divided into M groups, each group of which requires the same rate, and where the ratio of the rates of the groups are given. The transmitter would like to maximize the throughput (sum of the rates to all users) while maintaining the rational rate constraints. In general, this problem appears to be computationally intractable since the ergodic capacity region is described as the convex hull of (an infinite) set of rates. In this paper, we therefore, focus on the asymptotic regime of many users (large n) where explicit results can be found. In particular, we propose three scheduling schemes to provide the rational rate constraints namely, weighted opportunistic (WO), time division opportunistic (TO), and superposition coding (SC). The WO scheduling is a generalization of the opportunistic scheduling in which we transmit to only the user that has the maximum weighted signal to noise ratio (SNR). In TO, each group has its own time slot in which the transmitter chooses the user with the best SNR from the corresponding group. Superposition coding is the one that achieves the capacity region. For each scheduling we give explicit scheme to guarantee the rational rate constraints. We also analyze the throughput loss due to rate constraints for different schemes. In particular, we show that the throughput loss compared to the maximum throughput (i.e., the sum rate capacity without any rate constraints) tends to zero for large n, and finally, we analyze the convergence rate of all the schemes.


Item Type:Book Section
Additional Information:© Copyright 2005 IEEE. Reprinted with permission. Posted online: 2005-10-31.
Subject Keywords:Gaussian channels; broadcast channels; channel capacity; channel coding; fading channels; scheduling
Record Number:CaltechAUTHORS:SHAisit05
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:SHAisit05
Alternative URL:http://dx.doi.org/10.1109/ISIT.2005.1523733
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9696
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:05 Mar 2008
Last Modified:26 Dec 2012 09:51

Repository Staff Only: item control page