Su Mimo

Single-User MIMO Transmission
389.168 Advanced Wireless Communications 1
stefan.schwarz@nt.tuwien.ac.at
Contents
1 Review of SISO Capacity Concepts
2 Single-User MIMO Channel Capacity
3 Single-User MIMO Transceivers
4 Single-User MIMO in LTE
5 Conclusions
Slide 2 / 59
Contents
Contents
5 Conclusions
Slide 3 / 59
Review of SISO Capacity Concepts
Fading SISO AWGN Channel

z[k]
x[k]
h[k]
y[k]
Input-output relationship
y[k] = h[k]x[k] + z[k]
White Gaussian noise z[k] CN 0, z2
(1)
Fading channel coefficient h[k], e.g, Rayleigh fading h[k] CN 0, h2

Coded input symbols x[k] C with power E |x[k]|2 = Ps
Channel capacity: maximum transmission rate for which vanishing error

probability can be achieved (by coding over a long period of time).
Slide 4 / 59
SISO Capacity Definitions

Consider a constant channel h[k] = h, k
SISO AWGN channel capacity [Shannon, 1948]

Ps
C(h) = log2 1 + |h|2 SNR , SNR = 2
z
(2)
Consider a fading channel

Channel fluctuates over time
E.g., Rayleigh fading h[k] CN 0, h2
Channel coherence time Tc

Channel stays approximately constant over Tc
The value at which the auto-correlation of h[k] drops below 1/ 2

E.g., Jakes spectrum [Jakes and Cox, 1994] with maximum Doppler fd
Tc =
Slide 5 / 59
9
16fd
(3)
SISO Capacity Definitions

Consider a constant channel h[k] = h, k
SISO AWGN channel capacity [Shannon, 1948]

Ps
C(h) = log2 1 + |h|2 SNR , SNR = 2
z
(2)
Consider a fading channel

Channel fluctuates over time
E.g., Rayleigh fading h[k] CN 0, h2
Channel coherence time Tc

Channel stays approximately constant over Tc
The value at which the auto-correlation of h[k] drops below 1/ 2

E.g., Jakes spectrum [Jakes and Cox, 1994] with maximum Doppler fd
Tc =
Slide 5 / 59
9
16fd
(3)
SISO Capacity Definitions Fast Fading Channel

x[k+T-i]
x[k+j]
fading channel
time
Consider channel coding over blocks of duration T : [x[k], . . . , x[k + T 1]]

Fast fading channel
Code block length T much larger than Tc
The code block ranges over all fading states
No channel state information (CSI) at the transmitter: the transmitter
knows nothing about h[k]
Ergodic capacity without CSI at the transmitter

Ps
C = E log2 1 + |h[k]|2 2
z
Slide 6 / 59
(4)
SISO Capacity Definitions Fast Fading Channel (2)
Ps(h)
z2
2
|h|
water level
(energy constraint)
time
Fast fading channel with CSI at the transmitter

Transmitter knows the channel h[k], k
Adapt the transmission rate to the fading state
Also, adapt the power to maximize the information flow water-filling

Ps (hk )
CCSIT = E log 1 + |h[k]|2
2
z
(5)
Details: please visit 389.032 Information Theory for Communications Engineers
Slide 7 / 59
SISO Capacity Definitions Slow Fading Channel
code block
x[k]
x[k+T-1]
h[k]
fading channel
R
outage
time
Slow fading channel

Code block length T much smaller than channel coherence time Tc
Each code block sees only one fading state h[k] h[k + T 1]
Transmitting with a constant target rate R
Channel may be too bad in some code blocks (outage)
Transmission errors occur
Slide 8 / 59
SISO Capacity Definitions Slow Fading Channel (2)
Outage probability definition

Ps
pout (R) = P R > log2 1 + |h[k]|2 2
z
(6)
E.g., outage probability for Rayleigh fading
pout (R) = 1 exp
R 1)
(2
h2
(7)
Ps
z2
-outage capacity

Cout
= max R, such that pout (R)
(8)
For higher rate R we have to accept higher outage probability
Slide 9 / 59
Contents
5 Conclusions
Slide 10 / 59
Single-User MIMO Channel Capacity
Fading Single-User MIMO Channel

z[k]
x[k]
Nt
y[k]
H[k]
Nr
Nr
y[k] = H[k]x[k] + z[k]
White Gaussian noise z[k] CN 0, z2 INr
(9)
Fading channel matrix H[k], e.g., Rayleigh fading [H[k]]ij CN 0, h2

Channel input x[k] CNt 1 with covariance matrix E x[k]x[k]H = Qx [k]
Mutual information between x[k] and y[k ]

1
I(H, Qx ) = log2 det INr + 2 H[k]Qx [k]H[k]H
z
Slide 11 / 59
(10)
Fading Single-User MIMO Channel

z[k]
x[k]
Nt
y[k]
H[k]
Nr
Nr
y[k] = H[k]x[k] + z[k]
White Gaussian noise z[k] CN 0, z2 INr
(9)
Fading channel matrix H[k], e.g., Rayleigh fading [H[k]]ij CN 0, h2

Channel input x[k] CNt 1 with covariance matrix E x[k]x[k]H = Qx [k]
Mutual information between x[k] and y[k ]

1
I(H, Qx ) = log2 det INr + 2 H[k]Qx [k]H[k]H
z
Slide 11 / 59
(10)
Capacity of Deterministic MIMO Channels

Consider a deterministic channel H[k] = H, k
Assuming perfect CSI at the transmitter, the capacity is obtained from

1
C(H) = max I(H, Qx ) = max log2 det INr + 2 HQx HH ,
Qx
Qx
z
(11)
subject to: Qx 0, tr (Qx ) = Ps

Apply a singular value decomposition (SVD) to the channel H
H = UVH ,
U CNr Nr , CNr Nt , V CNt Nt ,
UH U = UUH = INr ,
=
=
(12)
VH V = VVH = INt ,
diag 1 , . . . , Nr
diag 1 , . . . , Nt
0(Nr Nt )Nt

0Nr (Nt Nr )
, Nr Nt ,
, Nr > Nt ,
i R, i 0, singular values
Slide 12 / 59
Capacity of Deterministic MIMO Channels

Consider a deterministic channel H[k] = H, k
Assuming perfect CSI at the transmitter, the capacity is obtained from

1
C(H) = max I(H, Qx ) = max log2 det INr + 2 HQx HH ,
Qx
Qx
z
(11)
subject to: Qx 0, tr (Qx ) = Ps

Apply a singular value decomposition (SVD) to the channel H
H = UVH ,
U CNr Nr , CNr Nt , V CNt Nt ,
UH U = UUH = INr ,
=
=
(12)
VH V = VVH = INt ,
diag 1 , . . . , Nr
diag 1 , . . . , Nt
0(Nr Nt )Nt

0Nr (Nt Nr )
, Nr Nt ,
, Nr > Nt ,
i R, i 0, singular values
Slide 12 / 59
Capacity of Deterministic MIMO Channels (2)
Apply a change of coordinates

y = Hx + z,
(13)
= UH y, x = Vx
,
y
z = UH z,
= x
+
y
z
(14)
(15)
Capacity is unchanged as U and V are unitary

The channel decomposes into n = min (Nr , Nt ) independent SISO channels
I(H, Qx ) =
n
X
i=1
log2
1+
i2
z2
!
si
(16)
Qx = V diag (s1 , . . . , sn ) VH ,
si R, si 0, power loading coefficients
Slide 13 / 59
Capacity of Deterministic MIMO Channels Water-filling
s*1
s*2
z2
12
z2
22
s*3
z2
32
z2
2
n-1
z2
n2
The capacity is then obtained from
C(H) =
max
{s1 ,...,sn }
n
X
log2
1+
i=1
subject to: si 0,
n
X
i2
s
2 i
!
,
(17)
si = Ps
i=1
The power allocation strategy that solves (17) is known as water-filling

si =
Slide 14 / 59
z2
i2
!+
, with such that
n
X
si = Ps
(18)
i=1
Capacity of Deterministic MIMO Channels Asymptotic Strategies
Achievable rate [bit/channel use]
25
20
Capacity
Maximum eigenmode transmission
Equal power allocation
15
10
0
10
10
SNR [dB]
15
20
Achievable rates of an Nt Nr = 4 4 MIMO channel (Rayleigh fading)
Low signal to noise ratio (SNR): maximum eigenmode transmission (MET)
C(H)
2
i
z2
Ps 0

log2
1+
2
max
Ps
z2

(19)
High SNR: equal power allocation
C(H)
2
i
z2
Ps
n
X
i=1
Slide 15 / 59
log2
2 Ps
1 + i2
z n
!
(20)
Ergodic Capacity of Fast Fading MIMO Channels Perfect CSIT

Fast fading: T Tc
Assume perfect CSI at the transmitter:
Adaptation of the transmit covariance Qx [k] at each k
Variable rate coding according to fading state
Short-term power constraint: tr (Qx [k]) = Ps , k
water-filling over space (antennas)
Long-term power constraint: E (tr (Qx [k ])) = Ps
water-filling over time and space
CCSIT =
n
X
i=1
log2
1+
i2
s
z2 i
!!
(21)
i2 . . . random variables, e.g., eigenvalues of a Wishart distribution for i.i.d.

Rayleigh fading
si . . . corresponding water-filling power allocation
Slide 16 / 59

Fast fading: T Tc
CCSIT =
n
X
i=1
log2
1+
i2
s
z2 i
!!
(21)

Rayleigh fading
Slide 16 / 59

Fast fading: T Tc
CCSIT =
n
X
i=1
log2
1+
i2
s
z2 i
!!
(21)

Rayleigh fading
Slide 16 / 59
Ergodic Capacity of Fast Fading MIMO Channels Partial CSIT

Assume channel distribution information (CDI) at the transmitter:
The transmitter knows the distribution of H[k]
Constant transmit covariance over time Qx [k] = Qx , k
Coding over many fading states: T Tc
Ergodic capacity with CDI

1
CCDIT = max E log2 det INr + 2 H[k]Qx H[k]H
,
Qx
z
(22)
subject to: tr (Qx ) = Ps , Qx 0
(23)
E.g., i.i.d. Rayleigh fading [H[k ]]ij CN 0, h2

Qx =
Slide 17 / 59
Ps
IN
Nt t
(24)
Ergodic Capacity of Fast Fading MIMO Channels Partial CSIT

Assume channel distribution information (CDI) at the transmitter:
The transmitter knows the distribution of H[k]
Constant transmit covariance over time Qx [k] = Qx , k
Coding over many fading states: T Tc
Ergodic capacity with CDI

1
CCDIT = max E log2 det INr + 2 H[k]Qx H[k]H
,
Qx
z
(22)
(23)
E.g., i.i.d. Rayleigh fading [H[k ]]ij CN 0, h2

Qx =
Slide 17 / 59
Ps
IN
Nt t
(24)
Partial versus Perfect CSIT
Achievable rate [bit/channel use]
25
20
Perfect CSIT
Partial CSIT (CDIT)
Perfect CSIT
Partial CSIT (CDIT)
15
4x4
10
SNR
4x2
0
10
5
SNR [dB]
10
15
20
Achievable rates of Nt Nr = 4 4 and 4 2 MIMO channels (Rayleigh fading)
Ergodic capacity with perfect CSI (water-filling over space only) and partial CSI
(CDI) at the transmitter
If Nr < Nt part of the transmit energy is wasted with Qx INt , i.e., power is
assigned to singular-values that are zero SNR loss
With perfect CSIT we achieve an additional
Slide 18 / 59
Nt
Nr
-fold transmit beamforming gain

Spatial Multiplexing Gain of Fast Fading MIMO Channels

Fast fading channels are characterized with a single number: ergodic capacity
Deriving the ergodic capacity is often very hard
Characterization of high SNR performance: spatial multiplexing gain
gs =
lim
SNR
C(SNR)
C(SNR)
= lim
,
SNR log2 (SNR)
log2 (1 + SNR)
SNR =
Ps
z2
(25)
The spatial multiplexing gain gs is a channel property

E.g., for i.i.d. Rayleigh fading gs = min (Nr , Nt ) independent of the CSIT
Multiplexing gain of a practical scheme S that achieves rate R S (SNR)
gsS =
lim
SNR
R S (SNR)
log2 (SNR)
(26)
Here, gsS is a property of the channel and the applied transmission scheme
Slide 19 / 59
Spatial Multiplexing Gain of Fast Fading MIMO Channels

Fast fading channels are characterized with a single number: ergodic capacity
Deriving the ergodic capacity is often very hard
Characterization of high SNR performance: spatial multiplexing gain
gs =
lim
SNR
C(SNR)
C(SNR)
= lim
,
SNR log2 (SNR)
log2 (1 + SNR)
SNR =
Ps
z2
(25)
The spatial multiplexing gain gs is a channel property

E.g., for i.i.d. Rayleigh fading gs = min (Nr , Nt ) independent of the CSIT
Multiplexing gain of a practical scheme S that achieves rate R S (SNR)
gsS =
lim
SNR
R S (SNR)
log2 (SNR)
(26)
Here, gsS is a property of the channel and the applied transmission scheme
Slide 19 / 59
Outage Capacity of Slow Fading MIMO Channels
Slow fading channel: T Tc during each k the channel is fixed but random
For given target rate R, reliable transmission is possible if

1
log2 det INr + 2 H[k]Qx H[k]H > R
z
(27)

1
pout (R) = min P log2 det INr + 2 H[k]Qx H[k]H < R ,
Qx
z
(28)
(29)

Cout
= max R, such that pout (R)
(30)
Outage probability

-outage capacity Cout
Slide 20 / 59
Diversity-Multiplexing Tradeoff of Slow-Fading MIMO Channels

For a given target rate R we have to accept a certain outage-probability pout (R)
Generally, the achievable rate grows linearly with the logarithmic SNR
R gs log2 (SNR)
(31)
with gs denoting the slow-fading spatial multiplexing gain

Similarly, pout (R) decays exponentially with the SNR
pout (R) SNRgd (gs )
(32)
Here, gd (gs ) denotes the diversity gain [Zheng and Tse, 2003]
gd (gs ) =
lim
SNR
log2 (pout (gs log2 (SNR)))

log2 (SNR)
(33)
The curve gd (gs ) with varying gs formulates the diversity-multiplexing tradeoff

gd (gs ) is a channel property
Slide 21 / 59

R gs log2 (SNR)
(31)

(32)
gd (gs ) =
lim
SNR

log2 (SNR)
(33)

Slide 21 / 59

R gs log2 (SNR)
(31)

(32)
gd (gs ) =
lim
SNR

log2 (SNR)
(33)

Slide 21 / 59
Diversity-Multiplexing Tradeoff of Practical Schemes
The compound channel coding theorem [Root and Varaiya, 1968] guarantees
the existence of universal codes that achieve the diversity-multiplexing tradeoff
Still, finding practical schemes that achieve it is in general hard
Consider a practical scheme S that achieves multiplexing gain gsS
We can define the diversity gain of scheme S
gdS (gsS )
lim
SNR

log2 peS gsS log2 (SNR)
log2 (SNR)
(34)
with peS (R) denoting the average pairwise error probability of the scheme
Goal: make gdS (gsS ) as close as possible to gd (gs )
Slide 22 / 59
Diversity-Multiplexing Tradeoff of Practical Schemes
The compound channel coding theorem [Root and Varaiya, 1968] guarantees
the existence of universal codes that achieve the diversity-multiplexing tradeoff
Still, finding practical schemes that achieve it is in general hard
Consider a practical scheme S that achieves multiplexing gain gsS
We can define the diversity gain of scheme S
gdS (gsS )
lim
SNR

log2 peS gsS log2 (SNR)
log2 (SNR)
(34)
with peS (R) denoting the average pairwise error probability of the scheme
Goal: make gdS (gsS ) as close as possible to gd (gs )
Slide 22 / 59
Diversity-Multiplexing Tradeoff of Rayleigh Fading Channels
Diversity gain gd(gs)
{0,NtNr}
{1,(Nt-1)(Nr-1)}
{2,(Nt-2)(Nr-2)}
{gs,(Nt-gs)(Nr-gs)}
{min(Nt,Nr),0}
Spatial multiplexing gain gs

Diversity-Multiplexing Tradeoff of i.i.d. slow Rayleigh fading channels [Zheng and Tse, 2003]
Point {0, Nt Nr }: the maximum diversity is achieved with fixed transmission rate
(robust transmission)
Point {min(Nt , Nr ), 0}: the maximum multiplexing gain is achieved with fixed
outage probability (no protection against fading)
Slide 23 / 59
Contents
5 Conclusions
Slide 24 / 59
Single-User MIMO Transceivers
Spatial Multiplexing (V-BLAST) System Model
data bits
Layer
mapper
Coder
Coder
z[k]
p1[k]
s[k]
x[k]
x
x
^
s[k]
y[k]
F[k]
H[k]
Nt
Nr
Detector
L
Nr
pL[k]
Vertical Bell Labs space-time architecture (V-BLAST)

Data bits are mapped onto L independent data streams (layers)
P
Streams are independently coded with rate ri [k]: Li=1 ri [k] = R[k]
P
Power is allocated to the streams such that Li=1 pi [k] = Ps
Unitary precoding is applied F[k]H F[k] = F[k]F[k]H = INt
Vertical: no coding across data streams; streams are vertically separated
1
y[k ] = H[k]F[k]P[k] 2 s[k] + z[k],

P[k] =
Slide 25 / 59
diag (p1 [k], . . . , pL [k])

0Nt LL
(35)
, s[k] AL1 (e.g., PSK, QAM)
Spatial Multiplexing (V-BLAST) System Model
data bits
Layer
mapper
Coder
Coder
z[k]
p1[k]
s[k]
x[k]
x
x
^
s[k]
y[k]
F[k]
H[k]
Nt
Nr
Detector
L
Nr
pL[k]
Vertical Bell Labs space-time architecture (V-BLAST)

Data bits are mapped onto L independent data streams (layers)
P
Streams are independently coded with rate ri [k]: Li=1 ri [k] = R[k]
P
Power is allocated to the streams such that Li=1 pi [k] = Ps
Unitary precoding is applied F[k]H F[k] = F[k]F[k]H = INt
Vertical: no coding across data streams; streams are vertically separated
1
y[k ] = H[k]F[k]P[k] 2 s[k] + z[k],

P[k] =
Slide 25 / 59
diag (p1 [k], . . . , pL [k])

0Nt LL
(35)
, s[k] AL1 (e.g., PSK, QAM)
V-BLAST with Perfect CSIT

Assume deterministic or fast fading channel and perfect CSI at the transmitter
V-BLAST reduces to the capacity achieving strategy outlined before:
Apply an SVD to the channel H[k] = U[k][k]V[k]H
Set F[k] = V[k ] and apply the linear receive filter G[k ] = U[k]H
1
z[k]
r[k] = [k]P[k] 2 s[k] +
(36)
Channel diagonalization
Determine the powers pi according to water-filling
Implicit selection of number of data streams L through power allocation
L is equal to the number of non-zero powers pi [k]

[k]2
Set the rates ri [k] to achieve capacity: ri [k] = log2 1 + i 2 pi [k]
z
Independently detect the individual data streams

[k ]]i = QA
[s
Slide 26 / 59
1
[r[k]]i
i [k] pi

, i {1, . . . , L}
(37)
V-BLAST with Perfect CSIT

Assume deterministic or fast fading channel and perfect CSI at the transmitter
V-BLAST reduces to the capacity achieving strategy outlined before:
Apply an SVD to the channel H[k] = U[k][k]V[k]H
Set F[k] = V[k ] and apply the linear receive filter G[k ] = U[k]H
1
z[k]
r[k] = [k]P[k] 2 s[k] +
(36)
Channel diagonalization
Determine the powers pi according to water-filling
Implicit selection of number of data streams L through power allocation
L is equal to the number of non-zero powers pi [k]

[k]2
Set the rates ri [k] to achieve capacity: ri [k] = log2 1 + i 2 pi [k]
z
Independently detect the individual data streams

[k ]]i = QA
[s
Slide 26 / 59
1
[r[k]]i
i [k] pi

, i {1, . . . , L}
(37)
V-BLAST with Partial CSIT

Assume the transmitter knows only the channel distribution
The transmit covariance matrix cannot dependent on the channel realization
Qx = FPFH ,
(38)
F[k] = F, P[k] = P, k
(39)
The transmitter can select Qx to maximize the ergodic achievable rate

1
Qx = argmax E log2 det INr + 2 H[k]Qx H[k]H
,
z
Qx
(40)
subject to: Qx 0, tr (Qx ) = Ps ,
(41)
which yields the ergodic capacity of the fast fading channel with CDIT
Without CSIT, the transmitter blindly has to select any transmit covariance, e.g.,
Qx =
1
IN
Nt t
(42)
which achieves the ergodic capacity of the fast fading i.i.d. Rayleigh channel
Slide 27 / 59
V-BLAST with Partial CSIT

Assume the transmitter knows only the channel distribution
The transmit covariance matrix cannot dependent on the channel realization
Qx = FPFH ,
(38)
F[k] = F, P[k] = P, k
(39)
The transmitter can select Qx to maximize the ergodic achievable rate

1
Qx = argmax E log2 det INr + 2 H[k]Qx H[k]H
,
z
Qx
(40)
subject to: Qx 0, tr (Qx ) = Ps ,
(41)
which yields the ergodic capacity of the fast fading channel with CDIT
Without CSIT, the transmitter blindly has to select any transmit covariance, e.g.,
Qx =
1
IN
Nt t
(42)
which achieves the ergodic capacity of the fast fading i.i.d. Rayleigh channel
Slide 27 / 59
V-BLAST with Zero Forcing Receiver

With SVD precoding and reception, the channel diagonalizes and data streams
dont interfere anymore
This is not the case with general precoding equalization at the receiver
Zero forcing (ZF) receiver
Channel inversion interference is suppressed
r[k] = GZF [k]y[k] = s[k] +
z[k],
GZF [k] = Heff [k]H Heff [k]
z[k] = GZF [k]z[k],

1
Heff [k] = H[k]F[k]P[k]
(43)
Heff [k]H ,
(44)
1
2
(45)
Number of streams L rank (H[k])

Problem: noise enhancement and correlation

1
E
z[k]
z[k]H = Heff [k]H Heff [k]
Slide 28 / 59
(46)
V-BLAST with Linear MMSE Receiver

Linear minimum mean squared error (MMSE) receiver
Regularized channel inversion
Trades off residual interference for noise enhancement

GMMSE [k] = argmin E kG[k]y[k] s[k ]k22 ,
(47)

1
GMMSE [k] = Heff [k]H Heff [k] + z2 IL
Heff [k]H
(48)
G[k ]CLNr
At low SNR ( Ps2 1) matched filter

z
GMMSE [k]
1
Heff [k]H
z2
(49)
At high SNR ( Ps2 1) zero forcing

z
GMMSE [k ] Heff [k]H Heff [k]
Slide 29 / 59
1
Heff [k]H
(50)
V-BLAST with Linear MMSE Receiver

Linear minimum mean squared error (MMSE) receiver
Regularized channel inversion
Trades off residual interference for noise enhancement

GMMSE [k] = argmin E kG[k]y[k] s[k ]k22 ,
(47)

1
GMMSE [k] = Heff [k]H Heff [k] + z2 IL
Heff [k]H
(48)
G[k ]CLNr
At low SNR ( Ps2 1) matched filter

z
GMMSE [k]
1
Heff [k]H
z2
(49)
At high SNR ( Ps2 1) zero forcing

z
GMMSE [k ] Heff [k]H Heff [k]
Slide 29 / 59
1
Heff [k]H
(50)
V-BLAST with Successive Interference Cancellation
y[k]
ZF/MMSE
receiver 1
Detect
stream 1
Subtract
stream 1
ZF/MMSE
receiver 2
Detect
stream 2
Subtract
1,2,...,L-1
ZF/MMSE
receiver L
Detect
stream L
^
Concat. s[k]
streams
Successively detect one layer after the other and subtract the interference
In each step ZF or MMSE equalization is applied
At iteration i streams 1, . . . , i 1 have been detected and are subtracted
y(i) = y [Heff ]{:,1:i1} [
s1 , . . . ,
si1 ]T ,

GZF = Heff H Heff Heff H ,

(i)
(i)
(i)
si = QA
(i)
(i)
h
(i)
GZF
(51)
Heff = [Heff ]{:,i:L} ,

i
{i,:}
y(i)
(52)

(53)
Major problem: error propagation combine with channel coding

Ordering of streams according to SINR further improves the performance
Slide 30 / 59
V-BLAST with Successive Interference Cancellation
y[k]
ZF/MMSE
receiver 1
Detect
stream 1
Subtract
stream 1
ZF/MMSE
receiver 2
Detect
stream 2
Subtract
1,2,...,L-1
ZF/MMSE
receiver L
Detect
stream L
^
Concat. s[k]
streams
Successively detect one layer after the other and subtract the interference
In each step ZF or MMSE equalization is applied
At iteration i streams 1, . . . , i 1 have been detected and are subtracted
y(i) = y [Heff ]{:,1:i1} [
s1 , . . . ,
si1 ]T ,

GZF = Heff H Heff Heff H ,

(i)
(i)
(i)
si = QA
(i)
(i)
h
(i)
GZF
(51)
Heff = [Heff ]{:,i:L} ,

i
{i,:}
y(i)
(52)

(53)
Major problem: error propagation combine with channel coding

Ordering of streams according to SINR further improves the performance
Slide 30 / 59
V-BLAST Receiver Comparison

0
10
Symbol error ratio
10
10
10
10
10
10
Zero forcing
Linear MMSE
MMSESIC
5
5
10
SNR [dB]
15
20
25
Performance of Nt Nr = 4 4 V-BLAST with different receivers
Uncoded 4 QAM transmission over i.i.d. Rayleigh fast fading channel

Linear MMSE and ZF achieve the same diversity order
Ordered MMSE-successive interference cancellation (SIC) substantially
outperforms the others
Slide 31 / 59
V-BLAST with ML Detection
To achieve capacity, the receiver applies maximum likelihood (ML) detection

(assuming an AWGN channel)

2
1

[k] = argmin
s
y[k] H[k]F[k]P[k] 2 s[k]
s[k]AL1
(54)
Requires an exhaustive search over all possible s[k] exponential complexity

in the number of streams practical quasi-ML implementations required
Sphere decoder [Fincke and Pohst, 1985]
Consider only s[k]s that lie in a sphere around the ZF solution
Sphere radius determines complexity-performance tradeoff
Semidefinit relaxation detection [Steingrimsson et al., 2003]
Transformation to a convex optimization problem
Slide 32 / 59
V-BLAST with ML Detection
Illustration of the basic idea of sphere decoding
To achieve capacity, the receiver applies maximum likelihood (ML) detection

(assuming an AWGN channel)

2
1

[k] = argmin
s
y[k] H[k]F[k]P[k] 2 s[k]
s[k]AL1
(54)
Requires an exhaustive search over all possible s[k] exponential complexity

in the number of streams practical quasi-ML implementations required
Sphere decoder [Fincke and Pohst, 1985]
Consider only s[k]s that lie in a sphere around the ZF solution
Sphere radius determines complexity-performance tradeoff
Semidefinit relaxation detection [Steingrimsson et al., 2003]
Transformation to a convex optimization problem
Slide 32 / 59
V-BLAST Receiver Comparison (2)

0
10
Symbol error ratio
10
10
10
10
Linear MMSE
MMSESIC
Maximum likelihood
10
10
5
10
SNR [dB]
15
20
25
Performance of Nt Nr = 2 2 V-BLAST with different receivers
Uncoded 4 QAM transmission over i.i.d. Rayleigh fast fading channel

ML detection achieves the highest diversity
Notice that both ML and MMSE-SIC can operate at ergodic capacity
Slide 33 / 59
V-BLAST over Slow Fading Channels

V-BLAST is appropriate for fast fading channels and/or perfect CSIT, as it
achieves the ergodic capacity
Slow fading: diversity-multiplexing tradeoff optimal schemes are needed
V-BLAST does not achieve the full MIMO diversity
Consider, e.g., precoding with F[k ] = INt each streams is transmitted
from only one antenna transmit diversity is lost gd = Nr at best
V-BLAST with ML detection achieves (Rayleigh fading)
[Clerckx and Oestges, 2013]
gd (gs ) = Nr

gs
1
, gs [0, Nt ], (Nr Nt )
Nt
(55)
V-BLAST with ZF or MMSE detection achieves

gs
gd (gs ) = (Nr Nt + 1) 1
, gs [0, Nt ], (Nr Nt )
Nt
(56)
More robust schemes are required
Slide 34 / 59
V-BLAST over Slow Fading Channels

V-BLAST is appropriate for fast fading channels and/or perfect CSIT, as it
achieves the ergodic capacity
Slow fading: diversity-multiplexing tradeoff optimal schemes are needed
V-BLAST does not achieve the full MIMO diversity
Consider, e.g., precoding with F[k ] = INt each streams is transmitted
from only one antenna transmit diversity is lost gd = Nr at best
V-BLAST with ML detection achieves (Rayleigh fading)
gd (gs ) = Nr

gs
1
, gs [0, Nt ], (Nr Nt )
Nt
(55)
V-BLAST with ZF or MMSE detection achieves

gs
gd (gs ) = (Nr Nt + 1) 1
, gs [0, Nt ], (Nr Nt )
Nt
(56)
More robust schemes are required
Slide 34 / 59
Space-Time Block Coding

z[k]
block of Q
x[k]
data bits Coder symbols s
ST-Coder
Mapper
Nt
y[k]
+
H[k]
Nr
Nr
^
Block s
detector
Coding and mapping

Forward error correction code (FEC) and mapping onto symbol alphabet A
Output: block of Q symbols s AQ1
Space-time block coding
Spreading of symbols s over time and space, forming the code block
X = [x[k], . . . , x[k + T 1]] CNt T
(57)
Block detection
Gathering of a block of T output symbols
Y = [y[k], . . . , y[k + T 1]] CNt T
(58)
AQ1
Estimation of transmit symbols: s
Slide 35 / 59
D-BLAST Space-Time Block Coding

receive
suppress
cancel
receive
Antenna 1
Antenna 2
time k
receive
cancel
Illustration of the basic idea of D-BLAST for two transmit antennas
Diagonal Bell Labs space-time architecture (D-BLAST)

s is divided into L layers (colors); layers are divided into Nt blocks
Layers expand diagonally in time and space
Successive detection of symbols
Transmit block 1/layer 1 from antenna 1
Detect the interference free block 1/layer 1 (SINR1 )
Transmit block 1/layer 2 form antenna 1 and block 2/layer 1 from antenna 2
Detect block 2/layer 1, treating block 1/layer 2 as interference (SINR2 )
Decode layer 1 and cancel the interference to block 1/layer 2
(log2 (1 + SINR1 ) + log2 (1 + SINR2 ) R1 )
Slide 36 / 59
D-BLAST Space-Time Block Coding

receive
suppress
cancel
receive
Antenna 1
Antenna 2
time k
receive
cancel
Illustration of the basic idea of D-BLAST for two transmit antennas
Diagonal Bell Labs space-time architecture (D-BLAST)

s is divided into L layers (colors); layers are divided into Nt blocks
Layers expand diagonally in time and space
Successive detection of symbols
Transmit block 1/layer 1 from antenna 1
Detect the interference free block 1/layer 1 (SINR1 )
Transmit block 1/layer 2 form antenna 1 and block 2/layer 1 from antenna 2
Detect block 2/layer 1, treating block 1/layer 2 as interference (SINR2 )
Decode layer 1 and cancel the interference to block 1/layer 2
(log2 (1 + SINR1 ) + log2 (1 + SINR2 ) R1 )
Slide 36 / 59
D-BLAST Space-Time Block Coding (2)
D-BLAST with MMSE detection of layers, L and capacity achieving

codes obtains the entire optimal diversity-multiplexing tradeoff.
Transmit diversity is achieved as each layer is transmitted from all antennas

Practical restrictions
Error propagation due to suboptimal codes and decoding errors
(similar to MMSE-SIC)
Reinitialization is required to restrict error propagation (L finite)
reduction of spatial multiplexing gain
E.g., in our example only
Slide 37 / 59
8
10
of symbols contain data
General Framework for Linear STBCs

A linear STBC can generally be expressed as
X=
Q
X
q < (sq ) + q+Q = (sq ) ,
sq = [s]q ,
(59)
q=1
j CNt T , j {1, . . . , 2Q}
(60)
The basis matrices j define the properties of the STBC

Spatial multiplexing rate of the STBC: rs =
Q
T
Full rate STBC: rs = min (Nt , Nr )

Power normalization: E tr XXH = Ps T

Assuming E (sq ) = 0, E |sq |2 = 1
2Q
X

tr q H
q = 2Ps T
(61)
q=1
Slide 38 / 59
Orthogonal Space-Time Block Codes
Orthogonal space time block codes (OSTBCs) are linear STBCs fulfilling
Ps T
Nt Q
semi-unitary,
(62)
H
q H
p + p q = 0, p 6= q
pairwise skew-hermitian
(63)
q H
q = c I Nt ,
c=
Advantage: facilitates simple ML detection using space-time matched filters if the

channel is constant over T (see example Alamouti scheme below)
Diversity-multiplexing tradeoff of OSTBCs over i.i.d. Rayleigh fading channels
gd (gs ) = Nt Nr

gs
, gs [0, rs ]
1
rs
(64)
Assume Nr = 1 and rs = 1 (64) is equal to the optimal tradeoff curve

achieved by the Alamouti scheme
Slide 39 / 59
Alamouti Coding [Alamouti, 1998]
OSTBC for Nt = 2 transmit antennas

r
X=
r
1 =
r
3 =
Ps
2
Ps
2
Ps
2
e.g., 4 H
4 =
s2
s1
s1
s2
1
0
j
0
Ps
2
0
1
(65)
,
r

,
0
j
0
j
j
0
H
2 H
3 + 3 2 =
Ps
2

Ps
0 1
,
1
0
2
r

Ps
0 j
4 =
,
j 0
2

0
j
0
j
(67)

Ps
j
=
IN ,
0
2 t

Ps
j
0 j
+
=0
0
j 0
2
Q = 2 symbols are transmitted during T = 2 time instants: rs =
Slide 40 / 59
(66)
2 =
Q
T
(68)
(69)
=1
Alamouti Coding (2)

Consider transmission over constant Nt Nr = 2 1 channel h = [h1 h2 ]
r
[y[1] y[2]] =
Ps
h
2
s1
s2
s2
s1

+ [n[1] n[2]]
(70)
Equivalent MIMO formulation

y[1]
y[2]

=
Ps
2

|
h1
h2

n[1]
h2
s1
+
h1
s2
n[2]
{z
}
(71)
Heff
Apply the space-time matched filter HH

eff

r [1]
r [2]

=

Ps
n[1]
s1
+ HH
|h1 |2 + |h2 |2 INt
eff
n[2]
s2
2
(72)
This enables decoupled detection of s1 and s2 and is equivalent to ML detection

in the original formulation
Slide 41 / 59
Further STBCs and Other Schemes
Disadvantage of OSTBCs: restricted multiplexing rate

For Nt = 2 codes with rate rs = 1 are known
For Nt = 3, 4 codes with rate rs =
3
4
exist
Other STBCs
Quasi-OSTBCs
Linear dispersion codes
Algebraic STBCs
...
better multiplexing rates, higher complexity
Space-time Trellis coding
Slide 42 / 59
Contents
5 Conclusions
Slide 43 / 59
Single-User MIMO in LTE
Single-User MIMO Transmission Modes in LTE

Transmit diversity (TxD)
Improve robustness of the transmission without CSIT
Only channel quality indicator (CQI) feedback for rate adaptation (SINR)
Open loop spatial multiplexing (OLSM)
Improve throughput of the transmission without CSIT
CQI feedback for rate adaptation
Rank indicator (RI) feedback to select the number of data streams L
Closed loop spatial multiplexing (CLSM)
Further improve throughput by providing implicit CSIT
RI feedback for stream L selection
Precoding matrix indicator (PMI) feedback to select the applied precoder
Non-codebook based precoding
Explicit CSI feedback (channel matrix)
Application of arbitrary precoders (user specific reference symbols)
Slide 44 / 59

Slide 44 / 59

Slide 44 / 59

Slide 44 / 59
Transmit Diversity
frequency n
Alamouti scheme applied in the space-frequency domain

Antenna 1
Antenna 2
s1
-s*2
s2
s*1
s3
-s*3
s4
s*4
Antenna 2
Antenna 3
Extension to Nt = 4
frequency n
Antenna 1
Antenna 4
-s*2
s1
s*1
s2
s3
-s*3
s4
s*4
Each pair of symbols experiences only two-fold transmit diversity

Partly exploitation of four-fold diversity through FEC
Slide 45 / 59
Transmit Diversity
frequency n
Alamouti scheme applied in the space-frequency domain

Antenna 1
Antenna 2
s1
-s*2
s2
s*1
s3
-s*3
s4
s*4
Antenna 2
Antenna 3
Extension to Nt = 4
frequency n
Antenna 1
Antenna 4
-s*2
s1
s*1
s2
s3
-s*3
s4
s*4
Each pair of symbols experiences only two-fold transmit diversity

Partly exploitation of four-fold diversity through FEC
Slide 45 / 59
Transmit Diversity versus Single Antenna Transmission

0.4
64
16
TxD_versus_SISO
Bit-error ratio
10-1
10-2
10-3
2x1 TxD
1x1 SISO
10-4
-5
10
15
20
SNR [dB]
25
30
35
Bit-error ratio of TxD with Nt Nr = 2 1 and SISO transmission
Transmission over frequency flat Rayleigh fading channels

Improvement of uncoded bit-error ratio with 4/16/64 QAM transmission due to
exploitation of TxD
Rate adaptation can transform BER reduction into throughput improvement
Slide 46 / 59
Transmit Diversity versus Single Antenna Transmission

TxD_versus_SIMO
5.5
5
3.5
2x2 TxD
2.5
1.5
2x1 TxD
1.5
0.5
0.5
1x1 SISO
2x2 TxD
2.5
2x1 TxD
3.5
1x1 SISO
~3dB
1x2 SIMO
4.5
Throughput [Mbit/s]
Throughput [Mbit/s]
4.5
TxD_versus_SIMO
5.5
5
1x2 SIMO
-5
10
SNR [dB]
15
20
25
TxD versus SIMO assuming same reference overhead
-5
10
SNR [dB]
15
20
25
TxD versus SIMO with actual reference overhead
Transmission over frequency flat Rayleigh fading channels

Assuming same reference symbol overhead throughput gain of TxD due to
improved diversity
With actual reference symbol overhead hardly any gain left
Slide 46 / 59
Open Loop Spatial Multiplexing

PDP
frequency response
UE1
f1
IDFT
+ CP
+ CP
UE2
CDD
TX
f2
f3
Illustration of CDD precoding
UE3
Principle of precoder (beamformer) cycling
Spatial multiplexing without CSIT

Combination of precoder cycling and cyclic delay diversity (CDD)
Precoder cycling: cycling through predefined precoders over time and frequency
Both methods provide
Increased frequency diversity, which can be exploited by the FEC
Opportunistic multi-user diversity, which can be exploited by the scheduler
(resource block (RB) allocation)
Slide 47 / 59
Closed Loop Spatial Multiplexing

Remember SVD based precoding
H[n, k] = U[n, k][n, k]VH [n, k],
p
F[n, k] = V[n, k] diag (p1 [n, k], . . . , pn [n, k])
(73)
(74)
with pi [n, k] determined by water-filling

Problem:
Requires knowledge of [n, k] and V[n, k] for all [n, k] at the transmitter
In LTE, CSIT can only be obtained by feedback from the receivers
Full feedback of [n, k] and V[n, k] is often too costly (high mobility)
Approach in CLSM:
Quantize V[n, k] using a fixed precoder codebook (PMI)
Replace power loading with on/off switching of layers (RI)
Provide feedback only once per cluster of subcarriers and symbols
Selection of PMI and RI see later lecture
Slide 48 / 59
Closed Loop Spatial Multiplexing

Remember SVD based precoding
H[n, k] = U[n, k][n, k]VH [n, k],
p
F[n, k] = V[n, k] diag (p1 [n, k], . . . , pn [n, k])
(73)
(74)
with pi [n, k] determined by water-filling

Problem:
Requires knowledge of [n, k] and V[n, k] for all [n, k] at the transmitter
In LTE, CSIT can only be obtained by feedback from the receivers
Full feedback of [n, k] and V[n, k] is often too costly (high mobility)
Approach in CLSM:
Quantize V[n, k] using a fixed precoder codebook (PMI)
Replace power loading with on/off switching of layers (RI)
Provide feedback only once per cluster of subcarriers and symbols
Selection of PMI and RI see later lecture
Slide 48 / 59
Closed Loop Spatial Multiplexing - Precoders

Codebook
index
Number of layers L
1
2
1 1
2 1
1 1
2 -1
1 1 1
2 1 -1
1 1
2 j
1 1 1
2 j -j
1 1
2 -j
Precoder codebooks for Nt = 2
Fixed precoder codebook design considerations:

Low resolution quantization of [V[n, k]]{:,1:L}
Suitable for all possible channel realizations
Grassmannian subspace packing (see later lecture)
Low implementation complexity (phase shifters)
Nested codebooks for different layer numbers
Codebooks sizes: 2 bit (Nt = 2), 4 bit (Nt = 4), 8 bit (Nt = 8)
Slide 49 / 59
Closed Loop Spatial Multiplexing - Clustering
cluster 2
PMI 2
time
cluster 1
PMI 1
frequency
Clustering of resource blocks for PMI feedback
Clustering:
Grouping of consecutive RBs in time and frequency
Size: coherence time/bandwidth versus allowed feedback overhead
One PMI per cluster, but only a single RI for the full bandwidth
The same precoder is applied on all RBs belonging to a cluster
The same transmission rank L is used for all RBs
Slide 50 / 59
LTE CLSM Performance [Schwarz et al., 2011]

45
40
Throughput [Mbit/s]
35
30
14.3 Mbit/s
10 dB
25
20
15
10
5
0
10
10
20
E /N [dB]
s
30
Channel capacity
40
Comparison of LTE to theoretical throughput bounds accounting or practical losses
Transmission with 1.4 MHz system bandwidth and Nt Nr = 8 8 antennas

Shannon channel capacity with water-filling over space and frequency
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
2.7 dB
25
20
5.3 Mbit/s
15
10
5
0
10
10
20
E /N [dB]
s
Channel capacity
Capacity excl. guard bands
30
40

Shannon channel capacity excluding LTEs guard bands
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
6.3 dB
25
20
15
10.2 Mbit/s
10
5
0
10
10
20
E /N [dB]
s
Channel capacity
Achiev. channel capacity
30
40

Capacity excluding all overhead (guard bands, reference symbols, cyclic prefix)
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
7.3 dB
25
20
15
10
13.2 Mbit/s
5
0
10
10
20
E /N [dB]
s
Channel capacity
Achiev. CLMI bound
30
40

Achievable rate with LTEs precoders (overhead excluded)
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
10.9 dB
25
20
15
10
15.5 Mbit/s
5
0
10
10
20
E /N [dB]
s
Channel capacity
Achiev. CLMI bound
Achiev. CLMILR bound
30
40

Achievable rate with LTEs precoders and ZF receiver
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
13.1 dB
25
20
15
10
16.5 Mbit/s
5
0
10
10
20
E /N [dB]
s
Channel capacity
Achiev. CLMI bound
Achiev. BICM bound
30
40

Achievable rate with LTEs precoders, ZF receiver and 4/16/64 QAM symbols
Slide 51 / 59

45
40
Throughput [Mbit/s]
35
30
16.5 dB
25
20
Channel capacity
Achiev. CLMI bound
Achiev. BICM bound
LTE optimum
15
10
5
19.0 Mbit/s
0
10
10
20
E /N [dB]
s
30
40

Simulated optimal performance of LTE (no estimation errors)
Slide 51 / 59
Comparison of LTEs Single-User MIMO Spatial Multiplexing Modes

SVD_versus_CLSM_versus_OLSM
18
16
4x4 SVD
Throughput [Mbit/s]
14
12
4x4 CLSM
10
8
4x4 OLSM
6
4
2
0
-5
10
15
20
SNR [dB]
25
30
35
40

SVD precoding with spatial water-filling only
Perfect channel knowledge at transmitter and receiver
MMSE receiver for CLSM and OLSM
Slide 52 / 59
Contents
5 Conclusions
Slide 53 / 59
Conclusions
Summary and Conclusions
There exist different notions of capacity depending on the available CSI

Capacity of deterministic channels
Ergodic capacity (fast fading)
Outage capacity (slow fading)
With full CSIT capacity can be achieved by SVD based transceivers and
water-filling power allocation
Spatial multiplexing (V-BLAST) with MMSE-SIC or ML detection obtains the
ergodic capacity of fast fading channels
V-BLAST does not achieve the fundamental diversity-multiplexing trade-off
Alternative: STBCs, such as, D-BLAST
LTE implements simple MIMO schemes (TxD, OLSM, CLSM)
LTE also enables sophisticated non-codebook based precoding
Slide 54 / 59
Conclusions

Slide 54 / 59
Conclusions

Slide 54 / 59
Conclusions
Single-User MIMO Transmission

389.168 Advanced Wireless Communications 1
stefan.schwarz@nt.tuwien.ac.at
Abbreviations I
AWGN additive white Gaussian noise
CDD cyclic delay diversity
CDI channel distribution information
CDIT channel distribution information at the transmitter
CLSM closed loop spatial multiplexing
CQI channel quality indicator
CSI channel state information
CSIT channel state information at the transmitter
D-BLAST diagonal Bell Labs space-time architecture
FEC forward error correction code
LTE long term evolution
MET maximum eigenmode transmission
MIMO multiple-input multiple-output
ML maximum likelihood
MMSE minimum mean squared error
OLSM open loop spatial multiplexing
OSTBC orthogonal space time block code
PMI precoding matrix indicator
Slide 56 / 59
Abbreviations
Abbreviations II
QAM quadrature amplitude modulation

RB resource block
RI rank indicator
SIC successive interference cancellation
SIMO single-input multiple-output
SINR signal to interference and noise ratio
SISO single-input single-output
SNR signal to noise ratio
STBC space time block code
SVD singular value decomposition
TxD transmit diversity
V-BLAST vertical Bell Labs space-time architecture
ZF zero forcing
Slide 57 / 59
Abbreviations
References I
Alamouti, S. (1998).
A simple transmit diversity technique for wireless communications.
IEEE journal on Selected Areas in Communications, 16, issue 8.
Clerckx, B. and Oestges, C. (2013).
MIMO Wireless Networks: Channels, Techniques and Standards for Multi-Antenna, Multi-User and Multi-Cell
Systems.
Academic Press. Elsevier.
Fincke, U. and Pohst, M. (1985).
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis.
Mathematics of Computation, 44(170):463471.
Jakes, W. C. and Cox, D. C., editors (1994).
Microwave Mobile Communications.
Wiley-IEEE Press.
Root, W. L. and Varaiya, P. P. (1968).
Capacity of classes of gaussian channels.
SIAM Journal on Applied Mathematics, 16(6):13501393.
Schwarz, S., Simko, M., and Rupp, M. (2011).
On performance bounds for MIMO OFDM based wireless communication systems.
In Signal Processing Advances in Wireless Communications SPAWC 2011, pages 311 315, San Francisco,
CA.
Shannon, C. E. (1948).
A mathematical theory of communication.
The Bell system technical journal, 27:379423.
Slide 58 / 59
References
References II
Steingrimsson, B., Luo, Z.-Q., and Wong, K. M. (2003).

Soft quasi-maximum-likelihood detection for multiple-antenna channels.
In IEEE International Conference on Communications, volume 4, pages 23302334.
Zheng, L. and Tse, D. (2003).
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels.
IEEE Transactions on Information Theory, 49(5):10731096.
Slide 59 / 59
References

Su Mimo

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Su Mimo

Caricato da

Copyright:

Formati disponibili

Single-User MIMO Transmission

389.168 Advanced Wireless Communications 1

1 Review of SISO Capacity Concepts

2 Single-User MIMO Channel Capacity

3 Single-User MIMO Transceivers

4 Single-User MIMO in LTE

1 Review of SISO Capacity Concepts

2 Single-User MIMO Channel Capacity

3 Single-User MIMO Transceivers

4 Single-User MIMO in LTE

Review of SISO Capacity Concepts

Fading SISO AWGN Channel

Fading channel coefficient h[k], e.g, Rayleigh fading h[k] CN 0, h2

Channel capacity: maximum transmission rate for which vanishing error

Review of SISO Capacity Concepts

SISO Capacity Definitions

Consider a fading channel

Channel coherence time Tc

The value at which the auto-correlation of h[k] drops below 1/ 2

Review of SISO Capacity Concepts

SISO Capacity Definitions

Consider a fading channel

Channel coherence time Tc

The value at which the auto-correlation of h[k] drops below 1/ 2

Review of SISO Capacity Concepts

SISO Capacity Definitions Fast Fading Channel

Consider channel coding over blocks of duration T : [x[k], . . . , x[k + T 1]]

Review of SISO Capacity Concepts

SISO Capacity Definitions Fast Fading Channel (2)

Fast fading channel with CSI at the transmitter

Details: please visit 389.032 Information Theory for Communications Engineers

Review of SISO Capacity Concepts

SISO Capacity Definitions Slow Fading Channel

Slow fading channel

Review of SISO Capacity Concepts

SISO Capacity Definitions Slow Fading Channel (2)

Outage probability definition

E.g., outage probability for Rayleigh fading

pout (R) = 1 exp

For higher rate R we have to accept higher outage probability 

Review of SISO Capacity Concepts

1 Review of SISO Capacity Concepts

2 Single-User MIMO Channel Capacity

3 Single-User MIMO Transceivers

4 Single-User MIMO in LTE

Single-User MIMO Channel Capacity

Fading Single-User MIMO Channel

Fading channel matrix H[k], e.g., Rayleigh fading [H[k]]ij CN 0, h2

Single-User MIMO Channel Capacity

Fading Single-User MIMO Channel

Fading channel matrix H[k], e.g., Rayleigh fading [H[k]]ij CN 0, h2

Single-User MIMO Channel Capacity

Capacity of Deterministic MIMO Channels

subject to: Qx  0, tr (Qx ) = Ps

U CNr Nr , CNr Nt , V CNt Nt ,

Single-User MIMO Channel Capacity

Capacity of Deterministic MIMO Channels

subject to: Qx  0, tr (Qx ) = Ps

U CNr Nr , CNr Nt , V CNt Nt ,

Single-User MIMO Channel Capacity

Capacity of Deterministic MIMO Channels (2)

Apply a change of coordinates

Capacity is unchanged as U and V are unitary

For higher rate R we have to accept higher outage probability

subject to: Qx 0, tr (Qx ) = Ps

subject to: Qx 0, tr (Qx ) = Ps

subject to: tr (Qx ) = Ps , Qx 0

subject to: tr (Qx ) = Ps , Qx 0

subject to: tr (Qx ) = Ps , Qx 0