By Topic

Service outage based power and rate allocation for parallel fading 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
$33 $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

3 Author(s)
Jianghong Luo ; Dept. of Electr. Eng., Rutgers-State Univ. of New Jersey, Piscataway, NJ, USA ; R. Yates ; P. Spasojevic

The service outage based allocation problem explores variable-rate transmission schemes and combines the concepts of ergodic capacity and outage capacity for fading channels. A service outage occurs when the transmission rate is below a given basic rate ro. The allocation problem is to maximize the expected rate subject to the average power constraint and the constraint that the outage probability is less than ε. A general class of probabilistic power allocation schemes is considered for an M-parallel fading channel model. The optimum power allocation scheme is derived and shown to be deterministic except at channel states of a boundary set. The resulting service outage achievable rate ranges from 1-ε of the outage capacity up to the ergodic capacity with increasing average power. Two near-optimum schemes are also derived by exploiting the fact that the outage probability is usually small. The second near-optimum scheme significantly reduces the computational complexity of the optimum solution; moreover, it has a simple structure for the implementation of transmission of mixed real-time and non-real-time services.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 7 )