2004
DOI: 10.1109/tit.2004.834747
|View full text |Cite
|
Sign up to set email alerts
|

Optimum Power Control for CDMA With Deterministic Sequences in Fading Channels

Abstract: Abstract-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 m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
25
0

Year Published

2004
2004
2008
2008

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 13 publications
(27 citation statements)
references
References 23 publications
2
25
0
Order By: Relevance
“…For any fixed channel state, the optimal choice of signature sequences for a given power control policy p(h) is an orthogonal set [5], [6]. Noting that the received power levels are p i (h)h i , solving (5) is equivalent to solving K independent Goldsmith-Varaiya problems [2] (see also [1]), the solution to which is a single user waterfilling for each user. The optimal solution p * (h) is the unique solution satisfying the Karush-Kuhn-Tucker (KKT) conditions, and is given by,…”
Section: Joint Signature Sequence and Power Allocationmentioning
confidence: 99%
See 4 more Smart Citations
“…For any fixed channel state, the optimal choice of signature sequences for a given power control policy p(h) is an orthogonal set [5], [6]. Noting that the received power levels are p i (h)h i , solving (5) is equivalent to solving K independent Goldsmith-Varaiya problems [2] (see also [1]), the solution to which is a single user waterfilling for each user. The optimal solution p * (h) is the unique solution satisfying the Karush-Kuhn-Tucker (KKT) conditions, and is given by,…”
Section: Joint Signature Sequence and Power Allocationmentioning
confidence: 99%
“…In the fading case with channel adaptive powers, as suggested by the results in [1]- [3], it is likely that some users will have powers equal to zero at some channel states, and they will not contribute to C sum at those channel states. Although the concept of oversized users is defined for users with nonzero average power constraints, since users which are allocated zero power at state h will not contribute to the sum capacity, we can add them to the set of non-oversized users at channel state h,L(h), and we can assume that we assign arbitrary sequences for those users without changing the solution.…”
Section: Joint Signature Sequence and Power Allocationmentioning
confidence: 99%
See 3 more Smart Citations