Variable Quality of Service in Cdma Systems by Statistical Power Control
Variable Quality of Service in Cdma Systems by Statistical Power Control
Variable Quality of Service in Cdma Systems by Statistical Power Control
This research was supported by the Advanced Research Projects Agency Figure 1. schematic of CDMA downlink with power control
Contract J-FBI-93-153, Tektronix, Bell Communications Research, and and joint source channel coding. Top figure -
transmitter; bottom figure - receiver for one user.
the Univeersity of California MICRO Program.
∑ ∑
intra
β k, n x k, n .
∑ ∑ β k, n x k, n
2
Im = f m, n G n (2) σ + E[ f ] Gn
n = 1 k=1 n = 1 k=1
n≠m n≠m
i of user m, and the inequality in Eq. 6 implies that the minimize E [ P ] = ∑ ∑ β k, n x k, n such that (13)
expected value of the SNR achieved at the receiver must n = 1k = 1
equal or exceed the desired SNR.
G m x i, m
Eq. 5 - Eq. 7 constitute a linear programming problem ∀i, m , -----------------------------------------------------------------------------------
N
- ≥ SNR i, m , (14)
M n
and can be solved numerically via the Simplex algorithm
∑ ∑ β k, n x k, n
2
[20], but we can obtain a closed-form solution. In the Ap- σ m + E [ f m ]G m
pendix, we derive that the necessary and sufficient condi- n = 1k = 1
n≠m
tion for feasibility is
SNR i, m β i, m 2
x i, m = SNR i, m ( σ m ⁄ G m + E [ f m ] ( E [ P ] – E [ P m ] ) ) ,
and α i, m = ----------------------------------------------------------------
Nm
- , (11)
1 + E[ f ] ∑ βk, m SNR k, m σm
2
k=1 with E [ P m ] = γ m ------------------------ + E [ P ]
Gm E [ f m ]
i = 1, …, N m , m = 1, …, M .
–1 γn M
2
and E [ P ] = ( 1 – γ ) ∑ ----------------------σ n . (16)
Further, if the system is feasible, it has a unique, optimal n = 1 Gn E [ f n ]
solution given by
3 DISCUSSION
SNR i, m 1 – γ m 2
x i, m = ------------------- --------------- σ . (12) Looking at (11), α i, m is a monotonically increasing
Gm 1 – γ
function of SNR i, m ; thus, the power assigned to a sub-
2.2 Downlink Power Control stream is monotonic in the substream’s desired reliability
On the downlink, all intracell substreams arrive at mo- requirement. We can interpret (8), the feasibility criterion,
bile receiver m via the same multipath channel and thus are as a measure of the QOS capacity for an interference-limit-
attenuated by the same amount, G m . In contrast, the inter- ed CDMA system. The closer γ is to unity, the closer such a
system is to operating at capacity in terms of being able to
cell interference is different for each mobile. Since trans- meet QOS requirements for all users and substreams. If the
mission is synchronous, the downlink code correlation QOS requirements of the substreams in a cell are too strin-
coefficient f m will be directly proportional to the fraction of gent, then the intracell interference will be too great and no
the received power which is scattered due to the multipath solution exists, regardless of how much power is pumped
in user m’s channel [11]. For a practical CDMA system em- into the cell. In addition to a fundamental rate capacity, we
ploying time diversity [18], this information is available at have shown for interference-limited CDMA that there is a
the RAKE receiver. In absence of time diversity, we consid- signal-to interference, or QOS, capacity as well.
er the worst case, namely when no line-of-sight power com- Secondly, the feasibility criterion points to a simple way
ponent exists. In this event, the crosscorrelation can be to perform call admission. To determine if we can add a new
modelled by f, as in the uplink. substream without violating the QOS guarantees for sub-
The downlink formulation is then streams in-progress, we simply check whether
γ current system + E [ f ]α new substream < 1 . (17) ity mass function
Pr [ P m = x k, m ] = β k, m , k = 1, …, N m ,
If Eq. 17 holds, we can admit the new substream; other-
wise, we will have to renegotiate the QOS contracts of the Nm
existing substreams to make room for the new substream. Pr [ P m = 0 ] = 1– ∑ β k, m
To better understand what can be gained by using power k=1
control, we simulated the system in Fig. 1 for 50 users. Hy-
and variance
brid PN-Walsh codes from the IS-95 standard [24] were 2
σ P = ∑ β k, m x k, m – ∑ β k, m x k, m .
2 2
chosen to perform the spreading. The channel consisted of (18)
m
an FIR filter followed by an additive Gaussian noise source, k k
to simulate background noise, intercell interference and
multipath. The intercell interference noise power that each Assuming independence of different user traffic, the stan-
user experiences is random, uniformly distributed between dard deviation in the total received power is
0 to 20 dB. So that results can be readily interpreted, we
M
consider the case where each user has only one substream, 2
∑
2
and all substreams request the same QOS. Plotted in Fig. 2 σ P_received = Gm σ Pm (19)
is a histogram of the number of users versus the bit error rate m=1
experienced for 2 cases, power control and no power con- If we now consider the ratio of the standard deviation to
trol. For fairness of comparison, the total transmit power is the mean for the total received power, it can be shown [22]
the same for both. In the case of no power control, power is that this ratio approaches zero as the number of users tends
divided evenly between all 50 users. to infinity. Hence, as the number of users grow large, the to-
tal received power becomes increasingly deterministic. By
applying a statistical guarantee when the system is heavily
loaded, the instantaneous intracell interference power will
power be close to the expected interference power, with the degree
control of variability in the achieved SNRs becoming ever smaller
as the number of users increases. Likewise, the quantity we
are minimizing - the expected total transmit power - will
closely reflect the instantaneous total power. Thus, a statis-
tical criterion and high system utilization work together to
no power each other’s mutual advantage.
no power control allo-
control
cates higher reliability
than needed
In conclusion, we have described how power control
can be used simultaneously to provide variable QOS and to
combat intracell and intercell interference in a cellular sys-
tem. UEP by power modulation can be applied at all levels,
not just the bit level, and the degree of protection can be var-
ied with fine granularity. The scheme does not require band-
Figure 2. Histogram of the number of users vs. the bit error width expansion and the computations are relatively simple,
rate each user receives, with and without power making it suitable for time-varying error protection on a
control. bandlimited channel.
In the absence of power control, higher reliability than
4 APPENDIX
needed is allocated to roughly half of the users, at the ex-
pense of unacceptable QOS for the rest of the users. By con- We now derive the closed-form solution to the uplink
trast, power control permits the network to utilize the same optimization problem; the downlink is symmetric. The
amount of power resource to satisfy the QOS contracts of all proof is similar in spirit to [21]. Map substream i of user m
users. m–1
Finally, we consider the variability incurred in the to an index u by u ( i, m ) = i + ∑ N n , and likewise let
achieved SNRs through usage of a statistical bound. From n=1
the solution, we note that the transmit power of user channel v ( j, n ) be a (substream, user) index. Let K be the total
m at any instant is a discrete random variable with probabil-
number of substreams, and define the K × K matrix moreover it will be unique and therefore optimal for system
(22).
A = [ a u, v ] by
We next prove that solving system (22) is equivalent to
solving system (21). We show if a solution to (22) exists,
a u ( i, m ), v ( j, n ) = G m ⁄ SNR i, m , u = v, (20) then it is optimal for (21); we then demonstrate if (22) has
no solution, neither does (21).
= – G n E [ f ]β j, n, u ≠ v.
Suppose x is optimal for (22) for { SNR i, m } ,
Define the K × 1 vectors c, b, x by c u ( i, m ) = β i, m ,
i = 1, …, N m , m = 1, …, M . Clearly x is also feasible
2
b u ( i, m ) = σ , and x u ( i, m ) = x i, m respectively. The
for (21). Let x′ be any feasible solution to (21). Then x′ will
uplink formulation (Eq. 5 - Eq. 7) can then be expressed as
satisfy system (22) for some set { SNR′ i, m } where, from
t
minimize c x (21)
Eq. 6,
such that Ax ≥ b, x ≥ 0 .
SNR′ i, m ≥ SNR i, m , i = 1, …, N m , m = 1, …, N .(26)
We will solve system (21) by first finding the optimal
solution to the system of equalities Noting that the function f ( t ) = t ⁄ ( 1 + t ) is monotonic
in t, we have
t
minimize c x (22)
Nm
such that Ax = b, x ≥ 0 . ′
E[ f ] ∑ β j, m SNR j, m
In general, the solution set for system (22) is a subset of the γ m ′ = ---------------------------------------------------------------
j=1 - ≥ γ m, (27)
N m
solution set for system (21). However, we will prove that ′
(21) and (22) have equal solution spaces for the problem of 1 + E[ f ] ∑ β j, m SNR j, m
interest. j=1