Professional Documents
Culture Documents
Design of Adaptive MIMO Wireless
Design of Adaptive MIMO Wireless
Mabruk Gheryani
Supervisor: Dr. Yousef R. Shayan
August 1, 2007
Abstract
Design of Adaptive MIMO Wireless
Communication Systems
Mabruk Gheryani, PhD
Concordia University, 2007
Since the discovery of MIMO channel capacity, a lot of research works have
been done in this field. Space-time (ST) codes are the most promising technique for
MIMO systems. However, in most applications, the channel state information (CSI)
is assumed to be known to the receiver but unknown to the transmitter. To further
improve the system performance, the transmitter shall adapt the transmission rate
based on the level of CSI fed back from the receiver. Our overall goal in this study
is to develop adaptive MIMO schemes that can adapt the transmission rate based on
the level of CSI and meanwhile satisfy the given quality of service (QoS).
First, a tight upper bound of error probability at high signal-to-noise ratio
is derived for full-rate linear dispersion code and the bound is verified by simulation
results. The theoretical results demonstrate the relationship between the error probability, the constellation size and the space-time symbol rate, which will be a guideline
for adaptation.
Secondly over a Rayleigh fading channel, the probability density function of
signal-to-interference-noise ratio of a MIMO transceiver using full-rate linear dispersion code and linear minimum-mean-square-error receiver is derived. With these
i
theoretical results as a guideline, we study the design of adaptive systems with discrete selection modes. An adaptive algorithm for the selection-mode adaptation is
proposed. Based on the proposed algorithm, two adaptation techniques using constellation and space-time symbol rate are presented, respectively. To improve the
average transmission rate, a new adaptation design is developed, which is based on
joint constellation and space-time symbol rate adaptation. Simulation results and
theoretical analysis are provided to verify our new design.
As future work, new beamforming techniques and adaptation strategy will
be further investigated. Additionally, overall adaptation design for a concatenated
system will be studied.
ii
Contents
Abstract
List of Tables
List of Figures
vi
vii
Chapter 1 Introduction
1.1 Research Background . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.2 Literature Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.3 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.4
1
1
1
4
7
7
7
2.3
2.4
2.5
Performance Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . .
Simulation Results and Discussions . . . . . . . . . . . . . . . . . . .
Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
10
14
16
Chapter 3 New Adaptive MIMO System using full rate linear dispersion code with Selection Modes
17
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.2 Adaptive Transceiver . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.3
iii
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
18
18
26
27
3.4
33
39
3.5
Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
44
45
45
4.2
Remaining Works . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Bibliography
46
48
iv
List of Tables
3.1
32
3.2
3.3
38
41
4.1
47
List of Figures
2.1
2.2
14
3.1
3.2
3.3
3.4
3.5
3.6
Adaptive
Adaptive
Adaptive
Adaptive
Constellation
Constellation
Constellation
Constellation
3.7
3.8
3.9
3.10
Adaptive
Adaptive
Adaptive
Adaptive
ST
ST
ST
ST
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
28
29
30
31
BPSK . .
QPSK . .
8PSK . .
16QAM. .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
34
35
36
37
40
43
44
4.1
47
rate
rate
rate
rate
when
when
when
when
when
when
when
when
ST
ST
ST
ST
symbol
symbol
symbol
symbol
Constellation
Constellation
Constellation
Constellation
rate=1
rate=2
rate=3
rate=4
Size
Size
Size
Size
is
is
is
is
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
25
.
.
.
.
symbol
symbol
symbol
symbol
Size
Size
Size
Size
24
vi
vii
viii
Chapter 1
Introduction
1.1
Research Background
1.2
Literature Survey
After the discovery of capacity of MIMO systems, a lot of research efforts have been
put into this field[2][3]. To exploit the significant capacity and diversity, space-time
(ST) codes are the most promising technique for MIMO systems. In most applications, the channel state information (CSI) [7] is assumed to be known or can be
estimated at the receiver but unknown to the transmitter.
To combat channel quality variation and thus further improve system performance such as power efficiency, error rate and average data rate, adaptive transmission
can be applied. In this method, a feedback channel is utilized to provide CSI from the
receiver to the transmitter. According the feedback of CSI, the transmitter will adjust transmission parameters, such as power allocation, modulation, coding rate, etc.
This is conditioned by the fact that the channel keeps relatively constant before the
transmitter receives the CSI and then transmits next data block accordingly. That
is, the channel is slow. Adaptation algorithms can be classified into two categories:
One approach is designed with a power constraint to optimize the throughput while
maintaining a target bit error rate (BER); the other approach aims to optimize the
performances, i.e., BER, with a constant throughput. In our study, we focus on the
first category.
Historically, the potential of adaptation transmission was recognized by Cavers
[8], but probably due to hardware constraints, lack of accurate channel estimation and
unavailability of feedback, it received little interest at that time. Recently the advent
of high-speed devices and the capability of transceiver reconfiguration contribute to
a renewed interest in adaptive techniques [9][10].
The idea of adaptation transmission can also be applied in MIMO systems.
With a perfect CSI feedback [7], the original MIMO channel is converted to multiple
uncoupled single-input-single-output (SISO) channels via single value decomposition
(SVD). To optimize the system throughput, the so-called water-filling (WF) principle
is performed on the multiple SISO channels. Numerous schemes have been proposed
based on this optimal solutions. For example, over time-invariant MIMO channels,
it is known that the optimal performance (ergodic capacity) is attained by power
water-filling across channel eigenvalues with the total power constraint [2]. Also, for
time-varying MIMO channels, the optimal performance is obtained through power
water-filling over both space and time domains with the average power constraint [11].
The space-time WF-based scheme and the spatial WF-based scheme for MIMO fading
channels were compared in [12]. The comparison shows that for Rayleigh channels
without shadowing, space-time WF-based scheme gains little in capacity over spatial
WF-based scheme. However, for Rayleigh channels with shadowing, space-time WFbased scheme achieves higher spectral efficiency per antenna over spatial WF-based
scheme. A WF-based scheme using imperfect CSI in MIMO systems was studied in
2
[13]. In [14], a so-called QoS-based WF was proposed to solve the power allocation
problem for a given fixed bit error rate threshold. It is worthy of noting that at high
signal-to-noise ratio (SNR), WF-based schemes can not benefit any more [ref?].
In the WF-based scheme, the feedback bandwidth for the perfect CSI grows
with respect to the number of transmit and receive antennas and the performance
is very sensitive to the channel estimation errors. To overcome these disadvantages,
various beamforming techniques are also investigated intensively. In these schemes,
complex weights fed back from the receiver are applied to transmit antennas. For example, an optimal eigen-beamforming STBC scheme based on channel mean feedback
was proposed in[15]. A MIMO system based on transmit beamforming and adaptive
modulation was proposed in [16], where the transmit power, the signal constellation,
the beamforming direction, and the feedback strategy were considered jointly. The
analysis of MIMO beamforming systems with quantized CSI for uncorrelated Rayleigh
fading channels was provided in [17].
The above schemes often need near-perfect CSI feedback for adaptation calculation. In practice, feedback channel has narrow bandwidth, the feedback CSI is
often not prompt and the CSI estimation is not accurate. All these factors make the
CSI at the transmitter imperfect. In this case, adaptive schemes with selection modes
are often more preferable, which require only partial CSI at the transmitter.
For the MIMO communication system, the structures of most existing ST coding designs mainly fall into two categories, either trellis structure or linear structure.
ST codes with trellis structure, such as the space-time trellis codes (STTCs) [5] and
space-time turbo trellis codes (ST Turbo TCs) [18][19][20], can achieve full diversity
and large coding rate. However, their computational complexity grows exponentially
with respect to the number of states and transmit antennas, they are often designed
by hand and the trellis structure is not flexible for rate adaptation. ST codes with
linear structure can also be referred to as linear dispersion codes (LDCs), such as
STBC[6][21], Bell-labs layered space-time (BLAST) architectures [22][23][24][25][26].
The LDC allows a variety of decoders including simple linear techniques, higher data
rate and flexibility. However, the error performance of these high-rate LDCs is often
less satisfactory.
To achieve better performance, the idea of concatenated coding schemes is
often applied to MIMO communications recently. By combining two or more relatively
simple constituent codes, a concatenated coding scheme can achieve large coding gain
with a moderately complex decoding. Additionally, such a coding structure also allows
flexible and simple design. In MIMO communications, a ST code is concatenated with
3
a conventional outer code serially. Such a concatenated coding system often possesses
many advantages: On the one hand, the outer code can provide large coding gain
and time diversity; on the other hand, the inner space-time code provides guaranteed
spatial multiplexing and diversity [27]. Together, they enable a variety of design
targets in performance, bandwidth efficiency, complexity, and tradeoffs among them
[28]. Although any structure of ST codes can be a potential candidate for the inner
ST modulation, a particular desirable choice is linear dispersion codes (LDCs) instead
of ST codes with trellis structure. This is because the LDC is simple, flexible with
relatively low complexity.
For such a concatenated MIMO system [29], several discrete parameters are
available for adaptation, such as constellation size (i.e., bit-loading), active transmit
antennas and coding rate of the outer code. For example, adaptive modulation with
antenna selection combined with STBC was discussed in [30][31][32][33] [34]. The
advantage of this scheme using STBC is to simplify the design of an adaptive modulation system. However, this scheme is not flexible for different rates which is the
key requirement in the future wireless communications.
To achieve these requirements, LDCs are applied in our system. The ST symbol
rate of the LDC together with the other parameters can be adjusted for flexible rate
and throughput improvement.
1.3
Objectives
The overall goal of this study is to develop adaptive MIMO schemes that can improve
the average transmission rate according to the level of CSI and meanwhile satisfy the
given quality of service (QoS). To accomplish our goal, the following tasks will be
carried out.
1. Derive Upper Bound Of Linear Dispersion Code
In general, it is difficult to find the codeword error probability. However, the
pair-wise error probability (PEP) can be used in the codeword design. That is,
the Euclidean distance between the received signals associated with any pair of
codewords shall be maximized by minimizing the PEP between any pair of codewords. In this task, the upper bounds of error probability for high signal-to-noise
ratio (SNR) and low SNR are obtained, respectively. The bounds demonstrate
the relationship between error probability and, space-time symbol rate and the
constellation size. The relationship will be a guideline for adaptation. The task
4
1.4
Chapter 2
Performance Analysis of linear
dispersion codes
2.1
Introduction
The rich and mature knowledge on the conventional outer codes lets us focus on
the adaptive design of the inner ST modulator. Although any existing space-time
code can be a potential candidate for the inner space-time modulation, a particular desirable choice is linear dispersion codes (LDCs). This is because it subsumes
many existing block codes as its special cases, allows suboptimal linear receivers with
greatly reduced complexity, and provides flexible rate-versus-performance tradeoff
[24]. Hence, in our research, we focus on the LD space-time modulator in the adaptive MIMO transmission system. Below, we first introduce our system model and
then provide the performance analysis for the inner ST modulator. The analytical
results will provide design guideline for the adaptive system with selection modes.
2.2
System Model
In this study, a block fading channel model is assumed where the channel keeps constant in one modulation block but may change from block to block. That is, the
channel is not necessarily constant within a coding frame which often consists of a
large number of modulation blocks. Furthermore, the channel is assumed to be a
Rayleigh flat fading channel with Nt transmit and Nr receive antennas. Lets denote
the complex gain from transmit antenna n to receiver antenna m by hmn and collect
them to form an Nr Nt channel matrix H = [hmn ], known perfectly to the receiver
Binary
Info.
source
Binary
Info.
Out
Ant-1
1
Ant-1
M1
Nt
Constellation
Mapper
ML
Or
MMSE
S/P
1
Ant-Nr
Ant-Nt
ML
Nt
L /T
Feedback
Selection
Mode
De-Mapper
In this system, the information bits are first mapped into symbols. After that,
the symbol stream is parsed into blocks of length L. The symbol vector associated with one modulation block is denoted by x = [x1 , x2 , . . . , xL ]T with xi
{m |m = 0, 1, . . . , 2Q 1, Q 1}, i.e., a complex constellation of size 2Q , such as
2Q -QAM). The average symbol energy is assumed to be 1, i.e.,
1
2Q
2Q
1
P
m=0
|m |2 = 1.
L
X
M i xi +
i=1
L
X
Ni xi
(2.1)
i=1
Where Mi , Ni are the dispersion matrices for the i-th symbol. For simplicity, the
following model will be considered in this study, i.e.,
X=
L
X
M i xi
(2.2)
i=1
Y=
P
HX + Z =
Nt
L
P X
H
Mi xi + Z
Nt i=1
(2.3)
where Y is a complex matrix of size N r T whose (m, n)-th entry is the received
signal at receive antenna m and time instant n, Z is the additive white Gaussian
noise (AWGN) matrix with i.i.d. symmetrical complex Gaussian elements of zero
mean and variance z2 , and P is the average energy per channel use at each receive
antenna. It is often desirable to write the matrix input-output relationship in (2.3)
in an equivalent vector notation. Let vec() be the operator that forms a column
vector by stacking the columns of a matrix and define y = vec(Y), z = vec(Z), and
mi = vec(Mi ), then (2.3) can be rewritten as
s
y=
P
HGx + z =
Nt
P f
Hx + z
Nt
(2.4)
y=
2.3
L
P X
i xi + z
h
Nt i=1
(2.5)
Performance Analysis
After we define our system model as in (2.5). we will start to find the upper bound on
the probability of error. Basically, most of the LD codes have follow (2.5) with different design for modulation matrix.The average pairwise error probability conditioning
f is give by
on H
f = P (d < d
Pe (pairwise/H)
Ei
Ei+1 /si+1
sent)
(2.6)
where dEi is the Euclidean distance related to the signal vector si and equal to
s
SN R f
Hsi k
Nt
dEi =k x
(2.7)
We can start from [24] to find the upper bound. In [24]the average pairwise
error probability is obtained by choosing x as Gaussian in (2.5). Then, the error
result is averaged between an independent x and x by applying a union bound to
this average pairwise probability of error which yields an upper bound on probability
of error of a signal constellation.
fH
fH
Pe 2RT 1 E det I + H
f and
where E[ ]is the expectation over the channel matrix H
=
10
(2.8)
SN R
.
2Nt
Now,
f The modified H
f depends on H
we need to find the distribution of the modified H.
and G.In the Full Diversity Full Rate(FDFR) design [28][26], the entries of G should
satisfy GGH = INt T to preserve the channel capacity. So that, the entries of the
f is still CN(1, 0),
modified H
Note also that
h
fH
fH = det I +
fH H
f
det INr T + H
H
L
Lets define
fH
fH N T < L
H
r
W = fH f
H H N T L
r
(2.9)
and
n = max(Nr T, L), m = min(Nt T, L), L = min(Nt T, Nr T )
W is an m m random non-negative definite matrix and thus has real nonnegative eigenvalues.The distribution law of W is called the Wishart distribution
with parameters m and n. The unorder eigenvalues have the joint density function
[2] [36][37][38]
!
P (1 ....m ) = (m!Km,n )1 exp
nm
i
(i j )2
(2.10)
i<j
Pe 2
m Z
Y
i=1 ri =0
[1 + i ]1 f (i )di
(2.11)
where fi (i ) denotes the pdf of the ith nonzero eigenvalue of the W [2]. If we let
f () denote the PDF of any unordered i for i = 1, ....., m, then (2.11) leads to
Pe 2RT 1
Z
0
[1 + ]m f ()d
(2.12)
m
1 X
i ()2 nm exp()
m i=1
11
(2.13)
where
k+1 () =
k!
(k + n m)!
!1
2
Lknm ()
k = 0, ...m 1
where Lnm
() is the associated Laguere Polynomial of order k [39] defined as
k
() =
Lnm
k
k
X
(1)c
c=0
k+nm
kc
c
c!
X
1 m1
k!
[Lnm ()]2
m k=0 (k + n m)! k
(2.14)
k!
[Lnm ()]2 d
(k + n m)! k
(2.15)
Lets define
0
k!
(k + n )
K1(k) =
(k + n m)! 22k k!
K2(i) =
(2i)!(2k 2i)!
i![(k i)!]2 (k + n0 )
(2)d 2k + 2n 2m
K3(d) =
d!
2k d
(2.16)
(2.17)
Z
0
I = (
)m
(1 + )m exp()nm+d d
Z
0
(u + )m exp()nm+d d
12
(2.18)
where u = 1 . To compute the above integration,we make use of the result in [39].
Z
0
x (x + u) exp (x) dx
1
2
+
2
1
( + 1) exp
Wp,s 1
2u
I = (
)m (
) 2
exp
(d + n )Wp,s 1
(2.19)
where p = ( dn
) and s = ( d+n2m+1
)
2
2
Substituting (2.19) into (2.17) we have,
Pe 2RT 1 (
)m exp
2k
X
m1
X
K3(d)(d + n ) (
)
K1(k)
k
X
K2(i)
i=0
k=0
2mnd
2
Wp,s 1
(2.20)
d=0
The above upper bound probability of error does not show the diversity advantage which is the important measure of code performance. We instead examine
the performance at High SNR.
Then, (2.17) can be further upper bounded by
Pe
m1
X
k=0
K1(k)
k
X
K2(i)
i=0
2RT 1
(
)m
m
2k
X
K3(d)
d=0
Z
0
exp()n2m+d d
(2.21)
Z
0
exp()n2m+d d
I = (d + n 2m)
Substituting I into (2.21) we get the upper bound at high SNR
13
(2.22)
Pe Kk,i,d
where
Kk,i,d =
m1
X
k=0
2.4
K1(k)
k
X
2QL1
m
K2(i)
i=0
2k
X
SN R
2Nt
(2.23)
K3(d)(n 2m + d)
d=0
High SNR
with ML receiver
10
SIM BPSK
SIM QPSK
UP BOUND BPSK
UP BOUND QPSK
3
10
10
Pe
10
10
10
10
10
10
15
SNR(dB)
20
25
Figure 2.2: Simulation result and the associated upper bound at high SNR.
In Figure 2.2, the simulation results and the associated theoretical upper
bounds derived at high SNR are compared. As can be seen from the Figures, both upper bounds fit well with simulation results. The simulation results and the associated
theoretical bounds have the same slopes.
14
1 when k = j
trace(MH
M
)
=
j
k
0 otherwise
a5 a6
M2 =
a7 a8
a1 a2
M1 =
a3 a4
a13 a14
M4 =
a15 a16
a9 a10
M3 =
a11 a12
15
a2
G=
a3
a5 a9 a13
a6 a10 a14
a7 a11 a15
a4 a8 a12 a16
where a1 , a2 , . . . , a16 are constants , their values depend on the design of LDC. In our
design, if we choose
a1 = 1, a2 = 0, a3 = 0, a4 = 1, a5 = 1, a6 = 0, a7 = 0, a8 = 1
a9 = 0, a10 , 1, a11 = 1, a12 = 0, a13 = 0, a14 = 1, a15 = 1, a16 = 0
then
h
h11
11
h21
f = h21
H
h12 h12
h22 h22
h12
h22
h11
h21
h12
h22
h11
h21
g
H
g
the diagonal entries of H
L HL are equals to
PNt PNr
|hmn |2 which prove our design achieve full diversity.
n=1
m=1
As mentioned before, the error probability of an FDFR LDC is a function of ST
symbol rate and constellation size. With this fact, we can maximize the transmission
rate by adjusting the ST symbol rate and constellation size jointly while maintaining
2.5
Conclusions
In this chapter, our adaptive MIMO system model with linear dispersion code is
introduced. For full-rate linear dispersion code, a tight upper bound of the pair-wise
error probability at high signal-to-noise ratio is derived and verified by simulation
results. The theoretical results show the relationship between the error probability
and the constellation size and the space-time symbol rate. The relationship will
provide guidelines for adaptation.
16
Chapter 3
New Adaptive MIMO System
using full rate linear dispersion
code with Selection Modes
3.1
Introduction
For the reasons mentioned in Chapter 1, we study the adaptive system with discrete
selection modes in this chapter. With the upper bound of pair-wise error probability
obtained in the last chapter as a guideline, we design an adaptive MIMO system with
discrete selection modes. The associated MIMO transceiver uses an LDC as the ST
modulator and the minimum mean square error (MMSE) detector at the receiver for
simplicity. As mentioned before, different from existing adaptive systems, the new
design adds a new adaptive parameter referred to as ST symbol rate. As can be seen
from the following discussions, by adding this new parameter, the overall throughput
of the system is increased.
3.2
Adaptive Transceiver
In this section, we will introduce our adaptive MIMO transceiver, which uses a LDC
as the ST modulator and the MMSE receiver.
17
3.2.1
In our design example, the ST modulation is LDC with dispersion matrices given by
M(k1)Nt +i = diag[fk ]P(i1)
(3.1)
0
1
1(N
1)
t
P=
(3.2)
INt 1
0(Nt 1)1
where fk denotes the k-th column vector of F. F = [fmn ] is a Fast Fourier Transform
(FFT) matrix and fmn is calculated by
1
fmn = exp(2j(m 1)(n 1)/Nt )
Nt
3.2.2
(3.3)
y=
P
hi xi +
Nt
P X
hj xj + z
Nt j6=i
(3.4)
f denoted as h
i , will be referred to as the
In the sequel, the i-th column of H,
signature signal of symbol xi .
18
(3.5)
where zi is the noise term of zero mean. The corresponding wi can be found as
wi =
ih
H + RI
h
i
H
ih
H
h
h
i
i + RI
i
h
(3.6)
i
h
2
f H
fH
where RI = H
I I + z I. Note that the scaling factor
1
H (h
ih
H +RI )1 h
i
h
i
i
in the coef-
i2 = wiH RI wi
(3.7)
Substituting the coefficient vector for the MMSE estimator in (3.6) into (3.7), the
variance can be written as
1
i2 = H 1
(3.8)
i
hi R I h
Then, the SINR of MMSE associated with xi is 1/
i2 .
i =
P H 1
1
=
hi R I hi
Nt
i2
(3.9)
In our system model, all the symbols has the same SINR, i.e., 1 = 2 = .........L =
By using singular value decomposition (SVD), (3.9) can be written as
P H
i
=
hi U1 UH h
Nt
(3.10)
where UH is an Nt2 1Nt2 1 unitary matrix and the matrix is (Nt2 1)(Nt2 1)
with nonnegative numbers on the diagonal and zeros off the diagonal. Lets define
i
h0 = UH h
19
P
=
Nt
with
NX
r Nt
l=1
= 1 (
l + 1)
l
z2
l =
2
z
|h0 l |2
l
(3.11)
l = 1, ......., r L 1
l = r + 1, ........., Nr Nt
(3.12)
2
fH
f H
where = NPt 2 and r is the rank of H
I I which is less than Nt 1.
z
i [2]. For analytical
The vector h0 has the same statistics as the original vector h
il |2 . Now, we can write (3.11) as
purpose, we can replace |h0 l |2 by |h
r
X
i=1
NX
t Nr
il |2
|h
il |2
+
|h
(
l + 1)
r+1
(3.13)
The probability density function (PDF) of can be found using the moment
generating function (MGF) as follows [36]. First, we find the conditional (on the
eigenvalues) MGF of as
Nr Nt r
M/ (s) = [M (
s)]
r
Y
l=1
(
l + 1)
(3.14)
f H
fH
the fi (i ) denotes the PDF of the ith nonzero eigenvalue of the H
I I . If we let f ()
denote the PDF of any unordered i for i = 1, ....., m,, then (3.14) can be written as
"
Nr Nt r
M/ (s) = [M (
s)]
Further,
M/ (s) =
(
+ 1)
!#r
1
1
r
Nr Nt r
s
(1 s)
1 (1+
)
(3.15)
(3.16)
()Nr Nt 1 exp( )
(Nr Nt )
r
(1 + )1 F1 (Nr Nt r, Nr Nt , ) exp()
P/ () =
20
(3.17)
X
(a)n xn
n
(c)n n!
(
)Nr Nt
()Nr Nt 1 exp( )
(Nr Nt )
X
(Nr Nt r)n
n
(r)n
n n
(1 + )r exp()
n!
Now, we can find the probability density function (PDF) of as follows.
P () =
Z
0
P/ ()f () d
(3.18)
(3.19)
where
k+1 () =
k!
(k + Nr Nt r)!
(3.20)
!1
2
r Nt r
LN
()
k
k = 0, ...r 1
r Nt r
where LN
() is the associated Laguere Polynomial of order k [39]. Equation
k
(3.20) can be written as
f () =
X
1 r1
k!
[LNr Nt r ()]2
r k=0 (k + Nr Nt r)! k
Lets define
0
k!
(k + n )
K1(k) =
(k + Nr Nt r)! 22k k!
(2i)!(2k 2i)!
K2(i) =
i![(k i)!]2 (k + n0 )
21
(3.21)
(2)d 2k + 2Nr Nt 2r
K3(d) =
d!
2k d
0
(1 + )r Nr Nt r+d
1 F1 (Nr Nt
r, Nr Nt , ) exp()d
(3.22)
r vr v
(1 + )r = r
v
v=0
Then equation (3.22) can be written as
P () =
n K(n)
r
X
K r
K(v)K1(k)
v=0
r1
XZ
k=0 0
K2(i)
i=0
2k
X
K3(d)
d=0
Nr Nt r+d+v+n exp() d
with
K(n) =
and
k
X
(Nr Nt r)n
(r)n n!
r
K(v) = vr
v
The general form of the integration of (3.23) can be found in [39]
Z
0
x exp(x)dx = !1
where
= Nr Nt r + d + v + n
22
(3.23)
K r X
P () =
r
n
n K(n)
r
X
K(v)
v=0
2k
X
r1
X
K1(k)
k
X
K2(i)
i=0
k=0
(3.24)
d=0
Further,
P () =
d
r
X
k
2k
X
X
X
K r r r1
K1(k)
K2(i)
K3(d)
r Nr Nt +1 k=0
i=0
d=0
K(v) v
K(n)(Nr Nt r + d + v + n)!
(3.25)
v=0
Lets define
K(v, d) = (Nr Nt r + d + v)!
(Nr Nt r + d + v + 1)(d + v r + 1) `
K(v)
(d + v + 1)(Nr Nt + d + v + 1)
and
` = r
K(v)
v
Then (3.25) can be written as
k
X
X
K rNr Nt 1 r1
P () =
K1(k)
K2(i)
r
i=0
k=0
2k
X
K3(d) d
r
X
K(v, d)
(3.26)
v=0
d=0
This is the PDF of SINR for our system over Rayleigh fading channels.
We verify our derivation by simulation. In the simulation, Nt = Nr = T = 2
and Nt = Nr = T = 4 were assumed. In Figure 3.1 and Figure 3.2, the theoretical
PDFs of the SINR in (3.26) and results by Monte Carlo simulation were compared
for 2 2 and 4 4 channels, respectively at P/z2 = 20dB. Simulation results match
to the analytical result very well.
23
15
2
104
x 10
Monte Carlo Simulation
Theoretical PDF
10
10
20
30
40
50
60
70
80
90
Figure 3.1: Comparison between the theoretical PDF of SINR and Monte Carlo
Simulation when Nr = Nt = 2 at P/z2 = 20dB
24
2
104
x 10
Monte Carlo Simulation
Theoretical PDF
10
20
30
40
50
60
Figure 3.2: Comparison between the theoretical PDF of SINR and Monte Carlo
Simulation when Nr = Nt = 4 at P/z2 = 20dB
25
3.3
The general idea of adaptive technique with selection modes is to choose from a set of
available adaptive transmission rates. Based on some certain strategy, the transmitter
is informed with necessary information that will be used to increase or decrease the
transmission rate depending on the channel condition (i.e., CSI). For adaptive system
with the selection modes, the SNR will be considered as a proper metric. In this case,
the adaptive algorithm is proposed as follows.
1. Find the SNR at the receiver;
2. Find the BERs associated with the SNR for each mode for the BER curves
obtained from experiments.
3. Select a proper transmission mode with the maximum rate while maintaining
the given target BER.
We can describe the selection of transmission modes as follows.
opt = arg max(BERn () BERtarget )]
n
(3.27)
N
X
n=1
Rn
Z
n+1
n
p ()d
(3.29)
distribution given in the last section. Therefore, we will find the optimal SNR regions
by using simulation results.
In our simulations, we assume the same system model as Section 2.2 with
Nt = Nr = 4. First, we will start our adaptation using the constellation size while
each set has fixed ST symbol rate. Secondly, we will change the ST symbol rate
with fixed constellation size. Finally, we will adapt these two parameter jointly to
maximize the throughput while maintaining the target BER which is equal 103 in
our design example.
3.3.1
Although the system design for continuous-rate scenario provide intuitive and useful guidelines[16], the associated constellation mapper requires high implementation
complexity. In practice, using discrete constellation is preferable. That is, Q takes
only integer number Q = 1, 2, 3, ..... For a given adaptive system, we can adjust the
constellation size to maximize the transmission rate at the same time satisfying the
target BER. The above algorithm is applied to the case. Although any constellation
can be used, we only use BPSK (Q = 1), QPSK (Q = 2), 8PSK (Q = 3) and 16QAM
(Q = 4) as examples. Simulation results are shown in Figure 3.3 - Figure 3.6, where
each Figure has its own ST symbol rate.
27
10
8PSK1layer
QPSK1layer
BPSK1layer
16QAM1lyaer
10
BER
10
10
10
6
SNR(dB)
10
12
14
16
28
10
BPSK2layer
QPSK2layer
8PSK2layer
16QAM2layer
BER
10
10
10
10
8
10
SNR(dB)
12
14
16
18
29
20
10
BPSK3Layer
QPSK3layer
8PSK3layer
16QAM3layer
BER
10
10
10
10
10
15
20
25
SNR(dB)
30
30
10
BPSK4layer
QPSK4layer
8PSK4layer
16QAM4layer
BER
10
10
10
10
15
20
25
30
35
SNR(dB)
(3.30)
where Rm and Q are the ST symbol rate and the constellation size respectively, and
aRm ,Q and bRm ,Q are constant which can be found by curve-fitting technique. We
L
summarize our simulation results in Table 3.1. Note that, QT in Table 3.1 is the
minimum SNR for the given transmission mode.
31
Constellation size
BPSK
QPSK
8PSK
16QAM
Constellation size
BPSK
QPSK
8PSK
16QAM
Constellation size
BPSK
QPSK
8PSK
16QAM
Constellation size
BPSK
QPSK
8PSK
16QAM
ST symbol
1
1
1
1
ST symbol
2
2
2
2
ST symbol
3
3
3
3
ST symbol
4
4
4
4
rate
rate
rate
rate
32
QT
1
1 =-0.6309
21 =-0.1893
31 =3.384
41 =11.7479
2
Q
12 =0.8385
22 =1.4058
32 =5.3886
42 =15.4452
3
Q
13 =3.1014
23 =4.4833
33 =8.9696
43 =26.5898
4
Q
14 =8.1509
24 =14.2812
34 =24.2533
44 =30.8208
3.3.2
In other existing schemes, only the orthogonal designs, such as Alamouti scheme, are
applied as the ST modulation. In this case, the most convenient adaptive parameter
is the constellation size. For our adaptive scheme, the application of LDC makes
another adaptive parameter available, i.e., ST symbol rate. In this section, we fix the
constellation size but adjust the ST symbol rate for adaptation. Additionally, one
advantage of using ST symbol rate is that it is easier to change ST symbol rate than
constellation size for adaptation. The same algorithm can be applied to ST symbol
rate.
Note that, this system with 4 transmit antennas can have 16 choices of ST
symbol rates, i.e., ( 14 16
). For convenience and less complexity, we use 4
4
choices, i.e., TL = 1, 2, 3, 4. In the following context, the integer of TL is referred as
layer. The simulation results are shown in Figure 3.7 - Figure 3.10.
33
10
3Layer
4layer
1layer
2layer
10
BER
10
10
10
4
SNR(dB)
10
34
10
2layer
3layer
4layer
1layer
1
10
BER
10
10
10
10
10
8
10
SNR(dB)
12
14
16
18
20
35
10
1layer
2layer
3layer
4layer
BER
10
10
10
10
10
15
SNR(dB)
20
25
36
10
3layer
1lyaer
2layer
4layer
BER
10
10
10
10
10
15
20
25
30
35
SNR(dB)
37
Constellation size
BPSK
BPSK
BPSK
BPSK
Constellation size
QPSK
QPSK
QPSK
QPSK
Constellation size
8PSK
8PSK
8PSK
8PSK
Constellation size
16QAM
16QAM
16QAM
16QAM
ST symbol
1
2
3
4
ST symbol
1
2
3
4
ST symbol
1
2
3
4
ST symbol
1
2
3
4
rate
rate
rate
rate
38
QT
11 =-0.6309
12 =0.8385
13 =3.1014
14 =8.1509
2i
21 =-0.1893
22 =1.4058
23 =4.4833
24 =14.2812
3i
31 =3.384
32 =5.3886
33 =8.9696
34 =24.2533
4i
41 =11.7479
42 =15.4452
43 =26.5898
44 =30.8208
3.4
N
X
L
n ()(Qn , ( )n )
T
n=1
for
BERT arget
where (Qn , ( TL )n ) is the specific rate associated with a specific fading region and
where n () is the probability of n in the region <n . We will used the joint adaptation technique by choosing the best one from the available curves, which has the
maximum throughput. The simulation results are shown in Figure 3.11.
39
10
2bitQPSK1
2
10
BER
10
1bitBPSK1
16bit16QAM4
4
10
12bit8PSK4
4bitQPSK2
9bit8PSK3
10
6bitQPSK3
8bitQPSK4
8bit16QAM2
6bit8PSK2
6
10
10
15
SNR(dB)
20
25
30
35
40
We note from Figure 3.11 that we can reduce the gap between the selection
modes further by adding more choices of the transmission rates. We conclude the
L
result in Table 3.3, where QT is the minimum SNR for the given transmission mode.
Table 3.3: Joint Adaptation of ST symbol rate and constellation size
MODE
1
2
3
4
5
6
7
Constellation size
BPSK
QPSK
QPSK
QPSK
8PSK
8PSK
16QAM
ST symbol rate
1
1
2
3
3
4
4
QT
11 =-0.6309
12 =-0.1893
22 =1.4058
32 =4.4833
33 =8.9696
43 =24.2533
44 =30.8208
41
Proposition 1: The average data rate in the adaptive system with selection
modes can be improved by adding more possible selection modes providing higher
data rate than the corresponding original mode at the same SNR region.
Proof: Let us define the SNR regions of our adaptive system using one set of
selection modes as follows.
<1 1 < < 2
associated with R1
associated with R2
.
.
associated with Ri
as shown in Figure 3.12 a. If we add more possible selection modes, the SNR regions
will be changed as follows.
0
associated with R1
associated with R2
0
associated with Ri
X
i
Ri
Z i
2
1i
Pn ()d
The total average rate when for the scheme with more selection modes can be
written as
Z i
Z i
X
x
2
0
A = (Ri i n ()d + Ri
n ()d)
i
xi
It is obvious that
A > R
42
R1
1
R2
R3
Ri
R1
R2
1 x1x2xi 2
R3
Ri
43
20
18
16
14
12
10
0
5
10
15
20
SNR[dB]
25
30
35
40
Figure 3.13: Average spectral efficiency comparison for the three adaptive schemes.
3.5
Conclusions
Chapter 4
Conclusions and Remaining Works
In this chapter, we will conclude the proposal and present our remaining tasks with
their scheduled.
4.1
Conclusions
We have studied MIMO adaptive systems based on partial channel state information.
This proposal gives an introduction of MIMO adaptation with selection modes and
the research results will provide background for further research.
In the proposal, our adaptive MIMO system model with linear dispersion code
is introduced. A tight upper bound of the pair-wise error probability at high signalto-noise ratio is derived and verified by simulation results.
Statistics of signal-to-interference-noise ratio has been studied for the adaptive
system with full-rate linear dispersion code and linear minimum-mean-square-error
receiver. The associated probability density function of the signal-to-interferencenoise is derived, which will benefit the future study, such as error-rate probability.
With these theoretical results as guidelines, an adaptive algorithm for the
selection-mode adaptation is proposed. Based on the proposed algorithm, we have
introduced three novel adaptation techniques for the adaptive system with full-rate
linear dispersion code and linear minimum-mean-square-error receiver.
The first technique is an extension of commonly used adaptation technique for
SISO systems. We have identified the signal-to-noise ratio regions for which specific
constellations can be applied. This technique is called as adaptive constellation. The
second new technique for adaptation of full-rate linear dispersion code is promising.
The technique is called as adaptive space-time symbol rate. Finally, to further improve the average transmission rate, we introduced a novel adaptive procedure which
45
4.2
Remaining Works
Five tasks are identified as listed in Section 1.3. The first two tasked has been
accomplished and the related research results have been presented in Chapter 2 and
3.
In the first remaining task, we will study the beamforming technique. To perform beamforming, when perfect channel information is available at the transmitter,
one needs to perform singular value decomposition on the channel matrix H. This
is also called eigen-beamforming since it uses eigenvectors to find the linear beamformer that optimizes the performance. Inspired by existing beamforming schemes,
we will propose a new beamforming technique called minimum eigenvector beamforming or beamforming-nulling (BN). With this technique, the feedback bandwidth
for channel state information can be reduced and the loss of channel capacity as
compared to the optimal water-filling scheme can also be minimized.
46
ID
1.
2.
3.
4.
5.
The second remaining task is to propose the strategy for the new adaptive
system. The basic task of any adaptive strategy is how to inform channel state
information to the transmitter coordinating the receiver together and thus adapt to
the channel variations. Related to this issue, we will study different strategies that
can be used in adaptive MIMO wireless communication systems.
The third remaining task is to design the overall adaptation for a concatenated system. In this task, we will study the adaptation in concatenated MIMO
transmission systems. Instead of exhaustive error-rate simulation, the technique of
EXIT Chart will be used for joint adaptation between the coding rate, constellation
and ST symbol rate.
The remaining three tasks are scheduled in Table 4.1 and the associated Gantt
chart is also shown in Figure. 4.1.
2007
ID
2008
Task Name
Q1
Wrap-ups
Thesis Writing
Q2
Q3
Q4
Q1
Q2
Bibliography
[1] 3rd Generation Partnership Project Release 4, 3GPP Technical Report vol.4.0.0,
Mar.2003.
[2] I. E. Telatar, Capacity of multi-antenna Gaussian channels, Eur. Trans. Telecom., vol 10, pp. 585-595, Nov. 1999.
[3] G. J. Foschini, M. J. Gans, On limits of wireless communications in a fading
environment when using multiple antennas, Wireless Personal Communications,
vol. 6, no. 3, pp. 311-335, 1998.
[4] D. Gesbert, M. Shafi, D. S. Shiu, P. Smith and A. Naguib, From theory to
practice: An overview of MIMO space-time coded wireless systems, IEEE J.
Select. Areas Commun., Special Issue on MIMO Systems, pt. I, vol. 21, pp. 281302, Apr. 2003.
[5] V. Tarokh, N. Seshadri, and A. Calderbank, Space-time codes for high data rate
wireless communications: Performance criterion and code construction, IEEE
Trans. Inform. Theory, vol. 44, pp. 744-765, Mar. 1998.
[6] S. Alamouti, A simple transmitter diversity scheme for wireless communications, IEEE J. Select. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998.
[7] D. Gesbert, R. W. Heath,and S. Catreux,V. Erceg Adaptive Modulation and
MIMO Coding for Broadband Wireless Data Networks, in 2002 IEEE Communications Magazine vol. 40, pp. 108-115 , June 2002.
[8] JK. Cavers, Variable-rate transmission for Rayleigh fading channels, IEEE
Transactions on Communications, COM-20, pp.15-22, 1972.
[9] J. Mitola, The software radio architecture, IEEE Communication Magazine,
33(5), pp.26-38, 1995.
48
[10] L. Yang and L. Hanzo, Software-defined-radio-assisted adaptive boardband frequency hopping multicarrier DS-CMDA, IEEE Communication Magazine, 40(3),
pp.174-183, 2002.
[11] Z. Luo, H. Gao,and Y. Liu,J. Gao Capacity Limits of Time-Varying MIMO
Channels, IEEE International Conference On Communications vol.2, Mar.2003.
[12] Z. Shen, R. W. Heath, Jr., J. G. Andrews, and B. L. Evans, Comparison of
Space-Time Water-filling and Spatial Water-filling for MIMO Fading Channels,
in Proc. IEEE Int Global Communications Conf. vol. 1, pp. 431 435, Nov. 29-Dec.
3, 2004, Dallas, TX, USA.
[13] Z. Zhou and B. Vucetic Design of adaptive modulation using imperfect CSI in
MIMO systems, 2004 Eelectronics Letters vol. 40 no. 17, Aug. 2004.
[14] X. Zhang and B. Ottersten, Power allocation and bit loading for spatial multiplexing in MIMO systems, IEEE Int. Conf.on Acoustics, Speech, and Signal
Processing, 2003. Proceedings (ICASSP 03) vol.5 pp. 54-56, Apr. 2003.
[15] S. Zhou and G. B. Giannakis, Optimal Transmitter Eigen-Beamforming and
Space-Time Block Coding Based on Channel Mean Feedback IEEE Transactions
on Signal Processing, vol. 50, no. 10, October 2002.
[16] P. Xia,and G. B. Giannakis, Multiantenna Adaptive Modulation With Beamforming Based on Bandwidth- Constrained Feedback IEEE Transactions on
Communications, vol.53, no.3, March 2005.
[17] Bishwarup Mondal and Robert W. Heath, Jr., Performance Analysis of Quantized Beamforming MIMO Systems IEEE Transactions on Signal Processing ,
vol. 54, no. 12, Dec. 2006.
[18] Y. Liu and M. Fitz, space-time turbo codes, 13th Annual Allerton Conf. on
Commun. Control and Computing, Sep. 1999.
[19] D. Cui and A. M. Haimovich, Design and performance of turbo space-time
coded modulation, IEEE GLOBECOM00, vol. 3, pp1627-1631, Nov. 2000.
[20] D. Tujkovic, Recursive space-time trellis codes for turbo coded modulation,
Proc. of GlobeCom 2000, San Francisco.
49
[32] Guillem Femenias, SR ARQ for Adaptive Modulation Systems Combined With
Selection Transmit Diversity 2005 IEEE Transaction on Communications, vol.
53, no. 6, pp 998-1006, June 2005.
[33] Marie-Hlne Bourles-Hamon and Hesham El Gamal,On the design of adaptive
space-time codes 2004 IEEE Transaction on Communications, vol. 52, no. 10,
Oct. 2004.
[34] Andreas Mller, Joachim SpeidelAdaptive modulation for MIMO spatial multiplexing systems with zero-forcing receivers in semi-correlated Rayleigh fading
channels Proceeding of the 2006 international conference on Communications
and mobile computing pp. 665 - 670, 2006.
[35] Zhendong Zhou, B. Vucetic, M. Dohler, Yonghui Li MIMO systems with adaptive modulation IEEE Transactions on Vehicular Technology vol.54, pp.18281842, Sept. 2005.
[36] Robb J. Muirhead, Aspects Of Multivariate Statistical Theory, New York: John
Wiley and Sons Inc. 1982.
[37] T. W. Anderson, An Introduction to Multivariate Statistical Analysis,2th ed.
New York: John Wiley and Sons Inc. 1984.
[38] Anant M. Kshirsagar, Multivariate Analysis,Volume 2.
Dekker,Inc. 1972.
[39] I. S. Gradshteyn ,I. M. Ryzhik,A. Jeffrey,and D. Zwillinger, Table of Integrals,
Series, and Products,6th ed. San Diego, Calif. : Academic Press 2000.
[40] R. Lupas and S. Verdu, Linear multiuser detectors for synchronous code-division
multiple-access channels, IEEE Trans. inform. Theory, vol. 35, pp. 123-136, Jan.
1989.
[41] H. V. Poor and S. Verdu, Probability of error in MMSE multiuser detection,
IEEE Trans. inform. Theory, vol. 43, pp. 858-871, May 1997.
[42] G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture, Electron. Lett., vol. 35, pp. 14-16, Jan. 1999.
[43] S. Loyka , V-BLAST outage probability: analytical analysis, 2002 Proc. IEEE
Vehicular Technology Conference (VTC), vol.4 pp.1997-2001, Sept. 2002.
51
[44] R. Bhnke, Karl-Dirk Kammeyer, SINR Analysis for V-BLAST with Ordered
MMSE-SIC Detection, International Wireless Communications and Mobile Computing Conference, pp. 623 - 628, July 2006.
[45] Marvin K. Simon ,Mohamed-Slim Alouini, Digital Communication over Fading
Channels,2th ed. , Hoboken, New Jersey : Wiley and Sons, Inc. 2005.
[46] G. E. Roberts and H. Kaufman, Table Of Laplace Transforms,Volume 2.
Philadelphia: W. B. Saunders Company. 1966.
T. Rapaport, Wireless Communications: Principles and Practice, 2nd ed.
tice Hall, 2001.
[47] J. Proakis, Digital Communications, 4th ed.
Pren-
New York:
Wiley, 1991.
[49] B. Vucetic and J. Yuan, Space-Time Coding,
2003.
52