By Topic

Optimum power control for CDMA with deterministic sequences in 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
$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)
Kaya, O. ; Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA ; Ulukus, Sennur

We specify the capacity region for a power-controlled, fading code-division multiple-access (CDMA) channel. We investigate the properties of the optimum power allocation policy that maximizes the information-theoretic ergodic sum capacity of a CDMA system where the users are assigned arbitrary signature sequences in a frequency flat-fading environment. We provide an iterative waterfilling algorithm to obtain the powers of all users at all channel fade levels, and prove its convergence. Under certain mild conditions on the signature sequences, the optimum power allocation dictates that more than one user transmit simultaneously in some nonzero probability region of the space of all channel states. We identify these conditions, and provide an upper bound on the maximum number of users that can transmit simultaneously at any given time. Using these properties of the sum capacity maximizing power control policy, we also show that the capacity region of the fading CDMA channel is not in general strictly convex.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 10 )