PHD Seminar BC
PHD Seminar BC
i
, u
i
and v
i
.
2.2 Power Allocation Among Spatial Subchan-
nels
We assume that the total transmitted power is constrained to P. Given the
power constraint, dierent power allocation among spatial subchannels can
aect the channel capacity tremendously. In the following context, depending
on the power allocation among spatial subchannels, several popular schemes
are presented.
2.2.1 Equal Power
If the transmitter has no knowledge about the channel, the most judicious
strategy is to allocate the power to each transmit antenna equally. In this
case, the received signals can be written as
y =
P
N
t
Hx +z (2.3)
14
The associated instantaneous channel capacity with respect to H can be
written as [1]
C
eq
=
N
t
i=1
log
_
1 +
P
N
t
2
z
2
i
_
(2.4)
In the following gure, numerical results of ergodic (average) channel
capacity for 2 2, 3 3 and 4 4 Rayleigh at fading channels are shown
in Figure 2.2.
0 5 10 15 20 25
0
5
10
15
20
25
SNR (dB)
C
a
p
a
c
i
t
y
(
b
i
t
/
s
/
H
z
)
Equal power
2x2
3x3
4x4
5x5
Figure 2.2: Capacity for equal power allocation.
15
2.2.2 Water-Filling
If the transmitter has full knowledge about the channel, the most judicious
strategy is to allocate the power to each spatial subchannel by water-lling
principle [1]. It allocates more power when a spatial subchannel has larger
gain (i.e. {
i
}) and less when a subchannel gets worse. With V at the
transmitter and U at the receiver, the original MIMO channel is converted to
r uncoupled parallel SISO channels. The WF scheme is shown in Figure 2.3.
Constellation
Mapper
Ant-1
Ant-Nt
Ant-1
Ant-Nr
~
y
Binary
Info.
source Binary
Info.
Out
V U
Channel
Estimation
Feedback
P
1
x
1
S/P
D
e
t
e
c
t
o
r
P
o
w
e
r
A
l
l
o
c
a
t
i
o
n
Nt-r 0's
H
P
r
x
r
Figure 2.3: Water-lling scheme.
For spatial subchannel i, i = 1, 2, . . . , r, the received signal is
y
i
=
_
P
i
i
x
i
+ z
i
(2.5)
where
r
i=1
P
i
= P as a constraint and z
i
the is AWGN variable with zero mean
16
and
2
z
variance. Following the method of Lagrange multipliers, the optimal
P
i
can be found as [1]
P
i
= max
_
1
Lln 2
2
z
i
, 0
_
, i = 1, 2, . . . , r (2.6)
where L is the Lagrange multiplier. The instantaneous channel capacity is
for this spatial subchannel is
C
wf,i
= log
_
1 +
P
i
2
z
2
i
_
(2.7)
Then the total channel capacity with respect to H is
C
wf
=
r
i=1
C
wf,i
(2.8)
The WF scheme maximizes the channel capacity by power allocation over
spatial subchannels. Since
1
2
. . .
r
, we have P
1
P
2
. . . P
r
and
C
wf,1
C
wf,2
. . . C
wf,r
. In practice, if each spatial subchannel requires
the same error rate performance, the spatial subchannel with larger gain
(i.e.
P
i
i
) can have higher rate; while if each spatial subchannel has the
same rate, the spatial with larger gain will have better performance. The
application of these two approaches will depend on the type of service. For
example, the important data needs high quality but the voice can tolerate
low quality.
In the following gure, numerical results of ergodic (average) channel
capacity for 2 2, 3 3 and 4 4 Rayleigh at fading channels are shown
in Figure 2.4.
In the WF scheme, the feedback bandwidth for the perfect CSI grows
with respect to the number of transmit and receive antennas. In practice,
the bandwidth for CSI feedback is often very limited. The large feedback
bandwidth also aects the transmission eciency.
17
0 5 10 15 20 25
0
5
10
15
20
25
SNR (dB)
C
a
p
a
c
i
t
y
(
b
i
t
/
s
/
H
z
)
Waterfilling
2x2
3x3
4x4
5x5
Figure 2.4: Capacity for water-lling.
2.2.3 Eigen-Beamforming
To save feedback bandwidth, beamforming can be considered. Beamform-
ing is a linear signal processing technique that control the complex weights
of the transmit and receive antennas jointly to optimize the signal-to-noise
ratio (SNR) in one direction [7] [10]. For the MIMO model, the optimal
beamforming is called eigen-beamforming. In the following context, this
optimal solution is referred to as beamforming.
In this scheme, the eigenvector associated with the maximum singular
value
1
from the transmitter side, i.e., v
1
, is feedback to the transmitter as
18
the transmission beamformer. The Eigen-beamforming scheme is shown in
Figure 2.5.
Constellation
Mapper
Detector
Ant-1
Ant-Nt
Ant-1
Ant-Nr
~
y
1
Binary
Info.
source
Binary
Info.
Out
v
1
u
1
Channel
Estimation
Feedback
H
Px
1
Figure 2.5: Eigen-beamforming scheme.
We assume one symbol, saying x
1
, is transmitted. At the receiver, the
received vector can be written as
y
1
=
PHv
1
x
1
+z
1
(2.9)
where z
1
is the additive white Gaussian noise vector with i.i.d. symmetrical
complex Gaussian elements of zero mean and variance
2
z
.
The eigenvector associated with the maximum singular value from the
19
receiver side, i.e., u
1
, is applied as the receiver beamformer. Then we have
y
1
= u
H
1
y
1
=
P
1
x
1
+ z
1
(2.10)
where z
1
is Gaussian with zero mean and variance
2
z
. As can be seen from
(2.10), only the spatial subchannel associated with the maximum singular
value
1
is applied.
The associated instantaneous channel capacity with respect to H can be
written as
C
bf
= log
_
1 +
P
2
z
2
1
_
(2.11)
In the following gure, numerical results of ergodic (average) channel capacity
for 22, 33 and 44 Rayleigh at fading channels are shown in Figure 2.6.
The eigen-beamforming scheme can save feedback bandwidth and is op-
timized in terms of SNR [10]. However, since only one spatial subchannel is
considered, this scheme suers from loss of channel capacity [17], especially
when the number of antennas grows. Also, as can be seen from the gure,
the gap of capacity between dierent numbers of antennas is nearly the same
for all the SNR region.
20
0 5 10 15 20 25
0
1
2
3
4
5
6
7
8
9
10
SNR (dB)
C
a
p
a
c
i
t
y
(
b
i
t
/
s
/
H
z
)
Beamforming
2x2
3x3
4x4
5x5
Figure 2.6: Capacity for eigen-beamforming.
21
Chapter 3
Recent Research Results
In this chapter, the current achievements will be presented as follows.
3.1 Beam-Nulling
Inspired by the eigen-beamforming scheme, we will propose a new beamforming-
like scheme called beam-nulling (BN). This scheme uses the same feedback
bandwidth as beamforming. That is, only one eigenvector is fed back to the
transmitter. Unlike the eigen-beamforming scheme in which only the best
spatial subchannel is considered, in the beam-nulling scheme, only the worst
spatial subchannel is discarded. Hence, the loss of channel capacity as com-
pared to the optimal water-lling scheme can be reduced. The Beam-Nulling
scheme is shown in Figure 3.1.
In this scheme, the eigenvector associated with the minimum singular
value from the transmitter side, i.e., v
N
t
, is feedback to the transmitter.
By a certain rule, a subspace orthogonal to the weakest spatial channel is
22
Constellation
Mapper
Ant-1
Ant-Nt
Ant-1
Ant-Nr
~
y
Binary
Info.
source
Binary
Info.
Out
U
Channel
Estimation
Feedback
x
1
S/P
x
Nt-1
D
e
t
e
c
t
o
r
H
Figure 3.1: Beam-Nulling scheme.
23
constructed. That is, the following condition should be satised.
H
v
N
t
= 0 (3.1)
The N
t
(N
t
1) matrix = [g
1
g
2
. . . g
Nt1
] spans the subspace. Note that
the rule to construct the subspace should also be known to the receiver.
An example to construct the orthogonal subspace is presented as follows.
We construct an N
t
N
t
matrix
A = [v
N
t
I
] (3.2)
where I
= [I
(N
t
1)(N
t
1)
0
(N
t
1)1
]
T
. Applying QR decomposition to A, we
have
A = [v
N
t
] R (3.3)
where R is an upper triangular matrix with the (1,1)-th entry equal to 1.
is the subspace orthogonal to v
Nt
.
At the transmitter, N
t
1 symbols denoted as x
P
N
t
1
Hx
+z
(3.4)
where z
by U
H
, we have
y =
P
N
t
1
_
_
_
B
0
T
_
_
_x
z (3.5)
where
z is additive white Gaussian noise vector with i.i.d. symmetrical com-
plex Gaussian elements of zero mean and variance
2
z
. With the condition in
24
(3.1),
V
H
=
_
_
_
B
0
T
_
_
_ (3.6)
where
B =
_
_
_
_
_
_
_
_
_
_
v
H
1
g
1
v
H
1
g
2
. . . v
H
1
g
Nt1
v
H
2
g
1
.
.
.
. . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
v
H
Nt1
g
1
. . . . . . v
H
Nt1
g
Nt1
_
_
_
_
_
_
_
_
_
_
(3.7)
B is an (N
t
1) (N
t
1) unitary matrix. As can be seen from (3.5), the
available spatial channels are N
t
1. Since the weakest spatial subchannel is
nulled in this scheme, power can be allocated equally among the left better
N
t
1 subchannels. Equation (3.5) can be rewritten as
P
N
t
1
Bx
(3.8)
where
y
and
z
z, respectively, and
= diag[
1
,
2
, . . . ,
(Nt1)
]. From (3.8), the associated
instantaneous channel capacity with respect to H can be found as
C
bn
=
N
t
1
i=1
log
_
1 +
P
(N
t
1)
2
z
2
i
_
(3.9)
In the following gure, numerical results of ergodic (average) channel capacity
for 22, 33 and 44 Rayleigh at fading channels are shown in Figure 3.2.
25
0 5 10 15 20 25
0
5
10
15
20
25
SNR (dB)
C
a
p
a
c
i
t
y
(
b
i
t
/
s
/
H
z
)
Beamnulling
2x2
3x3
4x4
5x5
Figure 3.2: Capacity for beam-nulling.
As can be seen, the beam-nulling scheme only needs one eigenvector to
be fed back. However, since only the worst spatial subchannel is discarded,
this scheme can increase channel capacity signicantly as compared to the
conventional beamforming scheme.
3.2 Comparisons Among the Four Schemes
In this section, we compare the new proposed beam-nulling scheme with the
other schemes. Water-lling is the optimal solution among the four schemes
26
for any SNR.
Let
C
eq
,
C
bf
, and
C
bn
denote the ergodic channel capacities of equal
power, beamforming and beam-nulling, respectively. That is,
C
eq
= E(C
eq
) (3.10)
C
bf
= E(C
bf
) (3.11)
C
bn
= E(C
bn
) (3.12)
where E() denotes expectation with respect to H. Let = P/
2
z
denote SNR.
Dierentiating the above ergodic capacities with respect to respectively, we
have
C
eq
= E
_
_
N
t
i=1
1
+
N
t
2
i
_
_
(3.13)
C
bf
= E
_
_
1
+
1
2
1
_
_
(3.14)
C
bn
= E
_
_
Nt1
i=1
1
+
Nt1
2
i
_
_
(3.15)
The dierential will also be referred to as slope. The second order dier-
entials are listed as follows.
2
C
eq
2
= E
_
_
_
_
_
N
t
i=1
1
_
+
N
t
2
i
_
2
_
_
_
_
_
(3.16)
2
C
bf
2
= E
_
_
_
1
_
+
1
2
1
_
2
_
_
_ (3.17)
27
2
C
bn
2
= E
_
_
_
_
_
N
t
1
i=1
1
_
+
N
t
1
2
i
_
2
_
_
_
_
_
(3.18)
As can be seen, the above ergodic capacities are concave and monotonically
increasing with respect to . With the fact that
1
2
. . .
N
t
, it can
be readily checked that the slopes of ergodic capacities associate with equal
power and beam-nulling are bounded as follows.
E
_
_
N
t
+
Nt
1
_
_
C
eq
E
_
_
N
t
+
Nt
N
t
_
_
(3.19)
E
_
_
N
t
1
+
N
t
1
1
_
_
C
bn
E
_
_
N
t
1
+
N
t
1
(N
t
1)
_
_
(3.20)
For the case of N
t
= 2, beamforming and beam-nulling have the same
capacity for any SNR as can be seen from equations of capacity and slope.
If 0, i.e., at low SNR, it can be easily found that
C
bf
C
bn
C
eq
, 0 (3.21)
If , i.e., at high SNR, it can be easily found that
C
eq
C
bn
C
bf
, (3.22)
Hence, at medium SNR,
C
bn