Beruflich Dokumente
Kultur Dokumente
Jinho Choi
School of Information and Communications
GIST
October 2013
1 / 64
Precoding and Massive MIMO
1. Introduction
4. Massive MIMO
4.1 Partial cooperation
4.2 Pilot contamination in massive MIMO
4.3 Pilot contamination precoding
5. Conclusions
2 / 64
Precoding and Massive MIMO
1. Introduction
1. Introduction
I Beamforming with antenna arrays has been studied for
wireless communications since early 90s.
I Transmit and receive beamforming have been considered for
cellular systems to improve the signal-to-noise ratio (SNR) or
extend the coverage.
I A better beamforming gain can be achieved if the number of
antennas in an array is large.
I In cellular systems, as base stations (BSs) can have a number
of antennas, beamforming can be easily employed at BSs.
I In this case, transmit beamforming becomes downlink
beamforming and receive beamforming becomes uplink
beamforming.
3 / 64
Precoding
Beamformingandand
Massive MIMO
Massive MIMO
1.
1. Introduction
Introduction
Beamformer
w1
Data symbols
w2
Dynamic or static
Beampattern
wL
44 // 64
60
Precoding and Massive MIMO
1. Introduction
5 / 64
Precoding and Massive MIMO
1. Introduction
h2
TX 2
r = h1 w1 s + h2 w2 s + n = (h1 w1 + h2 w2 )s + n,
A. Point-to-point MIMO
I To achieve diversity gain:
I beamforming with CSI at transmitter
I space-time coding (STC) without CSI at transmitter
I To achieve multiplexing gain:
I SVD with CSI at transmitter
I BLAST techniques without CSI at transmitter
I There are also other techniques that enjoy the trade-off
between diversity and multiplexing gains
Ref. Zheng and Tse, Diversity and Multiplexing: A Fundamental
Tradeoff in Multiple Antenna Channels, IEEE TIT, May 2003
9 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
10 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
Coded
1
10
Deigen
Eigen 1
Optimized
2
10
BER
3
10
4
10
4 6 8 10 12 14 16
SNR (dB)
11 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
B. Multiuser MIMO
I There exists interference due to the presence of multiple
signals to be transmitted to multiple users.
I Dirty paper coding (DPC) can achieve the channel capacity
by suppresing known interference. However, its
implementation is not easy.
I Multiuser beamforming can provide a reasonable performance
with low-complexity.
I A better performance can be achieved with multiuser diversity
& user selection
I CSI at BS is required to mitigate the (intra-cell) interference:
I No feedback in TDD: channel reciprocity can be used
I Feedback in FDD: excessive overhead
I Resource allocation (including power control) becomes a
crucial.
12 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
13 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
30
C (equal power)
sum
C
md
Cmbeam (approx.)
25
20
15
10
0
0 2 4 6 8 10 12 14 16 18 20
Achievable Rate
14 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
Mobile terminal
Mobile terminal
Mobile terminal
{Pk , w
P
k } = arg min k Pk
Pq |hH
q wq |
2
(
H 2 2 q
P
subject to k6=q Pk |hq wk | +q
2
||wq || = 1
16 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
17 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
TX RX
TX RX
TX RX
18 / 64
Precoding and Massive MIMO
2. Overview of Beamforming Techniques
D. Massive MIMO
I TDD mode to exploit the channel reciprocity for the CSI at
BS and make use of large antenna arrays
I Multi-cell, but noncooperative systems
I Due to noncooperative transmissions, no backhaul
communications between BSs are required.
I But, systems can suffer from ICI.
I Using massive antenna arrays, ICI can be mitigated.
I Key issues: pilot contamination, array calibration, etc.
I There are other advantages. One of them is that the
short-term fading disappears by the law of large numbers.
I This makes resource allocation easy and reduces the burden of
channel coding.
20 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
BS
BS BS
23 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.1 Multicell with a common group of users
24 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.1 Multicell with a common group of users
Key variables:
Hq : L K downlink channel matrix from BS q to all K users
Gq : L N submatrix of Hq (channel vectors to users in cell q from B
Wq : L N beamforming matrix at BS q
sq : N 1 signal vector at BS q
rq : N 1 signal vector received by users in cell q
nq : N 1 noise vector received by users in cell q
Let
Hq = [Gq Hq ].
The received signal vector at users in cell q is given by
Q
X
rq = GH
q Wp sp + nq
p=1
Wq = q P
q Gq ,
27 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.1 Multicell with a common group of users
G1
BS1 user 1
W1 H 1
H 2
BS2 user 2
W2 G2
where E[nq nH H H
q ] = I, E[sq sq ] = I, and q = Gq Pq Gq .
29 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
30 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
Key variables:
Hq,k : the L N channel matrix from BS k to the users in cell q
Wq : the L N beamforming matrix
sq : the N 1 signal vector from BS q
31 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
33 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
maxWq SINRi;q
subject to ||Wq ||2F Pq
34 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
Ik (Wq ) = ||HH 2
k,q Wq ||F .
35 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
36 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
min Q
P
q=1 Cq (Wq )
subject to SINRi;q (Wq ) i;q
where
N
q ) Cq ( W
q ).
X
gq () = i;q SINRi;q (W
i=1
38 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
39 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
min Q
P PQ
q=1 k=1 Ik (Wq )
subject to SINRi;q (Wq ) i;q
X k6=q Hk,q HH
P
I
k,q
I wi wi;q
I hi hi;q
I 2
Zi Zi;q + i;q
I i i;q
40 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
Since the ICI Zi;q (Wq ) in the SINR depends on the other
beamforming matrices, an iterative algorithm is required to solve
the NML beamforming problem, which consists of the following
two key steps.
I Solving the local minimization problem (at BS q):
(`)
Wq = arg min Cq (Wq )
|hH
i;q,q wi;q |
2
subject to P H 2 (`1) 2
i;q
u6=i |hi;q,q wu;q | +Zi;q (Wq )+i;q
Low-Dimensional Beamforming
I Consider the following eigendecomposition:
X
X= Hk,q HH H
k,q + I = EE ,
k6=q
43 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
Simulation Results
I Three different approaches are used:
I Approach A: The cooperative min-power beamforming with
target SINR
I Approach B: The NML beamforming with target SINR
I Approach C: The noncooprative minimum total power (NMP)
beamforming with the following cost function:
Cq (Wq ) = ||Wq ||2F ,
which is to reduce the transmission power rather than
interference leakage (an egoistic approach).
I Approach A is cooperative, while Approaches B and C are
noncooperative (i.e., no backhaul communications between
BSs)
I The elements of channel matrices are independent Gaussian
(no spatial correlation is considered)
44 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
16
14
Achieved SINR (dB)
12
10
2
4 6 8 10 12 14 16 18 20
Target SINR (dB)
L = 30, Q = 3, N = 5, and M = L = 30
45 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
60
Total transmission power (dB)
50
40
30
20
10
4 6 8 10 12 14 16 18 20
Target SINR (dB)
L = 30, Q = 3, N = 5, and M = L = 30
46 / 64
Precoding and Massive MIMO
3. Cooperative (Network) MIMO
3.2 Multicell with different groups of users
34
Total transmission power (dB)
32
30
28
26
24
5 10 15 20 25 30
M
L = 30, Q = 3, N = 5, and = 10 dB
47 / 64
Precoding and Massive MIMO
4. Massive MIMO
4. Massive MIMO
I Proposed by Marzetta in 2010 to effectively mitigate ICI
without any cooperation between BSs
I A massive MIMO system consists of BSs with large antenna
arrays.
I The number of antenna elements is about 100.
I Frequency reuse factor is 1 and orthogonal channels within a
cell (no intra-cell interference)
I TDD to exploit the channel reciprocity.
I The channel vector, h, from a BS to a user can be factorized
as p
h = u,
where is a parameter for large-scale fading and
u CN 0, L1 I is a random vector for small-scale fading,
where L 1.
48 / 64
Precoding and Massive MIMO
4. Massive MIMO
Base Station
Large Array
narrow beam
user user
50 / 64
Precoding and Massive MIMO
4. Massive MIMO
0.2
0.15
|<x,y>|2
0.1
0.05
0
0 10 20 30 40 50 60 70 80 90 100
L: number of antennas
This is the key idea of massive MIMO. That is, without any
cooperation between BSs, it is possible to mitigate ICI by
increasing L (similar to CDMA). 51 / 64
Precoding and Massive MIMO
4. Massive MIMO
X X 1X
Pq |hH 2 2
k,q wq | +k = Pq k |uH 2 2
k,q wq | +k Pq k,q +k2 .
L
q6=k q6=k q6=k
52 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.1 Partial cooperation
53 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.1 Partial cooperation
54 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.1 Partial cooperation
16
14
12
average/minimum SINR (dB)
10
55 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.2 Pilot contamination in massive MIMO
56 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.2 Pilot contamination in massive MIMO
where k ||.
k = ||p
h
I Since hk,q = k,q uk,q and uk,q are iid, we have
uH
k,q ut,q k,q as L w.p. 1
I Thus, as L , we have
K
X sq
xk = k,q + vk .
q
q=1
59 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.3 Pilot contamination precoding
I Staking xk s:
x = [x1 . . . xK ]T
k,q
= [s1 . . . sK ]T + [v1 . . . vK ]T
q
= As + v,
where [A]k,q = k,q
q
.
I To avoid the interference, s can be replaced with
s Bs,
where B = A1 . This means that the BSs need to exchange
the channel information (elements in A) for precoding.
I The resulting received signal is
x = s + v.
60 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.3 Pilot contamination precoding
61 / 64
Precoding and Massive MIMO
4. Massive MIMO
4.3 Pilot contamination precoding
0.6
1
0.4
0.5
0.2
0 0
-0.2
-0.5
-0.4
-1
-0.6
-1.5 -0.8
-1.5 -1 -0.5 0 0.5 1 1.5 -0.8 -0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8
62 / 64
Precoding and Massive MIMO
5. Conclusions
5. Conclusions
I Beamforming is a simple and effective means to increase SNR
or coverage, which can be employed in more complicated
systems as follows:
I Network MIMO
I Cooperation between BSs with not too big arrays
I More controls (for better performance)
I Backhaul overhead for cooperation might be a critical issue
I Distributed optimization will play a key role in reducing
backhaul overhead
I Massive MIMO
I Noncooperation, each BS with a big array might be robust
enough against ICI
I Less controls (for implementation)
I There exists ICI, and due to it, there is difficulty to guarantee
certain performance in terms of SINR.
I As a remedy, partial cooperation could be considered.
63 / 64
Precoding and Massive MIMO
5. Conclusions
64 / 64