MIMO Antenna Systems for

Wireless Communication
Prakshep Mehta (03307909)
Guided By:
Prof. R.K. Shevgaonkar
Outline
 Introduction...Why MIMO??
 What is MIMO ??
 From SISO to MIMO
 The ”pipe” interpretation
 To exploit the MIMO channel
Foschini, Bell Labs 1996
 BLAST
Tarokh, Seshadri & Calderbank
 Space Time Coding 1998

 Special Cases
 Still to Conquer
What is MIMO ??
Initial Assumptions

 Flat fading channel (Bcoh>> 1/ Tsymb)

 Slowly fading channel (Tcoh>> Tsymb)
 nr receive and nt transmit antennas
 Noise limited system (no CCI)
 Receiver estimates the channel perfectly
 We consider space diversity only
”Classical” receive diversity

H11
H21

 PT *
C  log 2 det I  2 HH 
 σ nt 
= log2[1+(PT2)·|H|2] [bit/(Hz·s)]

H = [ H11 H21]
Capacity increases logarithmically
with number of receive antennas...
 Multiple Input Multiple Output systems
H H12 
H   11
H11  H 21 H 22 
H21
H12

H22
Where the i are the
C = log2det[I +(PT2 )·HH†]= eigenvalues to HH†

 P   P 
 log 2 1  T 2 1   log 2 1  T 2 2 
 2   2 

Interpretation: 
Transmitter Receiver

m=min(nr, nt) parallel channels,
equal power allocated to each ”pipe”
MIMO capacity in general
H unknown at TX H known at TX
 P  m
 p 
C  log 2 det  I  2T HH *   C   log 2 1  i 2 i 
  nt  i 1   
m
 P 
  log 2 1  2T i  Where the power distribution over
  nt 
”pipes” are given by a water filling
i 1
solution

m  min(nr , nt )
m m
 1
PT   pi     
i 1 i 1  i 

p1 
p2 
p3 
p4 
The Channel Eigenvalues

Orthogonal channels HH† =I, 1= 2= …= m= 1

m
 P 
Cdiversity   log 2 1  2T i   min(nt , nr )  log 2 (1  PT /  2 nt )
i 1   nt 

• Capacity increases linearly with min( nr , nt )

• An equal amount of power PT/nt is allocated
to each ”pipe”

Transmitter Receiver
To Exploit the MIMO Channel

Bell Labs Layered

Space Time Architecture

• nr  nt required
• Symbol by symbol detection.
Time Using nulling and symbol
s1 s1 s1 s1 s1 s1 cancellation
Antenna

V-BLAST
s2 s2 s2 s2 s2 s2
s3 s3 s3 s3 s3 s3
• V-BLAST implemented -98 by
Bell Labs (40 bps/Hz)
s0 s1 s2 s0 s1 s2
s0 s1 s2 s0 s1 D-BLAST • If one ”pipe” is bad in BLAST
s0 s1 s2 s0
we get errors ...

{G.J.Foschini, Bell Labs Technical Journal 1996 }

Solution: BLAST algorithm
 Idea: NON-LINEAR DETECTOR

 Step 1: H+ = (HH H)-1 HH

 Step 2: Find the strongest signal
(Strongest = the one with the highest post detection SNR)
 Step 3: Detect it (Nearest neighbor among Q)
 Step 4: Subtract it
 Step 5: if not all yet detected, go to step 2
Space Time Coding

• Use parallel channel to obtain diversity not

spectral efficiency as in BLAST

• Space-Time trellis codes : coding and diversity

gain (require Viterbi detector)

• Space-Time block codes : diversity gain

(use MMSE at Decoder)

*{V.Tarokh, N.Seshadri, A.R.Calderbank

Space-time codes for high data rate wireless communication:
Performance Criterion and Code Construction
, IEEE Trans. On Information Theory March 1998 }
Orthogonal Space-time Block Codes

Block of T
symbols

Constellation
mapper
Data in
nt transmit
STBC antennas

• K input symbols, T output symbols T K

Block of K
symbols • R=K/T is the code rate
• If R=1 the STBC has full rate
• If T= nt the code has minimum delay
• Detector is linear !!!
*{V.Tarokh, H.Jafarkhani, A.R.Calderbank
Space-time block codes from orthogonal designs,
IEEE Trans. On Information Theory June 1999 }
STBC for 2 Transmit Antennas

Full rate and

minimum delay
c0  c1* 
[ c 0 c1 ]   * 
 c1 c0 
Antenna

Time

Assume 1 RX antenna:

Received signal at time 0 r0  h1c0  h2 c1  n0

Received signal at time 1 r1  h1c1*  h2 c0*  n1
Still to Conquer !!
 Backward Compatibility
 Antenna Spacing
 Complexity at Receiver
”Take- home message”

MIMO is the
FUTURE