Vous êtes sur la page 1sur 17

Wireless Power Control

Chee Wei Tan

CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010

Outline
Wireless Power Control by LP Wireless Power Control by GP Extensions to Multiple Antennas by SDP

Wireless Cellular Network


3G CDMA2000 EV-DO cellular network link adaptation maximizes uplink/downlink rate using power control

Revamp Power Control!

http://news.cnet.com/830113579 31002802637.html
3

System Considerations
How to solve optimally nonconvex power control problems? How many ways to characterize optimality? How to design distributed power control algorithms with fast convergence and good performance guarantees? How fast is fast? Can we leverage existing technology? What is the industry impact?

System Model
Interference channel with single-user decoding: Treat interference as additive Gaussian noise Control interference and meet objective using power control

Performance Metrics
Signal-to-Interference Ratio: SIRl(p) =
j=l

Gllpl Glj pj + nl

with Glj the channel gains from transmitter j to receiver l and nl the additive white Gaussian noise (AWGN) power at receiver l Attainable data rate (nats per channel use) is a function of SIR, e.g., Shannon capacity formula rl = log(1 + SIRl) Power constraints 1 p P
6

Interference Parameters
Let F be a nonnegative matrix with entries: Fij = and v= Let B be: n1 n2 nL , ,..., G11 G22 GLL B = F + (1/P )v1 . . if i = j Gij Gii , if i = j 0,

Foschinis Power Minimization

minimize l pl subject to SIRl(p) =

Gll pl j=l Glj pj +nl

l l.

Matrix notation: minimize 1 p subject to (I diag()F)p diag()v.


G. J. Foschini & Z. Miljanic, A Simple Distributed Autonomous Power Control Algorithm and its Convergence, IEEE Trans. Vehicular Technology, 1993

IS-95 CDMA Systems, Qualcomm 3G Systems


8

Foschinis Power Minimization


The optimal power vector p is: p = (I diag()F)
1

diag()v.

Fixed-point algorithm: p(k + 1) = diag()Fp(k) + diag()v Distributed Power Control (DPC) algorithm (more illuminating form): l pl(k + 1) = pl(k) l. SIRl(p(k)) Geometric convergence to (I diag()F)1diag()v if and only if (diag()F) < 1
9

Dualities
GP duality: Application to energy-robustness tradeo
minimize epl l subject to log(l/SIRl( )) 0 l, p variables: pl l.

(5)

LP Duality: Application to Beamforming uplink-downlink duality Perron-Frobenius Duality (later on max-min weighted SIR): Application to distributed fast algorithm

10

Power Minimization with Beamforming


Base station has M transmit antennas, each mobile user has one receive antenna (Single-cell multiuser MISO channel) Let hl denote the M -dimensional channel response from base station to lth user, ul denote the M -dimensional transmit beamforming vector, instantaneous transmitted signal denote
L

xmt =
l=1

bl u l

where bl is the transmitted data signal for the lth user Received signal at the lth user: rcvl = bluhl + l
j=l

bj u hl + n l . j

11

Downlink SIR dependent on power p and transmit beamformers U = [u1 . . . uL] SIRl(p, U) = |hul|2 l |huj |2 j=l l + vl .

12

Power Minimization with Beamforming


Total power minimization:
2 minimize l ul subject to l( j=l |huj |2 + vl) |hul|2 0 l l l variables: ul, l.

Change-of-variable technique: Ul = ulu l Equivalent problem in new variables:

Hl = hlh l

minimize l Tr(Ul ) subject to l(Tr(HlUj ) + vl) Tr(HlUl) 0 l, Ul 0, Rank(Ul) = 1 l variables: Ul, l. Relax the problem by removing the rank-one constraint leads to semidenite program (SDP)
13

There exists a rank-one solution for Ul for all l of the SDP Many other extensions including second order cone program (SOCP) preprocessing Stanford CVX, SeDuMi toolbox for SDP State of the art of SDP & SOCP solvers for large (but not huge) problems is quite satisfactory
1. E. Visotsky & U. Madhow, Optimum beamforming using transmit antenna arrays, Proc. of IEEE VTC, 1999 2. M. Chiang, P. Hande, T. Lan & C. W. Tan, Power control in wireless cellular networks, NOW Foundations & Trends in Networking, 2008

14

Max-Min Weighted SIR


Downlink case: consider maxp0

SIRl(p) min subject to l l

pl P .
l

Uplink case: consider maxp0

SIRl(p) min subject to pl P l. l l

Can reformulate as a GP and solve using interior point algorithm. Can reuse the existing DPC algorithm in any way? For distributed solution and its complete analytical solution, see lectures later

15

Summary
A seemingly hard problem can be solved by exploiting the problem structure How many possible ways to solve it? And which is the best way?1
Reading assignment: G. J. Foschini and Z. Miljanic, A Simple Distributed Autonomous Power Control Algorithm and its Convergence, IEEE Transactions on Vehicular Technology, Vol. 42, No. 4, Nov. 1993. M. Chiang, P. Hande, T. Lan and C. W. Tan, Power Control in Wireless Cellular Networks, Foundations and Trends in Networking, 2008.
1

The one that gives you the best mileage!


16