Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

9213051

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 16

Channel

Channel Capacity
Capacity of
of MIMO
MIMO
Channels
Channels

指導教授:黃文傑 老師
學 生:曾凱霖
學 號: M9121014

無線通訊實驗室
Outline
1 、 Introduction
2 、 Shannon capacity of MIMO
systems
3 、 The ”pipe” interpretation
4 、 To exploit the MIMO channel
– BLAST
– Space Time Coding
5 、 Conclusion
Why multiple
antennas ????

• Frequency and time processing


are at limits.
• Space processing is interesting
because it does not increase
bandwidth.
Initial Assumptions

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


• Slowly fading channel (Tcoh>> Tsymb)
• n receive and nt transmit antennas
r
• Receiver estimates the channel
perfectly
• We consider space diversity only
SISO Systems
h x(t): transmitted signal
y(t): received signal
h(t): channel transfer function
n(t): noise (AWGN, 2)
y(t)
x(t)
y(t) = h • x(t) + n(t)
PT
Signal to noise ratio : ρ  2
σ
Capacity : C = log2(1+)
Receive Diversity
H11

H21

 PT *
C log 2 det  I  2 HH 
 σ nt 
= log2[1+(PT2)·|H|2] [bit/(Hz·s)]
Capacity increases logarithmically
with number of receive antennas... H = [ H11 H21]
Transmit Diversity /
Beamforming

H11

H12

Cdiversity = log2(1+(PT2)·|H|2)
[bit/(Hz·s)]

•Capacity increases logarithmically with nt


MIMO Systems
H H12 
H11 H  11
H 22 
 H 21
H21
H12

H22 Where the i are the


eigenvalues to HH†
Cdiversity = log2det[I +(PT2 )·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 )

p1 
p2 
p3 
p4 
The Channel
Eigenvalues
Orthogonal channels HH† =I, 1= 2= …= m= 1

m
 PT 
Cdiversity  log 2 1  2 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
Time
detection. Using nulling
Antenna

s1 s1 s1 s1 s1 s1
s2 s2 s2 s2 s2 s2 V-BLAST and symbol cancellation
s3 s3 s3 s3 s3 s3
• V-BLAST implemented -
s0 s1 s2 s0 s1 s2 98 by Bell Labs (40
s0 s1 s2 s0 s1 D-BLAST
s0 s1 s2 s0 bps/Hz)

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


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 outer code to get coding
gain)
• nr= 1 is possible
• Properly designed codes acheive diversity
of nr nt
Orthogonal Space-time Block
Codes
Block of T
symbols
Constellation
mapper

Data in nt transmit
STBC antennas

Block of K
symbols
• K input symbols, T output symbols T K
• 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 !!!
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
r H c  n

 r0   h1 h2   n0   c0 
r  *  , H  * *
, n  *  , c  
 r1   h2  h1   n1   c1 

~ * * * 2 ~
r H r H H c  H n  H F c  n
Diagonal matrix due to orthogonality

The MIMO/ MISO system is in fact


transformed to an equivalent SISO
system with SNR

SNReq = || H ||F2 SNR/nt  


|| H ||F2 =  
Conclusion
• MIMO systems are a promising
technique for high data rates.
• Their efficiency depends on the
channel between the
transmitters and the receivers
(power and correlation).
• Practical issues need to be
resolved.

You might also like