An Overview of MIMO Systems in Wireless Communications

An Overview of MIMO Systems in
Wireless Communications
Lecture in Communication Theory for Wireless Channels
Sebastien de la Kethulle September 27, 2004
An Overview of MIMO Systems in Wireless Communications 1
Future Broadband Wireless Systems
Desired attributes
Signicant increase in spectral eciency and data rates
High QualityofService (QoS) bit error rate, outage, . . .
Wide coverage
Low deployment, maintenance and operation costs
The wireless channel is very hostile
Severe uctuations in signal level (fading)
Cochannel interference
Signal power falls o with distance (path loss)
Scarce available bandwidth
. . .
[1]
The Wireless Channel
Multipath propagation causes signal fading
[1]
MIMO System
Performance Improvements Using MIMO Systems
Array gain = increase coverage and QoS
Diversity gain = increase coverage and QoS
Multiplexing gain = increase spectral eciency
Cochannel interference reduction = increase cellular capacity
[1]
Array Gain
Increase in average received SNR obtained by coherently combining
the incoming / outgoing signals
Requires channel knowledge at the transmitter / receiver
[2, 3]
Array Gain
1
, . . . ,
m
=
(
eig
`
HH
if M < N
eig
`
H
if M N
y = Hx +n
H C
MN
(E|H
ik
|
2
= 1). x C
N
, y C
M
n C
M
: zeromean complex Gaussian noise
Principle: To obtain the full array gain, one should transmit using the
maximum eigenmode of the channel
The singular value decomposition (SVD) H = UDV
, with
D = diag(
1
, . . . ,
m
, 0, . . . , 0) and m = min{N, M}, yields
m equivalent SISO channels
y = D x + n,
where y = U
y, x = V
x and n = U
n (U, V unitary)
[2, 3]
Array Gain
y = D x + n
If
i
=
max
= max{
1
, . . . ,
m
}, (maximum eigenmode)
y
i
=
_
max
x
i
+ n
i
Known results
For N 1 and 1 M arrays, the array gain (increase in average
SNR) is respectively of 10 log
10
N and 10 log
10
M dB
In the asymptotic limit, with M large:
max
< (
c + 1)
2
M c =
N
M
1
min
> (
c 1)
2
M c =
N
M
> 1
For maximum
Capacity: waterlling (later in this presentation)
Array gain: use only the maximum eigenchannel
[2, 3]
Diversity Gain
Principle: provide the receiver with multiple identical copies of a
given signal to combat fading = gain in instantaneous SNR
[4]
Diversity Gain
Intuitively, the more independently fading, identical copies of a
given signal the receiver is provided with, the faster the bit error rate
(BER) decreases as a function of the per signal SNR. At high SNR
values, it has been shown that
P
e
(G
c
SNR)
d
where d represents the diversity gain and G
c
the coding gain
Denition: For a given transmission rate R, the diversity gain is
d(R) = lim
SNR
log(P
e
(R, SNR))
log SNR
, (1)
where P
e
(R, SNR) is the BER at the given rate and SNR
Independent versus correlated fading
Diminishing return for each extra signal copy
[3, 5, 6]
Diversity Gain
L d
per receive antenna
The diversity gain is the magnitude of the slope of the BER P
e
(R, SNR) plotted
as a function of SNR on a loglog scale
[4, 6]
Multiplexing Gain
Principle: Transmit independent data signals from dierent
antennas to increase the throughput
[1]
CoChannel Interference
[1]
CoChannel Interference Reduction
N 1 interferees can be cancelled with N transmit antennas
M 1 interferers can be cancelled with M receive antennas
[1]
Capacity of MIMO Systems The Gaussian Channel
y = Hx +n,
with:
H C
MN
with uniform phase and Rayleigh magnitude (Rayleigh
fading environment)i.i.d. Gaussian, zeromean, independent real
and imaginary parts, variance 1/2
x C
N
, y C
M
n: zeromean complex Gaussian noise. Independent and equal
variance real and imaginary parts. E[nn
] = I
M
Transmitter power constraint: E[x
x] = tr
_
E[xx
]
_
P
[7]
Circularly Symmetric Random Vectors
Denition: A complex Gaussian random vector x C
n
is said to be
circularly symmetric if the corresponding vector
x R
2n
=
_
Re(x)
Im(x)
_
has the structure
E
_
( x E[ x])( x E[ x])
=
1
2
_
Re(Q) Im(Q)
Im(Q) Re(Q)
_
for some Hermitian nonnegative denite Q C
nn
[7]
Circularly Symmetric Random Vectors
The pdf of a CSCG random vector x with mean and covariance matrix
Q is given by
f
,Q
(x) =
1
det Q
exp
_
(x )
Q
1
(x )
and has dierential entropy

h(X) =
_
C
n
f
,Q
(x) log f
,Q
(x) dx
= log det eQ
[7]
The Deterministic Gaussian Channel Capacity
y = Hx +n, E[x
x] P
Idea: Maximize the mutual information between x and y
I(X; Y) = h(Y) h(Y|X)
= h(Y) h(N)
= Maximize h(Y)
[7]
Maximizing h(Y)
It can be shown that:
If x satises E[x
x] P, then so does x E[x]

For all y C
M
, h(Y) is maximized if y is Circularly Symmetric
Complex Gaussian (CSCG)
If x C
N
is CSCG with covariance Q, then y = Hx +n C
M
is also
CSCG
= I(X; Y) = log det e(I
M
+HQH
) log det e
= log det(I
M
+HQH
)
A nonnegative denite Q such that I(X; Y) is maximum and
tr(Q) P remains to be found
[7]
Deterministic Gaussian MIMO Channel
H known at the transmitter (waterlling solution): Choose Q
diagonal, such that
Q
ii
= (
1
i
)
+
, i = 1, . . . , N
with ()
+
max(, 0), (
1
, . . . ,
N
) the eigenvalues of H
H and such
that
i
Q
ii
= P. The capacity is given by:
C
WF
=
N
i=1
_
log(
i
)
_
+
[bits/s/Hz]
H unknown at the transmitter: Choose Q =
P
N
I
N
(equal power).
Then,
C
EP
= log det(I
M
+
P
N
HH
) [bits/s/Hz]
[3, 7]
Waterlling Solution
Rayleigh Fading MIMO Channel
Memoryless Rayleigh fading Gaussian channel (unknown at the
transmitter)
Choose x CSCG and Q =
P
N
I
N
. The ergodic capacity is given by:
C
EP
= E
H
_
log det(I
M
+
P
N
HH
)
_
[bits/s/Hz]
= E
H
_
m
i=1
log
_
1 +
P
N
i
_
_
,
where m = min(N, M) and
1
, . . . ,
m
are the eigenvalues of the
Wishart matrix
W=
_
HH
M < N
H
H M N
For large SNR, C
EP
= min(N, M) log P +O(1), i.e. the capacity
grows linearly with min(N, M)!
[3, 7]
Capacity of Fading Channels
Rayleigh fading: the capacity grows linearly with min(N, M)
Ricean channels: Increasing the lineofsight (LOS) strength at xed
SNR reduces the capacity
If the gains in H become highly correlated, there is a capacity loss
Waterlling (WF) capacity gains over Equal Power (EP) capacity
are signicant at low SNR but converge to zero as the SNR increases
= Question: Is it benecial to feed the channel state back to the
transmitter ?
Many exact capacity results are known for i.i.d. Rayleigh channels.
For other channels (Rice, etc.), we have many limiting results
[3]
Ergodic Capacity of Ideal MIMO Systems
M
T
N
M
R
M
Channel unknown at the transmitter, i.i.d. Rayleigh fading
[6]
Outage Capacity
The capacity of a fading channel is a random variable
Denition: The q% outage capacity C
out,q
of a fading channel is the
information rate that is guaranteed for (100 q)% of the channel
realizations, i.e.
P(I(X; Y) C
out,q
) = q%
Since, for large SNR and i.i.d. Rayleigh fading,
C = min(N, M) log SNR +O(1),
we can dene the multiplexing gain r as
r = lim
SNR
C(SNR)
log SNR
,
which comes at no extra bandwidth or power
[1, 3, 6]
Outage Capacity of Ideal MIMO Systems
M
T
N
M
R
M
Channel unknown at the transmitter, i.i.d. Rayleigh fading
[6]
Transmission over MIMO channels
We can use the advantages provided by MIMO channels to:
Maximize diversity to combat channel fading and decrease the bit
error rate (BER) = spacetime codes (STC)
Maximize the throughput = spatial multiplexing, VBLAST (Bell
laboratories layered spacetime)
Try to do both at the same time = tradeo between increasing the
throughput and increasing diversity
[3, 6, 8]
Maximizing Diversity with SpaceTime Codes
SpaceTime Trellis Codes (STTC)
often better performance
at the cost of increased complexity
Complex decoding (vector version of the Viterbi algorithm)
increases exponentially with the transmission rate
Full diversity. Coding gain
SpaceTime Block Codes (STBC)
Simple maximumlikelihood (ML) decoding based on linear
processing
Full diversity. Minimal or no coding gain
[3]
Alamouti Scheme for Transmit Diversity (STBC)
_
r
1
= h
1
c
1
+ h
2
c
2
+ n
1
[time t]
r
2
= h
1
c
2
+ h
2
c
1
+ n
2
[time t + T]
=
_
r
1
= h
1
r
1
+ h
2
r
2
= (|h
1
|
2
+|h
2
|
2
)c
1
+ h
1
n
1
+ h
2
n
2
c
1
r
2
= h
2
r
1
h
1
r
2
= (|h
1
|
2
+|h
2
|
2
)c
2
h
1
n
2
+ h
2
n
1
c
2
Assumption: the channel remains unchanged over two consecutive
symbols
Rate = 1 Diversity order = 2 Simple decoding
[9]
STBC Receiver Structure
[3]
STBCs from Complex Orthogonal Designs
Alamoutis scheme works only when N = 2 = Generalization
Denition: A complex orthogonal design O
c
of size N is an
orthogonal matrix with entries in the indeterminates
x
1
, x
2
, . . . , x
N
, their conjugates x
1
, x
2
, . . . , x
N
or multiples
of these indeterminates by
1
Example (2 2): O
c
(x
1
, x
2
) =
_
x
1
x
2
x
2
x
1
_ space time
Coding scheme (using a constellation A with 2

b
elements):
1. At time slot t, Nb bits arrive at the encoder. Select constellation
signals c
1
, . . . , c
N
2. Set x
i
= c
i
to obtain a matrix C = O
c
(c
1
, . . . , c
N
)
3. At each time slot t = 1, . . . , N, the entries C
ti
, i = 1, . . . , N are
transmitted simultaneously from transmit antennas 1, 2, . . . , N
[10]
STBCs from Complex Orthogonal Designs
The maximumlikelihood detection rule reduces to simple linear
processing for STBCs
One can obtain the maximum possible diversity order MN at
transmission rate R = 1 using STBCs based on orthogonal designs
However: complex orthogonal designs exist only if n = 2. . . !
[10]
Generalized Complex Orthogonal Designs (GCOD)
Denition: Let G
c
be a p N matrix with entries in the indeterminates
x
1
, x
2
, . . . , x
k
, their conjugates x
1
, x
2
, . . . , x
k
or multiples of
these indeterminates by
1 or 0. If G
c
G
c
= (|x
1
|
2
+ +|x
k
|
2
)I,
then G
c
is referred to as a generalized complex orthogonal design of size
N and rate R = k/p
Denition: Generalized complex linear processing orthogonal design
(GCLPOD) L
c
: exactly like above, but the entries can be linear
combinations of x
1
, . . . , x
k
and their conjugates
One can obtain a diversity order of MN at rate R using a STBC
based on a GCOD or a GCLPOD of size N and rate R
[10]
Generalized Complex Orthogonal Designs
Generalized complex linear processing orthogonal designs of rates:
R = 1 exist for N = 2
R = 3/4 exist for N = 3 and N = 4
R = 1/2 exist for N 5
For N 3, it is not known whether GCLPODs with higher rates exist
Example (GCLPOD, R =
3
4
, N = 3 and GCOD, R =
1
2
, N = 3):
L
3
c
=
_
_
_
_
_
x
1
x
2
x
3
2
x
2
x
1
x
3
2
x
2
x
2
x
1
x
1
+x
2
x
2
2
x
2

x
2
x
2
+x
2
+x
1
x
1
2
_
_
_
_
_
G
3
c
=
_
_
_
_
_
_
_
_
_
_
x
1
x
2
x
3
x
2
x
1
x
4
x
3
x
4
x
1
x
4
x
3
x
2
x
1
x
2
x
3
x
2
x
1
x
4
x
3
x
4
x
1
x
4
x
3
x
2
_
_
_
_
_
_
_
_
_
_
[10]
Capacity and SpaceTime Block Codes
Spacetime block codes
have extremely low encoder/decoder complexity
provide full diversity
However
For the i.i.d. Rayleigh channel, STBCs result in a capacity loss in
the presence of multiple receive antennas
STBCs are only optimal with respect to capacity when they have
rate R = 1 and there is one receive antenna
[11]
Maximizing the Throughput with VBLAST
[1]
Maximizing the Throughput with VBLAST
Description
Transmitters operate cochannel, symbol synchronized
Substreams are exactly independent (no coding across the transmit
antennas each substream can be individually coded)
Individual transmit powers scaled by
1
N
so the total power is kept
constant
Channel estimation burst by burst using a training sequence
Requires nearindependent channel coecients
[4]
Receivers for Spatial Multiplexing
y = Hx +n, i.e.
_
_
y
1
y
2
.
.
.
y
M
_
_
=
_
_
h
11
h
12
h
1N
h
21
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
h
M1
h
MN
_
_
_
_
x
1
x
2
.
.
.
x
N
_
_
+
_
_
n
1
n
2
.
.
.
n
M
_
_
If we transmit a block of N T symbols, we have Y = HX+N, with
Y, N C
MT
and X C
NT
Optimal (ML) Receiver: x = arg min
x
_
_
y Hx
_
_
Exhaustive search (often prohibitive complexity)
Diversity order for each data stream: M (N M)
[3, 4, 6]
y = Hx +n
Zeroforcing (ZF) Receiver:
x = H
#
y
with H
#
= (H
H)
1
H
(pseudoinverse)
Signicantly reduced receiver complexity
Noise enhancement problem
Diversity order for each data stream: M N + 1 (N M)
[3, 4, 6, 12]
y = Hx +n
Minimum meansquare error (MMSE) Receiver:
x =

W y, where

W= arg min
W
E
_
_
_
Wy x
_
_
2
_
.
We obtain:
x = H
_
HH
+E
_
nn
_
1
y
Minimizes the overall error due to noise and mutual interference
Equivalent to the zeroforcing receiver at high SNR
Diversity order for each data stream: approximately M N + 1
(N M)
[3, 4, 6, 12]
y = Hx +n, H =
_
h
1
h
2
h
N
VBLAST receiver successive interference cancellation (SIC):

x
1
= w
T
1
y
x
1
= Q( x
1
) (quantization)
y
2
= y x
1
h
1
(interference cancellation)
x
2
= w
T
2
y
2
, etc.
The ith ZFnulling vector w
i
is dened as the unique minimumnorm
vector satisfying
w
T
i
h
j
=
_
0 j > i
1 j = i,
is orthogonal to the subspace spanned by the contributions to y
i
due
to the symbols not yet estimated and cancelled and is given by the ith
row of H
#
= (H
H)
1
H
(N M)
[13]
y = Hx +n, H =
_
h
1
h
2
h
N
VBLAST receiver
The SNR of x
i
is proportional to 1/w
i
2
Idea: detect the components x
i
in order of decreasing SNR =
ordered successive interference cancellation (OSIC)
initialization: G
1
= H
#
G
i
=
g
1
i
g
2
i
g
N
i
T
i = 1
y
1
= y
recursion: k
i
= arg min
j / {k
1
,...,k
i1
}
g
j
i
2
w
k
i
= g
k
i
i
e x
k
i
= w
T
k
i
y
i
x
k
i
= Q(e x
k
i
)
y
i+1
= y
i
x
k
i
h
k
i
G
i+1
= H
#
k
i
H
k
i
Hwith columns k
1
, , k
i
set to 0
i = i + 1
[13]
The VBLAST SIC receiver:
Provides a reasonable tradeo between complexity and performance
(between MMSE and ML receivers)
Achieves a diversity order of approximately M N + 1 per data
stream (N M)
The VBLAST OSIC receiver:
Provides a reasonable tradeo between complexity and performance
(between MMSE and ML receivers)
Achieves a diversity order which lies between M N + 1 and M for
each data stream (N M)
[3, 6]
Performance Comparison
diversity receiver
SIC
OSIC
M
[6]
Performance Comparison
[4]
DBLAST
[4, 14]
Linear Dispersion Codes
VBLAST
is unable to work with fewer receive than transmit antennas
doesnt have any builtin spatial coding
Spacetime codes do not perform well at high data rates
Linear dispersion codes
include VBLAST and the orthogonal design STBCs as special cases
can be used for any number of transmit and receive antennas
can be decoded with VBLAST like algorithms
satisfy an informationtheoretic optimality criterion
[4, 15]
A linear dispersion code of rate R =
k
p
b is one for which
X =
k
i=1
(c
i
C
i
+ c
i
D
i
), X =
_
_
x
1
x
2
.
.
.
x
p
_
_
where c
i
, . . . , c
k
belong to a constellation A with 2
b
symbols and
C
i
, D
i
C
pN
Number of transmit antennas: N
Number of receive antennas: M
[15]
If Y = XH
T
+N, it can be shown that: (H C
MN
; Y, N C
pM
)
_
_
y
1
.
.
.
y
M
_
_
. .
= H
_
_
c
1
.
.
.
c
k
_
_
. .
+
_
_
n
1
.
.
.
n
M
_
_
,
Y =
_
y
1
y
M
N =
_
n
1
n
M
where y
i
_
Re(y
i
)
Im(y
i
)
_
, n
i
_
Re(n
i
)
Im(n
i
)
_
, c
i
_
Re(c
i
)
Im(c
i
)
_
and
H C
2Mp2k
= f(H, C
1
, . . . C
k
, D
1
, . . . D
k
)
VBLAST like techniques can thus be used to decode linear
dispersion codes
{C
1
, . . . , C
k
, D
1
, . . . , D
k
} are dispersion matrices designed to optimize
given criteria (e.g. maximum mutual information between and )
[15]
Diversity vs. Multiplexing Tradeo
C = min{N, M} log SNR +O(1)
Denition: A scheme {C(SNR)} is a family of codes of block length
l, one for each SNR level. R(SNR) [b/symbol] denotes the rate of the
code C(SNR)
Denition: A scheme {C(SNR)} is said to achieve spatial
multiplexing gain r and diversity gain d if the data rate
lim
SNR
R(SNR)
log SNR
= r
and the average error probability
lim
SNR
log P
e
(SNR)
log SNR
= d (2)
[8]
For each r, d
(r) is the supremum of the diversity gains achieved

over all schemes
We also dene:
d
max
d
(0), the maximal diversity gain

r
max
sup{r|d
(r) > 0}, the maximal spatial multiplexing gain

Theorem: Assume l N + M 1. The optimal tradeo curve
d
(r) is given by the piecewiselinear function connecting the points

(k, d
(k)), k = 0, 1, . . . , min{N, M}, where

d
(k) = (N k)(M k).

In particular, d
max
= NM and r
max
= min{N, M}.
[8]
Diversity vs. Multiplexing: Optimal Tradeo
m N
n M
[8]
Diversity vs. Multiplexing Tradeo: VBLAST
n N = M
[8]
Diversity vs. Multiplexing Tradeo: Alamouti Scheme
m N
n M
[8]
Diversity vs. Multiplexing Tradeo: Alamouti Scheme
m N
n M
[8]
Denitions (1) and (2) for the diversity gain are not equivalent: in
the former one, a xed data rate is assumed for all SNRs, whereas in
the latter one, the data rate is a fraction of C(SNR), and hence
increases with the SNR
Denition (1) is the most widely used in the literature
Denition (2) allows to quantify the diversity vs. multiplexing
tradeo
[6, 8]
MIMO Channel Modeling
A good MIMO channel model must include:
Path loss
Shadowing
Doppler and delay spread proles
Ricean K factor distribution
Joint antenna correlation at transmit and receive ends
Channel matrix singular value distribution
[3]
Ricean K factor distribution
H = H
LOS
+H
NLOS
The higher the Ricean K factor, the more dominant H
LOS
(lineofsight)
H
LOS
is a timeinvariant, often low rank matrix = high K factor
channels often exhibit a low capacity
In a nearLOS link, the improvement in link budget often more than
compensates for the loss of MIMO capacity = usually, the LOS
component is not intentionally reduced
Experimental measurements show that, in general:
K increases with antenna height
K decreases with transmitterreceiver distance = MIMO
substantially increases throughput in areas far away from the base
station
[3]
Correlation Model for H
NLOS
Onering model
Base Station (BS) usually elevated and unobstructed by local scatterers
Subscriber Unit (SU) often surrounded by local scatterers assumed
here uniformly distributed in
TA
l
: lth transmitting antenna element : angle of arrival
RA
l
: lth receiving antenna element : angle spread
S() : scatterer located at angle
[16]
NLOS
Correlation from one BS antenna element to two SU antenna elements:
E[H
l,p
H
m,p
] J
0
_
2
d(l, m)
_
Correlation from two BS antenna elements to one SU antenna element
in the broadside direction ( = 0):
E[H
m,p
H
m,q
] J
0
_
d(p, q)
_
Correlation from two BS antenna elements to one SU antenna element
in the inline direction ( =

2
):
E[H
m,p
H
m,q
] e
j
2
d(p,q)
_
1
2
4
_
J
0
__
2
_
2
2
d(p, q)
_
distance between antennas l and m
distance between antennas p and q

[3, 16]
NLOS
J
0
(x)
The mobiles have to be in the broadside direction to obtain the highest
diversity
Interelement spacing has to be high to have low correlation =
beamforming and MIMO yield conicting criteria
Using the above results, one can obtain upper bounds for the MIMO
capacity
[3, 16]
Decoupling Between Rank and Correlation
Pinhole channel
Uncorrelated fading at both ends doesnt necessarily imply a
highrank channel
[3, 4]
MIMO Channel Modeling
Timevarying wideband MIMO channel:
H() =
L
i=1
H
i
(
i
)
where H() C
MN
and only H
1
contains a LOS component
Typical interelement spacing:
Base station: 10 (due to the absence of local scatterers)
Subscriber unit:
1
2
(rich scattering)
[3]
MIMOOFDM Systems
SISO OFDM Transmitter SISO OFDM Receiver
N K, l = OFDM symbol number N K
Net result: The frequency selective fading channel of bandwidth B is
decomposed into K parallel frequency-at fading channels, each
having bandwidth
B
K
. (Condition: The impulse response of the
channel is shorter than the length of the cyclic prex)
[6, 17]
MIMOOFDM Systems
OFDM can be extended to MIMO systems by performing the
IDFT/DFT and CP operations at each of the transmit and receive
antennas (with the appropriate condition on the length of the cyclic
prex)
Diversity systems: (Ex: Alamouti scheme)
Send c
1
and c
2
over OFDM tone i over antennas 1 and 2
Send c
2
and c
1
over OFDM tone i + 1 over antennas 1 and 2
within the same OFDM symbol
Alternative technique: Code on a pertone basis across OFDM
symbols in time
[6]
MIMOOFDM Systems
Spatial multiplexing: Maximize spatial rate (r = min{N, M}) by
transmitting independent data streams over dierent antennas =
spatial multiplexing over each tone
Spacefrequency coded MIMOOFDM
OFDM tones with spacing larger than the coherence bandwidth
B
C
experience independent fading
If D
e
=
B
B
C
, the total diversity gain that can be realized is of
NMD
e
[6]
Throughput in MIMO Cellular Systems
[1, 4]
Conclusions
MIMO channels oer multiplexing gain, diversity gain, array gain
and a cochannel interference cancellation gain
Careful balancing between those gains is required
MIMO systems oer a promising solution for future generation
wireless networks
Ongoing research
Spacetime coding (orthogonal designs, etc.)
Receiver design (ML receiver is too complex)
Channel modeling
Capacity of nonideal MIMO channels
. . .
[1, 4]
References
[1] H. Bolcskei, MIMO: what shall we do with all these degrees of freedom?, presentation, 2003, available at
http://www.tele.ntnu.no/projects/beats/seminar.htm.
[2] J. B. Andersen, Array gain and capacity for known random channels with multiple element arrays at both ends, IEEE J.
Select. Areas Commun., vol. 18, no. 11, pp. 21722178, Nov. 2000.
[3] D. Shiu P. J. Smith D. Gesbert, M. Sha and A. Nayguib, From theory to practice: An overview of MIMO spacetime
coded wireless systems, IEEE J. Select. Areas Commun., vol. 21, no. 3, pp. 281302, Apr. 2003.
[4] D. Gesbert, MIMO spacetime coded wireless systems, presentation, Sept. 2003, available at
http://www.tele.ntnu.no/projects/beats/course.htm.
[5] Z. Wang and G. B. Giannakis, A simple and general parametrization quantifying performance in fading channels, IEEE
Trans. Commun., vol. 51, no. 8, pp. 13891398, Aug. 2003.
[6] R. U. Nabar A. J. Paulraj, D. A. Gore and H. Bolcskei, An overview of MIMO communicationsa key to gigabit wireless,
Proceedings of the IEEE, vol. 92, no. 2, pp. 198218, Feb. 2004.
[7] E. Teletar, Capacity of multi-antenna Gaussian channels, Tech. Rep., AT&T Bell Laboratories, June 1995.
[8] D. N. C. Tse L. Zheng, Diversity and multiplexing: a fundamental tradeo in multiple antenna channels, IEEE Trans.
Inform. Theory, vol. 49, no. 5, pp. 10731096, May 2003.
[9] S. M. Alamouti, A simple transmit diversity technique for wireless communications, IEEE J. Select. Areas Commun., vol.
16, no. 8, pp. 14511458, Oct. 1998.
[10] H. Jafarkhani V. Tarokh and A. R. Calderbank, Spacetime block codes from orthogonal designs, IEEE Trans. Inform.
Theory, vol. 45, no. 5, pp. 14561467, July 1999.
[11] S. Sandhu and A. Paulraj, Spacetime block codes: a capacity perspective, IEEE Commun. Lett., vol. 4, no. 12, pp.
384386, Dec. 2000.
[12] H. Bolcskei and A. Paulraj, Multipleinput multipleoutput (MIMO) wireless systems, unpublished.
[13] R. A. Valenzuela G. D. Golden, C. J. Foschini and P. W. Wolniansky, Detection algorithm and initial laboratory results
using VBLAST spacetime communication architecture, Electronics Lett., vol. 35, no. 1, Jan. 1999.
[14] G. J. Foschini, Layered spacetime architecture for wireless communication in a fading environment using multielement
antennas, Bell-Labs Techn. J., pp. 4159, 1996.

[15] B. Hassibi and B. M. Hochwald, Highrate codes that are linear in space and time, IEEE Trans. Inform. Theory, vol. 48,
no. 7, pp. 18041824, July 2002.
[16] M. J. Gans D. Shiu, G. J. Foschini and J. M. Kahn, Fading correlation and its eect on the capacity of multielement
antenna systems, IEEE Trans. Commun., vol. 48, no. 3, pp. 502513, Mar. 2000.
[17] M. Sandell, Design and analysis of estimators for multicarrier modulation and ultrasonic imaging, Ph.D. thesis, Lulea
University, Sweden, 1996.

An Overview of MIMO Systems in Wireless Communications

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

An Overview of MIMO Systems in Wireless Communications

Uploaded by

Copyright:

Available Formats

An Overview of MIMO Systems in

and has dierential entropy

x] P, then so does x E[x]

Coding scheme (using a constellation A with 2

VBLAST receiver successive interference cancellation (SIC):

(r) is the supremum of the diversity gains achieved

(0), the maximal diversity gain

(r) > 0}, the maximal spatial multiplexing gain

(r) is given by the piecewiselinear function connecting the points

(k)), k = 0, 1, . . . , min{N, M}, where

(k) = (N k)(M k).

distance between antennas l and m

distance between antennas p and q

You might also like