Diversity in Communications: Short Course On MIMO Systems
Diversity in Communications: Short Course On MIMO Systems
Diversity in Communications
Raviraj S. Adve
University of Toronto
Receive Diversity
Transmit Diversity
Transmit Diversity
Antenna array theory
MIMO Information Theory
Course Summary
Probability theory
END
Linear algebra
Optimization
Digital communications
Transmitter
Receive Diversity
Channel
Transmit Diversity
E{|s(t)|2 }
BER
Info Theory
SNR =
Basic Wireless Communications E{|n(t)|2 }
Receive Diversity
Transmit Diversity
where E{} is the expectation operator.
MIMO Information Theory Binary Phase Shift Keying (BPSK): bit = 0 symbol = 1, bit
Course Summary = 1 symbol = -1
END
For an AWGN channel and BPSK
BER = Q 2SNR
Z
1 2
Q(x) = et /2 dt
2 x
x2 /2
Q(x) < (1/2)e , i.e., for an AWGN channel BER falls
off exponentially with SNR.
Transmitter
Receiver
Receive Diversity
Transmit Diversity
Format Source Bits Channel Symbols Demodulator
Data Detector
MIMO Information Theory Decoder Decoder and sample
Receiver
Course Summary
END
Receive Diversity
In line-of-sight conditions, received power 1/d2 (where
d is the distance between transmitter and receiver)
Transmit Diversity
Basic Digital Communications Large Scale Fading = 10(x1 +x2 +...) = 10x
Basic Wireless Communications
Fading Channels
Small Scale Fading
where xi is the attenuation due to object # i.
Rayleigh/Rician Fading
Flat/Selective Fading By the Cental Limit Theorem, x = (x1 + x2 + . . .) is a
Slow/Flat fading
Summary Gaussian random variable
SISO Data Model
Channel Fluctuation
Error Rate
large scale fading can be modelled as log-normal, i.e., the
Outage Probability log of the fading term is distributed normal:
Receive Diversity
Transmit Diversity
Large Scale Fading = 10x ;
2
MIMO Information Theory x N (0, h1 )
Course Summary
END
Large scale fading varies slowly, remaining approximately
constant over hundreds of wavelengths
There is not much one can do about large scale fading or
distance attenuation, just power control
Receive Diversity
Transmit Diversity
Course Summary
END
Transmit Diversity
If one of the components is dominant (Rician fading)
MIMO Information Theory
h CN (, h2 )
Course Summary
END
CN (, h2 ) represents the complex Gaussian distribution with
mean and variance h2 .
We will focus on Rayleigh fading, i.e., h CN (0, h2 )
Note: Rayleigh fading is just one of many fading models
Waveform Diversity and Design Conference, Slide #11
Small Scale Fading (cont...)
Frequency flat versus frequency selective fading:
Symbol period: Ts ; Channel time spread: Tc
Introduction and Overview
Transmit Diversity
If Tc < Ts , h(t) = (t) H(j) = constant (Frequency
MIMO Information Theory
flat fading)
P
Course Summary
If Tc > Ts , h(t) = (t Ts ) H(j) 6= constant
END (Frequency selective fading)
Note: CN (0, h2 )
Transmit Diversity
Course Summary
END
Transmit Diversity
Course Summary
END
Transmit Diversity
channel is often in bad shape
MIMO Information Theory Note: h2 = E{|h|2 } = average power in channel
Course Summary
Set h2 = 1 for convenience (channel does not
END
introduce power)
0
Instantaneous Channel power (dB)
Transmit Diversity
Course Summary
10
END
15
20
25
0 10 20 30 40 50 60 70 80 90 100
Sample #
END
At high SNR ( ),
1
BER
Receive Diversity
Transmit Diversity 4
10
Course Summary
END
0 5 10 15
SNR (dB)
Note: In the case with fading, the BER v/s SNR plot (in log-log
format appears as a straight line)
Transmit Diversity
Again, as ( )
MIMO Information Theory
1
Course Summary Pout
END
Receive Diversity
Transmit Diversity
END
Course Summary
END
w1*
Introduction and Overview x2
Output Signal
Basic Digital Communications
w2*
Basic Wireless Communications
wN *
Receive Diversity
Introduction
xN
Diversity Types
Selection Combining
Maximal Ratio Combining
Diversity Order
Equal Gain Combining This appears to be beamforming! (for a single user!).
Comparing Schemes
Summary
Correlation Write the received signal as a vector
Transmit Diversity
Transmit Diversity
Course Summary
END
Transmit Diversity
s /
Transmit Diversity
Pout = 1 e for N = 1, i.e.,exponential gains in
MIMO Information Theory
outage probability
Course Summary
END
Note: at high SNR, as
N
1
Pout
Receive Diversity
Introduction
Outage Probability (P out)
Diversity Types
2
Selection Combining 10
Maximal Ratio Combining
Diversity Order
Equal Gain Combining
Comparing Schemes
Summary 3
10
Correlation
Transmit Diversity
END
0 5 10 15 20
SNR (dB)
N=1
Introduction and Overview
N=2
N=3
Basic Digital Communications N =4
Diversity Types
Selection Combining
Transmit Diversity
3
MIMO Information Theory 10
Course Summary
END
4
10
40 35 30 25 20 15 10 5 0 5 10
s/ (dB)
Receive Diversity
Introduction
Diversity Types
2
Selection Combining 10
Maximal Ratio Combining
Diversity Order
BER
Transmit Diversity
END
0 2 4 6 8 10 12 14 16 18 20
= Average SNR (dB)
Receive Diversity
Introduction
Diversity Types
SNR analysis:
Selection Combining
Maximal Ratio Combining Note, Pout = P (out < s ) is also the cumulative density
Diversity Order
Equal Gain Combining function (CDF) of output SNR
Comparing Schemes
Summary
Correlation the probability density function, f (out ) = dPout /dout
Transmit Diversity
N out / h iN 1
out /
MIMO Information Theory
f (out ) = e 1e
Course Summary
END Z
Also, E {out } = out f (out )dout
0
N
X 1
E {out } = ,
Introduction and Overview
n=1
n
Basic Digital Communications
Basic Wireless Communications
1
C + ln N + ,
Receive Diversity
Introduction 2N
Diversity Types
Selection Combining
Maximal Ratio Combining
The gain in SNR is only ln(N)!!!
Diversity Order
Equal Gain Combining
Comparing Schemes
Summary
Correlation
Transmit Diversity
Course Summary
END
Comparing Schemes
Summary
5
Correlation
Transmit Diversity
10
MIMO Information Theory
Course Summary 15
END
20
No diversity
4 branch selection
25
10 20 30 40 50 60 70 80 90 100
Sample #
Receive Diversity
Introduction N
X
Diversity Types
Selection Combining Output Signal = y = wn xn = wH hs + wH n
Maximal Ratio Combining
Diversity Order n=1
Equal Gain Combining H 2
Comparing Schemes w h E{|s|2 }
Summary
Correlation
Output SNR = out = n o
2
Transmit Diversity
E |wH n|
H 2
MIMO Information Theory
w h E{|s|2 }
Course Summary =
END
2 ||w||2
"
H
2 #
w h
MRC: wMRC = max [out ] = max 2
w w ||w||2
Course Summary
i.e., the output SNR is the sum of the SNR over all receivers
END PDF of output SNR:
N 1
1 out out /
f (out ) = f (1 ) f (2 ) f (N ) = e ,
(N 1)! N
Diversity Types
sc
Selection Combining
Maximal Ratio Combining
Diversity Order 2
Equal Gain Combining
10
Comparing Schemes
Summary
Correlation
Transmit Diversity
3
MIMO Information Theory 10
Course Summary
END
4
10
40 35 30 25 20 15 10 5 0 5 10
s/ (dB)
Receive Diversity
Introduction
Diversity Types
2
Selection Combining 10
Maximal Ratio Combining
Diversity Order
BER
Transmit Diversity
END
0 2 4 6 8 10 12 14 16 18 20
= Average SNR (dB)
Receive Diversity
Introduction
Diversity Types
Selection Combining
The diversity order measures the number of independent
Maximal Ratio Combining
Diversity Order
paths over which the data is received
Equal Gain Combining
Comparing Schemes
Summary
Can also use Pout in the definition
Correlation
Transmit Diversity
Diversity order is (formally) a high-SNR concept
MIMO Information Theory
Provides information of how useful incremental SNR is
Course Summary
END
Sometimes diversity order is abused:
the high-SNR definition masks system inefficiencies
2
Receive Diversity 10
Introduction
Diversity Types
Selection Combining
BER
3
Maximal Ratio Combining 10
Diversity Order
Equal Gain Combining
Comparing Schemes
Summary 4
10
Correlation
Transmit Diversity
5
10
MIMO Information Theory
Course Summary
6
END 10
10 5 0 5 10 15 20 25 30
N
BER versus output SNR. Note that even though output SNR is
the same, the BER is significantly different.
Receive Diversity
Introduction 2
10
Diversity Types
Selection Combining
Maximal Ratio Combining
BER
Diversity Order
Equal Gain Combining
Comparing Schemes
3
Summary 10
Correlation
Transmit Diversity
Course Summary 4
10
END
0 2 4 6 8 10 12 14 16 18 20
= Average SNR (dB)
9
Basic Digital Communications
Receive Diversity
7
Introduction
Diversity Types
Selection Combining
Gain in SNR (dB)
6
Maximal Ratio Combining
Diversity Order
5
Equal Gain Combining
Comparing Schemes
Summary 4
Correlation
Transmit Diversity 3
Course Summary
1 Selection
END Maximal Ratio
Equal Gain
0
1 2 3 4 5 6 7 8 9 10
Number of elements (N)
Transmit Diversity
Requires knowledge of channel and matching over
MIMO Information Theory
several 10s of dB
Course Summary
Easiest to analyze
END
Equal Gain Combining
Small loss w.r.t. MRC
Very difficult to analyze, but may be a good trade off for
implementation
Receive Diversity
Introduction The key is the independence between the copies of the
Diversity Types
Selection Combining same signal
Maximal Ratio Combining
Diversity Order
Equal Gain Combining
The independence makes the gains in error rates
Comparing Schemes exponential with linear gains in number of elements
Summary
Correlation
Transmit Diversity
So, the question is ....under what circumstances can we
MIMO Information Theory assume independence?
Course Summary
END
Receive Diversity
Introduction 2
Diversity Types 10
Selection Combining
F ( )
s
Transmit Diversity
4
10
=0
MIMO Information Theory = 0.25
= 0.50
Course Summary = 0.75
=1
5
END 10
20 15 10 5 0 5 10
/ (dB)
s
END
ZL : Diagonal load matrix
Voc : Open circuits voltages that would arise without mutual
coupling
V: True received voltages
END
So, the angular distribution is crucial
Depends on where the receiver is
at the mobile or the base station
the base station looks down on the mobile
Transmit Diversity
MIMO Information Theory The required distance is therefore determined by the array
Course Summary setting
END
Receive Diversity
multiple receivers multiple copies
Transmit Diversity
Transmit Diversity
What about the MISO situation?
Space-Time Coding
Alamoutis Scheme
Very useful in the expected asymmetrical communication
Design Criteria
Examples of Codes
scenarios with more traffic from base station to mobile
Multiplexing
Summary Base station is expensive, has more space, has multiple
MIMO Information Theory antennas
Course Summary Mobile is cheap, has little space, has one antenna
END
Users are downloading information, e.g., a webpage
Receive Diversity N
X
Transmit Diversity Received Signal = x = hn s + noise
Transmit Diversity
Space-Time Coding n=1
Alamoutis Scheme
Design Criteria
Examples of Codes = hs + n
Multiplexing
Summary
Transmit Diversity
On time slot 2, antenna n = 2 transmits the same symbol s
Transmit Diversity
Space-Time Coding
Alamoutis Scheme x2 = h2 s + n2
Design Criteria
Examples of Codes
Multiplexing
At the receiver form a receive vector over the two time slots
Summary
" # " # " #
MIMO Information Theory x1 h1 n1
x = = s+ = hs + n
Course Summary
x2 h2 n2
END
Transmit Diversity
x1 = h1 s1 + h2 s2 + n1
Transmit Diversity
Space-Time Coding
Alamoutis Scheme
In the second time slot,
Design Criteria
Examples of Codes
antenna n = 1 transmits s2 while antenna n = 2 transmits s1
Multiplexing
Summary
x2 = h1 s2 + h2 s1 + n2
MIMO Information Theory
Course Summary
One subtle, but important point: each element transmits with
END
half the available power
Form the received data vector (note the conjugate on x2 )
" # " #" # " #
x1 h1 h2 s1 n1
x= = +
x2 h2 h1 s2 n2
2 2
y2 = |h1 | + |h2 | s2 + noise
we get order-2 diversity on both symbols!!
SISO
1
10 Receive Diversity
Alamouti Scheme
Introduction and Overview
2
Receive Diversity 10
Transmit Diversity
Transmit Diversity
BER
Space-Time Coding
Alamoutis Scheme
Design Criteria 3
Examples of Codes
10
Multiplexing
Summary
Course Summary 4
10
END
0 2 4 6 8 10 12 14 16 18 20
= Average SNR (dB)
Course Summary
C= .. .. .. ..
. . . .
END
cN 1 cN 2 cN L
here, cnl is a function of the K symbols transmitted in time
slot l using antenna n
e.g., in the Alamouti scheme, c12 = s2
Transmit Diversity
Es is the available energy, = Es / 2
Transmit Diversity
Space-Time Coding
Alamoutis Scheme
d C, C is the effective distance between C and C
Design Criteria
Examples of Codes
Multiplexing
2
Summary d C, C = hH EEH h
MIMO Information Theory
Course Summary
c11 c11 c12 c12 c1L c1L
c21 c21 c22 c22 c2L c2L
END
E = .. .. .. ..
. . . .
cN 1 cN 1 cN 2 cN 2 cN L cN L
T
h = [h1 , h2 , . . . hN ] is the channel vector
Receive Diversity
Independent decoding is very convenient
Transmit Diversity
Transmit Diversity
Alamoutis code is orthogonal for N = 2
Space-Time Coding
Alamoutis Scheme
Rate-1 orthogonal codes cannot exist for N > 2
Design Criteria
Examples of Codes Rate-1/2 orthogonal codes are always available
Multiplexing
Summary
rate-3/4 codes are available for N = 3, 4, e.g.,
MIMO Information Theory
Course Summary
END
s1 s2 s3
s2 s1 s4
G3 = ,
s3 s4 s1
s4 s3 s2
Course Summary
What about data rate?
END
H
H
y1 = H1 x = H1 H1 c1 + noise
which is a space-time coded system with N1 transmitters
and (M N + N1 ) receivers
Diversity order = N1 (M N + N1 )
Course Summary
BLAST is one (famous) example
END
END
y: the length-M received signal vector
H: the M N channel
x: The length-N transmit data vector
Let Sx = E{xxH } be the covariance matrix of x
END
M M
Y Es 2 X Es 2
C = log2 1+ 2
m = log2 1+ 2
m
Introduction and Overview
m=1
N m=1
N
Basic Digital Communications
Receive Diversity
Transmit Diversity
Course Summary
END
Receive Diversity
Transmit Diversity
Course Summary
END
Course Summary
Constraints: Sx must be positive-definite
END
Sx must satisfy a power constraint
So, how do you optimize over a matrix?
Lets start with a simpler (and very instructive) system:
parallel channels
2
Introduction and Overview
3
Basic Digital Communications
Receive Diversity
N
Transmit Diversity
Course Summary
The transmitter has one important constraint - a total
END
available energy constraint of Es
Since the transmitter knows the channel values,
hn , n = 1, 2, . . . , N it can allocate power to maximize the
overall capacity
Receive Diversity Intuitively, the transmitter should allocate all its power to the
Transmit Diversity strongest channel, right?
MIMO Information Theory
Basics
Strangely enough, wrong!
Unknown Channel
Known Channel
Waterfilling
This is because...
MIMO Systems
Examples
Summary
C = log (1 + SNR)
DMT
Course Summary
At high SNR, C log (SNR)
END At low SNR, C SNR
There are diminishing marginal returns in allocating power
!+
2
En = 2 ,
|hn |
Receive Diversity
Transmit Diversity
Course Summary
Channels 1 to N
END
Transmit Diversity
0 0 hN
MIMO Information Theory
Basics What does this tell us about a regular MIMO system?
Unknown Channel
Known Channel
Waterfilling We have
MIMO Systems
Examples y = Hx + n
Summary
DMT N transmitters, M receivers, H is the M N channel
Course Summary
END
h11 h12 h1N
h21 h22 h2N
H= .. .. .. ..
. . . .
hM 1 hM 2 hM N
. .
.. . . . . .. .
Examples
. .. . ..
Summary
.
DMT = ,
Course Summary
0
0 R 0 0
0 0 0 0 0
END
0 0 0 0 0
R is the rank of H
The zeros pad the matrix to match the M N dimensions
Receive Diversity
Transmit Diversity y = Hx + n
MIMO Information Theory
Basics
Unknown Channel
Known Channel
= UVH x + n
Waterfilling
MIMO Systems
Examples
Summary UH y = VH x + UH n
DMT
Course Summary
END
y = UH y, x = VH x, n = UH n
y = x + n
Receive Diversity
9
Capacity (bits/channel use)
Transmit Diversity
5
Course Summary
END
4
Without Waterfilling
With Waterfilling
3
0 2 4 6 8 10 12 14 16 18 20
= Average SNR (dB)
zr zr zt zr zt2 zr ztN 1
Known Channel
Waterfilling
MIMO Systems
=
.. .. .. .. ..
. . . . .
Examples
Summary
DMT
zrM 1 zrM 1 zt zrM 1 zt2 zrM 1 ztN 1
Course Summary
END
This is a rank-1 matrix!
This one singular value = 1 = N M
Es Es
C = log2 1 + N M = log2 1 + 2 M
N 2
END
Note the huge difference from line of sight scenario
The number of transmit or receive elements is outside the
log term; we get linear gains in capacity
Es 2
If N 6= M C = min(N, M ) log2 1 +
N 2 1
Receive Diversity
Multiplexing: In the information theoretic analysis we saw
Transmit Diversity that we could get a pre-log factor of min(M, N ). Also, at high
MIMO Information Theory
SNR
Basics
Unknown Channel
C min(M, N ) log2 (SNR)
Known Channel
Waterfilling
MIMO Systems
Examples
Summary
DMT
Course Summary
END
Q: Can we get both diversity and multiplexing (rate) gains?
A: Yes! But, there is a trade-off between the two!
Receive Diversity
D tells us how fast the error rate falls with increases in
Transmit Diversity
log(SNR)
MIMO Information Theory
Basics Define a multiplexing gain r as
Unknown Channel
Known Channel
Waterfilling
MIMO Systems
R
Examples
r= lim
Summary SNR log SNR
DMT
Course Summary
END
Receive Diversity
Fading makes the received signal to be a random copy of
Transmit Diversity the transmitted signal
MIMO Information Theory MIMO systems are based on independent fading to/from
Course Summary multiple elements
Course Summary
Whats Left?
We covered three major concepts:
END
Receive Diversity
Transmit Diversity
MIMO Information Theory
Receive Diversity:
Selection, maximal ratio and equal gain combining
Trade off between complexity and performance
Course Summary
MIMO Information Theory:
Course Summary
Whats Left? Capacity via determinant of channel
END Ergodic capacity and outage probability if channel is
unknown
Transmission on eigen-channels and using waterfilling if
channel is known to transmitter
Creates r = rank (H) parallel channels
There is a fundamental trade-off between diversity and
multiplexing
Receive Diversity
Frequency selective channels: We focused on flat channels,
Transmit Diversity frequency selectivity is becoming important
MIMO Information Theory Everyone assumes 4G will be based on OFDM -
Course Summary MIMO-OFDM is a hot topic
Course Summary
Whats Left?
Error control coding to achieve the capacity of MIMO
END
systems
Feedback to inform the transmitter of the channel
Low data rate schemes, error bounds, impact of error
Receive Diversity
Is getting more important, both theoretically and in
Transmit Diversity
implementation
MIMO Information Theory Cooperative Communications:
Course Summary Probably the hottest research area now
Course Summary
Whats Left?
Nodes with a single antenna share resources to act like a
END
MIMO system
via relaying, forwarding, cooperative diversity
Especially applicable to the new modern kinds of
networks. Also, distributed signal processing.
Sensor Networks: Large scale networks of small, cheap
nodes
Mesh Networks: Networks of access points
Receive Diversity
Course Summary
END
http://www.comm.utoronto.ca/ rsadve/teaching.html