Lecture 8

MIMO Architectures
(II)

Ragnar Thobaben
ISE/EECS/KTH

Receiver
Lecture 8: MIMO Architectures (II)
Architectures
Theoretical Foundations of Wireless Communications1
D-BLAST

Ragnar Thobaben
ISE/EECS/KTH

Friday, May 18, 2018

09:30-12:00, SIP

1
Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
1 / 20
 Overview

Lecture 7: MIMO Architectures

Lecture 8
MIMO Architectures • Generalized structure: V-BLAST.
(II)
• Fast fading channels: capacity with CSI-R.
Ragnar Thobaben
ISE/EECS/KTH
• Slow fading channels: outage probability.
Receiver
Architectures

D-BLAST Lecture 8: MIMO Architectures (Ch. 8.3+5)

1 Receiver Architectures
Linear Decorrelator
Successive Cancellation
Linear MMSE Receiver
MMSE-SIC
2 D-BLAST
Outage Probability
Outage-Suboptimality of V-BLAST (with MMSE-SIC)
Coding Across the Antennas: D-BLAST

2 / 20
 Receiver Architectures
– Linear Decorrelator
Motivation: achieving the capacity.
Lecture 8 • With CSI-T: use SVD and transmit along the eigenmodes.
MIMO Architectures
(II)
• With CSI-R and rich scattering: use the angular representation and
Ragnar Thobaben
ISE/EECS/KTH transmit along the angular windows.
Receiver
• Goal: make sure that the receiver can separate the data streams
Architectures efficiently.
Linear Decorrelator
Successive
Cancellation
Linear MMSE
Linear decorrelator
Receiver
MMSE-SIC • Time-invariant channel model (with H = [h1 . . . hnt ]):
D-BLAST
nt
X
y[m] = hi xi [m] + w[m].
i=1

• Focusing on the k-th data stream (i.e., the k-th transmit antenna):
X
y[m] = hk xk [m] + hi xi [m] + w[m].
i6=k

→ Interference from other streams.

3 / 20
 Receiver Architectures
– Linear Decorrelator
• Goal: project y onto the subspace Vk which is orthogonal to the
Lecture 8 space spanned by h1 , . . . , hk−1 , hk+1 , . . . hnt .
MIMO Architectures
(II) • Assuming Vk is dk -dimensional, the projection
Ragnar Thobaben can be described by a matrix multiplication with a (dk ×nr ) matrix Qk :
ISE/EECS/KTH

Receiver
Architectures
Linear Decorrelator
Successive
Cancellation ỹ[m] = Qk y[m]
Linear MMSE
Receiver = Qk hk xk [m] + w̃[m],
MMSE-SIC
D-BLAST with
w̃[m] = Qk w[m].

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

→ Rows of Qk form an orthonormal basis of Vk .

→ hk has to be linearly independent of h1 , . . . , hk−1 , hk+1 , . . . hnt .
→ The maximum number of data streams is nt ≤ nr ; i.e., only subsets
of antennas are used if nt > nr .
4 / 20
 Receiver Architectures
– Linear Decorrelator
• Optimal demodulation
Lecture 8 • Matched filtering of ỹ[m] with Qk hk , or equivalently filtering y[m]
MIMO Architectures with a filter
(II)
ck = (Q∗k Qk )hk .
Ragnar Thobaben
ISE/EECS/KTH • SNR after matched filtering (k-th stream with power Pk ):

Receiver Pk kQk hk k2 /N0 .

Architectures
Linear Decorrelator
Successive
Cancellation
Linear MMSE
Receiver
MMSE-SIC
D-BLAST • Decorrelating multiple streams
simultaneously
• Multiplying with the pseudoinverse:

H† = (H∗ H)−1 H∗ .
• Bank of decorrelators.

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

5 / 20
 Receiver Architectures
– Linear Decorrelator: Performance

Lecture 8
MIMO Architectures
(II) Case 1: deterministic H.
Ragnar Thobaben
ISE/EECS/KTH • Maximum rate for the k − th stream and sum rate
nt
Pk kQk hk k2
 
Receiver X
Architectures Ck := log 1 + and Rdecorr = Ck .
Linear Decorrelator N0
Successive k=1
Cancellation
Linear MMSE
Receiver • No inter-stream interference: SNR = Pk khk k2 /N0 .
MMSE-SIC
• Inter-stream interference reduces rate since kQk hk k ≤ khk k.
D-BLAST
• kQk hk k = khk k if hk is orthogonal to the other spatial signatures
hi , with i 6= k.

6 / 20
 Receiver Architectures
– Linear Decorrelator: Performance

Case 2: fading channels.

Lecture 8
MIMO Architectures • Fast fading, average over realizations of the channel process:
(II)
nt
Pk kQk hk k2
  
Ragnar Thobaben X
ISE/EECS/KTH C̄k := E log 1 + and Rdecorr = C̄k
N0
k=1
Receiver
Architectures
Linear Decorrelator → Generally less or equal to the capacity with CSI-R.
Successive
Cancellation • High SNR , i.i.d. Rayleigh fading, nmin = nt :
Linear MMSE "n #
Receiver t
SNR X
MMSE-SIC
Rdecorr ≈ nmin log +E log(kQk hk k2 )
D-BLAST nt k=1
SNR
= nmin log + nt E[log χ22(nr −nt +1) ]
nt

→ Decorrelator is able to fully exploit the degrees of freedom of the

MIMO channel.
→ Second term shows the degradation in rate compared to the
capacity.

7 / 20
 Receiver Architectures
– Linear Decorrelator: Performance
• Example

Lecture 8
MIMO Architectures
(II)

Ragnar Thobaben
ISE/EECS/KTH

Receiver
Architectures
Linear Decorrelator
Successive
Cancellation
Linear MMSE
Receiver
MMSE-SIC
D-BLAST

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

8 / 20
 Receiver Architectures
– Successive Cancellation

• Decorrelator: bank of separate filters for estimating the data

Lecture 8
MIMO Architectures streams.
(II)
• But: the result from one of the filters can be used to improve the
Ragnar Thobaben
ISE/EECS/KTH operation of the others; successive interference cancellation, SIC.
Receiver
Architectures
Linear Decorrelator
Successive
Cancellation
• Modified detector structure:
Linear MMSE • For the k-th decorrelator, the
Receiver
MMSE-SIC k − 1 previous streams have
D-BLAST
been removed.
→ Error propagation!

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

• hk is projected by Q̃k on a higher dimensional subspace orthogonal

to that spanned by hk+1 , . . . , hnt .
• Improved SNR on the k-th stream: SNRk = Pk kQ̃k hk k2 /N0

9 / 20
 Receiver Architectures
– Successive Cancellation: Performance
• A similar derivation as above yields
"n #
t
SNR X
2
Lecture 8 Rdec-sic ≈ nmin log +E log(kQ̃k hk k )
MIMO Architectures nt k=1
(II)
tn
Ragnar Thobaben SNR X
ISE/EECS/KTH = nmin log + E[log χ22(nr −nt +k) ]
nt k=1
Receiver
Architectures
Linear Decorrelator
• SIC does not gain additional degrees of freedom.
Successive • Constant term is equal to that in the capacity expansion
Cancellation
Linear MMSE (cf. (8.18)-(8.20) in the book)
Receiver
MMSE-SIC ⇒ Power gain by decoding and subtracting!
D-BLAST • Example

10 / 20
 Receiver Architectures
– Linear MMSE Receiver
Comparison: decorrelator bank versus a bank of matched filters
Lecture 8
MIMO Architectures
(II)

Ragnar Thobaben
ISE/EECS/KTH

Receiver
Architectures
Linear Decorrelator
Successive
Cancellation
Linear MMSE
Receiver
MMSE-SIC
D-BLAST

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

• Matched filter: good at low SNR, bad at high SNR.

(Preserving the signal energy at the cost of interference.)
• Decorrelator: bad at low SNR, good at high SNR.
(Eliminating all interference at the cost of a low SNR.)
• Desirable receiver: maximize the signal-to-interference-plus-noise
ratio (SINR).
11 / 20
 Receiver Architectures
– Linear MMSE Receiver

Derivation of a generic MMSE receiver

Lecture 8
MIMO Architectures • Generic model: y = hx + z, with
(II)
• Complex circular symmetric colored noise z;
Ragnar Thobaben
ISE/EECS/KTH • An invertible covariance matrix Kz ;
• A deterministic vector h;
Receiver
Architectures
• A scalar data symbol x.
Linear Decorrelator
−1/2 −1/2
Successive
Cancellation
• Apply a linear transform2 Kz such that z̃ = Kz z is white,
Linear MMSE
Receiver
MMSE-SIC Kz−1/2 y = Kz−1/2 hx + z̃.
D-BLAST −1/2
• Matched filtering with (Kz h)∗ :

(Kz−1/2 h)∗ Kz−1/2 y = h∗ K−1 ∗ −1 ∗ −1

z y = h Kz hx + h Kz z

→ The linear receiver vmmse = K−1

z h maximizes the SNR.

• Achieved SINR: σx2 h∗ K−1

z h.

2
Reminder: if Kz is invertible, then Kz = UΛU∗ and K1/2
z = UΛ1/2 U∗ .
12 / 20
 Receiver Architectures
– Linear MMSE Receiver
Specialization for the MIMO case
Lecture 8 • Channel model for the k-th stream,
MIMO Architectures
(II)
y[m] = hk xk [m] + zk [m],
Ragnar Thobaben
ISE/EECS/KTH
with the noise plus interference term and its covariance matrix3
Receiver
Architectures X nt
X
Linear Decorrelator
Successive
zk [m] = hi xi [m] + w[m] and Kzk = N0 Inr + Pi hi h∗i .
Cancellation i6=k i6=k
Linear MMSE
Receiver
MMSE-SIC • Linear MMSE receiver:
D-BLAST  −1
nt
X
vmmse = N0 Inr + Pi hi h∗i  hk ,
i6=k

achieving the output SINR

 −1
nt
X
Pk h∗k K−1 ∗
zk hk = Pk hk N0 Inr + Pi hi h∗i  hk .
i6=k

3
Note that Kzk is invertible.
13 / 20
 Receiver Architectures
– Linear MMSE Receiver
Performance
Lecture 8 • Low SNR: Kzk ≈ N0 Inr , i.e., MMSE solution becomes matched filter.
MIMO Architectures
(II)
• High SNR: MMSE receiver reduces to the decorrelator.
Ragnar Thobaben
ISE/EECS/KTH • Capacities for the k-th stream
Receiver
  h  i
Architectures Ck = log 1 + Pk h∗k K−1
zk hk and C̄k = E log 1 + Pk h∗k K−1
zk hk .
Linear Decorrelator
Successive
Cancellation • Example: i.i.d. Rayleigh fading and equal power allocation.
Linear MMSE
Receiver
MMSE-SIC
D-BLAST

(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

14 / 20
 Receiver Architectures
– MMSE-SIC

Lecture 8
MIMO Architectures
(II)

Ragnar Thobaben
ISE/EECS/KTH

Receiver
Architectures
Linear Decorrelator
Successive
Cancellation
Linear MMSE
Receiver
MMSE-SIC
D-BLAST (D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

• Successive interference cancellation using MMSE filters.

• MMSE-SIC achieves the highest possible rate for CSI-R
 
1
log det Inr + HKx H∗
N0

15 / 20
 Receiver Architectures
– MMSE-SIC: Information Theoretic Optimality
• Consider again the generic model y = hx + z, with additive colored
Lecture 8
noise and Gaussian x and z.
MIMO Architectures
(II) • MMSE receiver is information lossless; i.e., it provides a sufficient
∗
Ragnar Thobaben statistic to detect x such that I (x; y) = I (x; vmmse y).
ISE/EECS/KTH
• Consider now the MIMO model y[m] = Hx[m] + w[m], with
Receiver
Architectures x ∼ CN (0, diag{P1 , . . . , Pnt }).
Linear Decorrelator
Successive • Using the chain rule of mutual information, we get
Cancellation
Linear MMSE
Receiver I (x; y) = I (x1 , . . . , xnt ; y)
MMSE-SIC
D-BLAST = I (x1 ; y) + I (x2 ; y|x1 ) + . . . + I (xnt ; y|x1 , . . . , xnt −1 ).
• Considering the k-th term in the chain rule, we get

I (xk ; y|x1 , . . . , xk−1 ) = I (xk ; y0 ) = I (xk ; vmmsek

∗
y0 )

using
k−1
X X
y0 = y − hi xi = hk xk + hi xi + w
i=1 i>k

→ The rate achieved in the k-th stage is precisely I (xk ; y|x1 , . . . , xk−1 ).
16 / 20
 D-BLAST
– Outage Probability

• Reliable communication at rate R is possible as long as

Lecture 8
MIMO Architectures  
(II) 1
log det Inr + HKx H∗ > R subject to Tr[Kx ] ≤ P.
Ragnar Thobaben N0
ISE/EECS/KTH

Receiver → Information theory guarantees the existence of a channel-state

Architectures
independent coding scheme that achieves reliable communications
D-BLAST whenever this condition is met.
Outage Probability
Suboptimality of → Universal code: works for all channels that satisfy the above
V-BLAST
Coding Across the condition.
Antennas
→ If the condition is not satisfied, we are in outage.
• Outage probability
   
1
MIMO
pout (R) = min Pr log det Inr + HKx H∗ < R .
Kx :Tr[Kx ]≤P N0

→ Choose the transmit strategy (i.e., Kx ) to minimize the outage

probability.
→ Solution depends on statistics of H.

17 / 20
 D-BLAST
– Outage-Suboptimality of V-BLAST (with MMSE-SIC)

Lecture 8 V-BLAST: capacity achieving for the fast fading MIMO channel
MIMO Architectures
(II) • Independent data streams are multiplexed and transmitted over the
Ragnar Thobaben antenna; stream k with power Pk and rate Rk .
ISE/EECS/KTH
• MMSE-SIC receiver.
Receiver
Architectures

D-BLAST
Outage Probability V-BLAST: diversity
Suboptimality of
V-BLAST • Each stream has at most diversity order nr while the MIMO channel
Coding Across the
Antennas provides diversity gain nr × nt .
→ V-BLAST does not exploit full diversity and cannot be outage
optimal.
• Due to interference, the diversity can be lower than nr .
(Example: for SIC with decorrelator the diversity loss equals the
number of uncanceled interferers.)

18 / 20
 D-BLAST
– Outage-Suboptimality of V-BLAST (with MMSE-SIC)
• For a given H, V-BLAST achieves
Lecture 8   Xnt
1
HKx H∗ =
MIMO Architectures
(II) log det Inr + log(1 + SINRk ).
N0
Ragnar Thobaben k=1
ISE/EECS/KTH
(SINRk is random since it is a function of H.)
Receiver
Architectures • Assume that the outage-optimal transmit strategy Kx is employed
D-BLAST and that the target rate R is split into rates R1 , . . . , Rnt .
Outage Probability
Suboptimality of • The channel is in outage if
V-BLAST
Coding Across the nt   nt
Antennas X 1 X
log(1 + SINRk ) = log det Inr + HKx H∗ < R = Rk
N0
k=1 k=1

→ V-BLAST is in outage whenever any stream is in outage (i.e.,

log(1 + SINRk ) < Rk for some k), and this can occur even though
the channel is not in outage.
Summary: Problem with V-BLAST
• Each stream sees only one efficient channel with SINRk ; there is no
coding across the channels.
• But each stream should see all channels.
19 / 20
 D-BLAST
– Coding Across the Antennas: D-BLAST
Two-antenna example
• The i-th codeword x(i) is made up of two
Lecture 8 (i) (i)
MIMO Architectures codewords xA and xB .
(II)
• First time slot: antenna-1 is silent; antenna-2
Ragnar Thobaben (1)
ISE/EECS/KTH transmits xA ; receiver performs MRC of the
(1)
Receiver
received antennas to estimate xA .
Architectures (1)
→ xA sees effectively SINR2 .
D-BLAST
Outage Probability • Second time slot: antenna-1 transmits x(1)
B ;
Suboptimality of
V-BLAST (2)
Coding Across the
antenna-2 transmits xA ; receiver performs linear
Antennas (2) (1)
MMSE treating xA as noise and estimates xB .
(1)
→ xB sees effectively SINR1 .
• The codeword x(i) can be decoded if
log(1 + SINR1 ) + log(1 + SINR2 ) > R
(1) (2)
and xB can be subtracted such that xA sees again
an interference-free channel.
(D. Tse and P. Viswanath, Fundamentals of Wireless Communications.)

Drawbacks: Rate-loss due to initialization phase and error propagation.

20 / 20