Power Allocation Problem - LectureNotes
Power Allocation Problem - LectureNotes
NETWORKS
Introduction
The course is intended to be an introduction to optimization and
is by no mean intended to be comprehensive.
I hope that the course will serve as a starting point for students
who may apply optimization in their future works or researches.
Main Objectives:
Study fundamentals of optimization theory.
General introduction to basic concepts.
Example applications to communications and networks.
2 Reference Books
We shall assume additive white Gaussian noise (AWGN) for each subchannel.
Let N be the number of subchannels. Denote the noise levels on these subchannels by
n1 , n2 ....nN .
If we allocate transmit signal powers p1 , p2 ....pN for the N subchannels, then from Shan-
non capacity formula from information theory tells us that subchannel i can support the
transmission of data at the bit rate up to
p
W log2 1 + i bits per second(bps)
ni
In order to maximize the total bit rate over all subchannels. We shall see that the
KKT conditions for optimality can be used to obtain an optimal solution.
N
p
log 1 + i
X
C(p) = −
ni
i=1
N
X
g0 (x) = pi − P
i=1
gi (x) = −pi , i {1, 2, ...N}
N
X
Λ(p,λ) = C(p) + λ0 g0 (p) + λi gi (p)
i=1
N
X
∇C(p∗ ) + λ∗0 ∇g0 (p∗ ) + λ∗i ∇gi (p∗ )
i=1
∂Λ(p∗ , λ∗ ) 1
=− ∗ + λ∗0 − λ∗i
∂pi pi + ni
1
pi∗ + ni =
λ∗0 − λ∗i
Observations
From above analysis we have two distinct observations
Observation 1: The values of signal plus noise powers are equal for all subchannels in
which nonzero powers are allocated.
PN
Observation 2: All available power is allocated. we conclude from i=1 pi∗ = P
Waterfilling Algorithm
Observations 1 and 2 give rise to a procedure commonly referred to as waterfilling
algorithm
Since it is analogous to pouring all available water into a container whose depths in
different parts are specified by the parameters n1 , n2 ....nN .
By making N sufficiently large for good approximation, waterfilling is used to compute the
channel capacity for frequency selective channels.