By Topic

Stochastic Resource Allocation Over Fading Multiple Access and Broadcast Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xin Wang ; Dept. of Comput. & Electr. Eng. & Comput. Sci., Florida Atlantic Univ., Boca Raton, FL, USA ; Na Gao

We consider the optimal rate and power allocation that maximizes a general utility function of average user rates in a fading multiple-access or broadcast channel. By exploiting the greedy structure of the capacity-achieving resource allocation for both multiple-access and broadcast channels, it is established that a utility-maximizing allocation policy can be obtained through dual-based gradient descent iterations with fast convergence and low complexity per iteration. Relying on stochastic averaging tools, we further develop a class of stochastic gradient iterations which are capable of asymptotically converging to the optimal benchmark with guarantees on the minimum average user rates, even when the fading channel distribution is unknown a priori.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 5 )