Niversité Unis EL Anar

UNIVERSIT TUNIS EL MANAR
Mmoire de Mastre Systmes de Communications

Prsent par: Imen SFAIHI
ETUDE DES CAPACITS DES MCANISMES
DORDONNANCEMENT MULTI-UTILISATEURS
POUR LES SYSTMES MIMO RADIO.
Soutenu le Mai 2006
e!ant le "ury compos de :
Prsident: Mr Ammar #$%A&&'(%'
)apporteur: Mr )id*a #$%A&&'(%'
'ncadreur: Mr +oureddine HAMI
Anne scolaire 200,-2006
UNIVERSIT TUNIS EL MANAR
Master t*esis o. communication systems
Presented /y: Imen SFAIHI
Super!ised /y: Mr +oureddine HAMI
ANALYSIS OF PACKET SCHEDULING
CAPACITIES FOR MIMO WIRELESS SYSTEMS
Anne scolaire 200,-2006
Ac0no1led2ments
First, I would sincerely like to thank my supervisor Mr. Noureddine HAMDI for the
outstanding support he has provided me with throughout all these year. His kindness, enthusiasm
and knowledge have greatly contriuted to the !uality this master thesis might possess. It has
een a real pleasure working with him. I would also like to thank my professor Mr Ammar
"#$A%%&'$& for all his help along the way.
I want to thank the &cole Nationale des Ing(nieurs de )unis, &NI), for opening their
doors to me, and for making all their resources availale so that my work could e developed
under the est conditions.
I am very thankful for the many friends who have een a source of constant
encouragement, support and help. *pecial thanks to Mr Naegh DH#$I", Ahlem )#$N*I,
)aycir "AH%#$%, Manel A"D&%H&DI and Mouna "#$+A,I for many stimulating
discussions and warm friendship.
Finally, I am grateful to my parents for their unconditional support and encouragement
throughout all my studies.
A/stract
Multiple input multiple output -MIM#. systems capture the interests of researchers
recently due to its potential to provide high data rate and diversity gain. In this master thesis, we
present a complete study of multi/user channel knowledge packet scheduling in multiple input
multiple output -MIM#. downlinks. )ransmit antennas of the node station are scheduled, in time
division fashion. )hese antennas are allocated during a time slot to one user or dynamically to
different users in spatial multiple0ing forms. )he system considered in this master thesis is a
MIM# downlink channel scheduling as presented in the last two models, where user receiver
uses 1ero/forcing for detection of spatial streams. 2e present an overview and a complete
throughput analysis of round roin, opportunistic and proportional fair scheduling. 2e
demonstrate that the proportional fair scheduling comines round roin and opportunistic
schedulers. Ne0t, we propose a new techni!ue that limits the numer of feed ack to reduce the
comple0ity of these schemes and apply this techni!ue to the opportunistic and to 3F* schemes.
*imulations have een carried out to compare schemes throughputs and to validate theoretical
results.
Index Ter!3MIM$4 pac0et sc*eduler4 multi-user4 5ero .orcin2 detectors4 reduced
.eed/ac06
)sum
%es syst4mes de transmission num(ri!ues 5 entr(es multiples et sorties multiples -MIM#.
sont de plus en plus (tudi(s du fait de leur tr4s onne efficacit( spectrale sur des canau0 riches en
diffuseurs, tels !ue ceu0 des communications moiles uraines sans fil. Dans ce mast4re, nous
pr(sentons une (tude compl4te des canau0 multi utilisateurs dans le sens descendant des syst4mes
5 entr(es multiples et sorties multiples -MIM#.. %es antennes de transmission sont allou(es tous
5 un seul utilisateur ou ien dynami!uement au0 diff(rents utilisateurs pendant une p(riode
d6(mission 7 time slot 8. Nous nommons la premi4re techni!ue 7 allocation totale 8 et la
deu0i4mes 7 allocation dynami!ue 8 %6allocation des ressources au0 utilisateurs se fait sous la
forme d6un multiple0age spatial.
Dans ce mast4re, nous (tudions les deu0 techni!ue de multiple0age en consid(rant le cas
d 9un r(cepteur de type for:age 5 1(ro -;F < ;ero Forcing.. Nous analysons la capacit( de
!uel!ues m(canismes d6ordonnancement -*cheduling. de < round roin scheduling -,,*.,
opportunistic scheduler -#*. et proportional fair scheduling -3F*.. Nous proposons une nouvelle
techni!ue !ui r(duit la signalisation de retour vers la station de ase. =eci permet de r(duire la
comple0it( de ces schedulers. Nous appli!uons cette techni!ue 5 l6#* et au 3F*. %es simulations
ont (t( r(alis(es pour valider des r(sultats th(ori!ues relatifs au0 capacit(s des diff(rents
schedulers.
M"#! $%&!3MIM#, scheduling, pa!uet de donn(es, multiple0age spatial, multi utilisateur,
d(tecteur for:age 5 1(ro, r(duction de signalisation, information partielle des canau0.
Contents
INTRODUCTION''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(
C)*+#er(, In#r"d-$#."n /"r W.re%e!! MIMO P*$0e# Tr*n!.!!."n S1!#e!''''''''''''''''2
(. In#r"d-$#."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''2
3. T)e d.//eren# *n#enn* $"n/.4-r*#."n! .n 5.re%e!! '''''''''''''''''''''''''''''''''''2
2. Ex+%".#.n4 -%#.+%e *n#enn*! .n 5.re%e!!'''''''''''''''''''''''''''''''''''''''''6
7. T)e 5.re%e!! C)*nne%''''''''''''''''''''''''''''''''''''''''''''''''''''''''''8
6. D.9er!.#1 '''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''':
8. T)e !.4n*% #" .n#er/eren$e-+%-!-n".!e r*#." ;SINR<''''''''''''''''''''''''''''''''''=
>. C)*nne% C*+*$.#1''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(?
:. S+*$e #.e re$e.9er!''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(2
=. C"n$%-!."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(=
C)*+#er3, An*%1!.! "/ S$)ed-%.n4 T)r"-4)+-# -!.n4 @F De#e$#"r!'''''''''''''''''''''3?
(. In#r"d-$#."n''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''3?
3. A!!-+#."n! *nd S1!#e M"de%''''''''''''''''''''''''''''''''''''''''''''''''3?
2. S#*#.!#.$! "/ SINR .n #)e $*!e "/ @F de#e$#"r!'''''''''''''''''''''''''''''''''''''33
7. S$)ed-%er! #)r"-4)+-#!''''''''''''''''''''''''''''''''''''''''''''''''''''''38
6. C"n$%-!."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''26
C)*+#er2, An*%1!.! "/ P*$0e# S$)ed-%.n4 .n D1n*.$ SM MIMO''''''''''''''''''''''28
(. In#r"d-$#."n''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''28
3. S$)ed-%er! #)r"-4)+-#!'''''''''''''''''''''''''''''''''''''''''''''''''''''''28
2. T)e red-$ed /eedA*$0 #e$)n.B-e''''''''''''''''''''''''''''''''''''''''''''''''7=
7. C"n$%-!."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''63
C"n$%-!."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''62
Re/eren$e!'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''67
P-A%.$*#."n'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''68
A++end.x''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''6>
&ist o. Fi2ures
F.4-re (, M-%#.-+*#) +r"+*4*#."n "/ * #r*n!.##ed !.4n*%.''''''''''''''''''''''''''''''>
F.4-re 3, Ce%%-%*r !1!#e 5.#) -%#.+%e #r*n!.#! *nd re$e.9e! *n#enn*!.'''''''''''''''''3(
F.4-re 2, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n #)e RRS #)r"-4)+-#''''''''3:
F.4-re 7, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SINR 9*%-e .n #)e RRS #)r"-4)+-#''''''''3=
F.4-re 6, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n #)e OS #)r"-4)+-#.'''''''''2(
F.4-re 8, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SNR 9*%-e .n #)e OS #)r"-4)+-#.''''''''''2(
F.4-re >, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n PFS #)r"-4)+-#.'''''''''''22
F.4-re :, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SNR 9*%-e .n PFS #)r"-4)+-#.''''''''''''27
F.4-re =, RRSC OS *nd PFS #)r"-4)+-# 5.#) M#DMrD3E #$D6??''''''''''''''''''''''''26
F.4-re (?, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n RRS #)r"-4)+-#.''''''''''2:
F.4-re ((, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SNR 9*%-e .n RRS #)r"-4)+-#'''''''''''2=
F.4-re (3, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n OS #)r"-4)+-#.'''''''''''72
F.4-re (2, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SNR 9*%-e .n OS #)r"-4)+-#'''''''''''''77
F.4-re (7, E//e$# "/ #)e 9*r.*#."n "/ #)e n-Aer "/ *n#enn*! .n PFS #)r"-4)+-#'''''''''''7:
F.4-re (6, E//e$# "/ #)e 9*r.*#."n "/ #)e *9er*4e SNR 9*%-e .n PFS #)r"-4)+-#'''''''''''7:
F.4-re (8, RF-OPP !.-%*#."n 5.#) M# D 7E #$ D 6??'''''''''''''''''''''''''''''''''6?
F.4-re (>, RF-PFS !$)ee !.-%*#."n 5.#) M# D 7E #$ D 6??'''''''''''''''''''''''''''6(
&ist o. A//re!iations and Acronyms
"ps "its per second.
=DF =umulative Distriution Function
=*I =hannel *tate Information.
DF Decision/Feedack.
FF Flat Fading
F*F Fre!uency/*elective Fading
'*M 'loal *ystem for Moile communications
H,3D High ,ate 3acket Data
H*D3A High *peed Downlink 3acket Access
H1 Hert1
IAI Inter/Antenna Interference
I= Interference =ancellation
I.I.D. Independent and Identically Distriuted.
I*I Inter/*ymol Interference
%#* %ine/#f/*ight
MAI Multiple Access Interference
M% Ma0imum %ikelihood
MF Matched Filter
MIM# Multiple/Input,Multiple/#utput
MI*# Multiple/Input *ingle/#utput.
MM*& Minimum Mean *!uared &rror
M*I Multistream Interference
#*I= #rdered *uccessive Interference =anceller
3DF 3roaility Density Function
3F 3roportional Fair
,, ,ound ,oin
*D *patial Diversity
*I= *uccessive Interference =ancellation
*IM# *ingle/Input Multiple/#utput
*I*# *ingle/Input *ingle/#utput
*M *patial Multiple0ing
*IN, *ignal/to/Interference/plus Noise ,atio
*N, *ignal to Noise ,atio
*) *pace/)ime
*>D *ingular >alue Decomposition
)DMA )ime Division Multiple Access
>/"%A*) >ertical "ell %as architecture for space/time codes.
;F ;ero/Forcing
&ist o. Important Sym/ols
%inear convolution
( )
T
. Matri0 or vector transpose
( )
?
.

=omple0 con@ugate
( )
H
. Matri0 or vector con@ugates transpose
( )
A
. Matri0 Moore/3enrose pseudo/inverse
[ ]
m
. m/th entry of a vector
[ ]
n m,
.
(m,n)/th entry of a matri0
x
Asolute value -modulus. of the scalar x
x
A norm of a vector x
B
x
B/norm of a vector x
p-yCs. 3roaility density function of y condition on s
( ) . det
Determinant of a matri0
{} . E
&0pectation of random variales
log
B
%ogarithm function with ase B
H =hannel matri0
I
r
r r
identity matri0
M
t
Numer of transmit antennas
M
r
Numer of receive antennas
t
c
)he numer of time slots for each lock
P
t
Transmit power allocation.
W
ZF
1ero/forcing e!uali1er
n
D
t
M
noise vector
y ,eceived signal vector
sE D
t
M
received e!uali1ed signal vector
s )ransmitted signal vector
i
*IN, associated with i
th
transmitted symol
Average signal to noise ratio at each receiver antenna

C =hannel capacity
CN(m,n) =ircularly symmetric comple0 'aussian distriution with mean vector mand
covariance matri0 n
(sF y. mutual information etween transmitted and received signals
I+7)$%C7I$+
It is known that MIM# antennas systems enhance the capacity of wireless packet
communication systems GDH GBH GIH GJH. In these systems, the allocation of transmit antennas to
users can e in different ways. )hese antennas can e used in spatial diversity -*D. GDH or in
spatial multiple0ing -*M. GKH GLH GMH schemes. )he receiver of each user estimates the channel
sate information -=*I. measured as the post detection signal to interference plus noise ratio
-*IN,. GNH. Detectors that can e studied in this work can e 1ero/forcing -;F. GOH GDPH or
minimum mean s!uare error -MM*&. GDDH or others. 2e develop in this study the system
throughputs if ;F is employed, and analytic solutions can e e0tended to system with other
detectors.
&ach user feeds ack to the node station the =*I estimates on an uplink channel. 2ith the
*D schemes, the same data stream is repeatedly sent through all the transmit antennas. )his
scheme would transform the transmitting medium to a rich fading environment. )he *M schemes
enhance the system throughput y multiple0ing data streams on the transmit antennas. )herefore
the downlink capacity would e enhanced compared to the *D.
)he scheduler can assign -i. all M
t
transmit antennas to one user or -ii. each transmit
antenna to different users at each time slot. )he last model allocates each antenna dynamically to
usersF hence the system resources are shared etween users at each time slot. )he schedulers in
these schemes would ma0imi1e system capacity y allocating transmit antennas to users that
e0periences peak level *IN, on that antenna using one of these two models. )he use of
schedulers as round roin -,,., opportunistic and proportional fair scheduling -3F*. depends on
how the designer considers system rate ma0imi1ing, fairness among users or a trade/off etween
the two goals GDBH GDIH GDJH GDKH. )he optimality of these schedulers comes from the e0pense of a
full channel state information -=*I. reporting which leads to a large feedack urden. )o
*ys=om/&NI) BPPL
D
Introduction
solve this issue, we propose a reduced comple0ity scheme, where each moile user sorts the
-*IN,. of all transmit antennas -M
t
. and sends ack to the node station the K highest channel6s
*IN, -K Q M
t
.. In this master thesis, we investigate the effective capacity using these different
schedulers relative to the downlink channel of a single cell MIM# system.
2e now riefly descrie the outline of this master thesis.
In =hapter D, we descrie the different notions of digital communications necessary to the
understanding of our topic research.
In chapter B, we investigate the different schedulers when all M
t
transmit antennas are
assigned to one user at each time slot. Here, we present the system model used in this work. 2e
develop the post detection *IN, e0pression using the ;F receiver in *M system. 2e also
descrie the different schedulers and give their analytical capacity. )hrough simulation results,
we present the performance of these schedulers in terms of system throughput. Furthermore, we
give some comparison etween these schedulers.
In =hapter I, we investigate the different schedulers when transmit antennas are allocated
dynamically to different users at each time slot. Here, we descrie the different schedulers and
give the capacity in the analytical form. )hrough simulation results, we validate the performance
of these schedulers in terms of system throughput using the theoretical results. In this case study,
we have a full uplink feed ack then we have the optimal case. )o solve this issue, we propose a
reduced comple0ity scheme, where each moile user sorts the -*IN,. of all transmit antennas
-M
t
. and sends ack to the node station the K highest channel6s *IN, -K Q M
t
.. )herefore, we
investigate the techni!ue of reduced feedack for the opportunistic and the 3F* schedulers and
validate their simulations.
Finally, we conclude our work and outline proposals for future work.
*ys=om/&NI) BPPL
B
CHAP7')8: I+7)$%C7I$+ F$)
9I)'&'SS MIM$ PAC:'7
7)A+SMISSI$+ S;S7'MS
=hapterD< Introduction for MIM# 3acket )ransmission *ystems
1. Introduction
)his introductive chapter recalls the different notions of digital communications necessary
to the understanding of our topic research.
In this chapter, we start y presenting the different wireless configurations as the *I*#,
*IM#, MI*#, MIM#, MIM#/M$ configurations GDLH in section II. After indicating these
configurations riefly, the different gains of e0ploiting multiple antennas of which we present the
array gain, the diversity gain, the multiple0ing gain and the interference reduction are introduced
in section III. In section I>, we deal with the characteristics of wireless channels such as
attenuation, multi/path, the Doppler &ffect and fading. )he definition of diversity as well as its
different techni!ues is elaorated in section >. )he signal to interference/plus/noise ratio -*IN,.
is defined in section >I. Information theoretic terms such as entropy, mutual information and
capacity are elaorated in section >II followed y a calculation of the theoretical capacity of the
MIM# channel. *ome space time receivers are given in section >III. Finally, conclusion is drawn
in section IR.
2. The different antenna configurations in wireless
2.1 The SISO configuration
*I*# -single input single output. is the familiar wireless configuration. 2e have in the
*I*# configuration one transmitted antenna and one received antenna.
%et h -, t. e the time varying channel impulse response etween transmit and receive antenna.
If we have s -t. the transmit signal then the receive signal y -t. is e0pressed as follows

.. - . , - . - t s t h t y
-D.D.
2here < denotes the convolution operator.
2.2 The SIMO configuration
In the *IM# -single input multiple output. configuration, we have one transmit antenna
and M
r
receive antennas. )he *IM# configuration can e decomposed in M
r
*I*# configuration.
*ys=om/&NI) BPPL
I
%et h
i
-, t. e the impulse response etween the transmit antenna and the i
th
-i=, !, M
r
. receive
antenna.
If we have s -t. the transmit signal then the receive signal y
i
-t. is e0pressed as follows
.. - . , - . - t s t h t y
i i

-D.B.
2.3 The MISO configuration
In the MI*# -multiple input single outputs. configuration, we have M
t
transmit antennas
and one receive antenna.
%et h
"
-, t. e the impulse response etween the "
th
-"=, !, M
t
. transmit antenna and the receive
antenna.
If we have s
"
-t. the transmit signal then the receive signal y -t. is e0pressed as follows
.. - . , - . -
D
t s t h t y
" "
M
"
t

-D.I.
2.4 The MIMO configuration
In the MM*# -multiple input multiple output. configuration, we have M
t
transmit
antennas and M
r#
receive antennas.
%et h
i, "
-, t. e the impulse response etween the "
th
-"=, !, M
t
. transmit antenna and the i
th
-i=,
!, M
r.
. receive antenna.
If we have s
"
-t. the transmit signal then the receive signal y
i
-t. is e0pressed as follows
. . - . , - . -
D
,

T
M
"
" " i i
t s t h t y
-D.J.
2.5 The MIMO-MU configuration
)he MIM#/M$ -MIM# multi/user. configuration refers to the case where a ase station
with multiple -M
t
. antennas communicates with N users each with one or more antennas.
*ys=om/&NI) BPPL
J
3. Exploiting multiple antennas in wireless
3.1 Array gain
Array or "eamforming gain refers to the average increase in the signal to noise ratio *N,
at the receiver that arises from the coherent comining effect of multiple antennas at the receiver
or transmitter or oth. =onsider, as an e0ample, a *IM# channel. *ignals arriving at the receiver
antennas have different amplitudes and phases. )he receiver can comine the signals coherently
so that the resultant signal is enhanced. )he average increase in signal power at the receiver is
proportional to the numer of receive antennas. In channel with multiple antennas at the
transmitter -MI*# or MIM# channels., array gain e0ploitation re!uires channel knowledge at the
transmitter GDLH GNH.
3.2 Diversity gain
*ignal power in a wireless channel fluctuates -or fades.. 2hen the signal power drops
significantly, the channel is said to e in a fade. Diversity is used in wireless to comat fading.
,eceive antenna diversity can e used in *IM# channels. )he receive antennas see independently
faded versions of the same signal. )he receiver comines these signals so that the resultant signal
e0hiits consideraly reduced amplitude variaility -fading. in comparison with the signal at any
one antenna.
Diversity is characteri1ed y the numer of independently fading ranches, also known as the
diversity order and is e!ual to the numer of receiving antennas in *IM# channels.
)ransmit diversity is applicale to MI*# channels and has ecome an active area for research.
&0tracting diversity in such channels is possile with or without channels knowledge at the
transmitter. *uitale design of the transmitted signal is re!uired to e0tract diversity. *pace time
diversity coding is a transmit diversity techni!ue that relies on coding across space to e0tract
diversity in the asence of channel knowledge at the transmitter. If the channels of all transmit
antennas to the receive antenna have independent fades, the diversity order of this channel is
e!ual to the numer of transmit antennas.
$tili1ation of diversity in MIM# channels re!uires a comination of receive and transmit
diversity descrie aove. )he diversity order is e!ual to the product of the numer of transmit and
*ys=om/&NI) BPPL
K
receive antennas, if the channel etween each transmit/receive antenna pair fades independently
GDLH GNH.
3.3 Satia! "u!ti!e#ing $SM%
*patial multiple0ing offers a linear increase in the transmission rate for the same
andwidth and with no additional power e0penditure. *patial multiple0ing is only possile in
MIM# channels.
)he principle of spatial multiple0ing is in itself fairly simple. =onsider a high/rate it/ stream and
divide it into a numer of independent streamsF transmit each of these su/streams over a
different antenna. )he data are mi0ed in the air y the channel. )he receiver estimates the
channel and precedes to unmi0ed the data, therey recreating the original high/rate it/stream.
*patial multiple0ing can also e applied in a multi/user format -MIM#/M$.. GDMH
3.4 Interference re&uction
=o/channel interference arises due to fre!uency reuse in wireless channels. 2hen
multiple antennas are used, the differentiation etween the spatial signatures of the desired signal
and co/channel signals can e e0ploited to reduce the interference. Interference reduction re!uires
knowledge of the interferer6s channel may not e necessary.
Interference reduction can also e implemented at the transmitter, where the goal is to minimi1e
the interference energy sent towards the co/channel users while delivering the signal to the desire
user. Interference reduction allows the use of aggressive reuse factors and improves network
capacity. GDLH
4. The wireless Channel
During transmission, electromagnetic waves encounter a numer of ostacles. Depending
on the geometric dimensions and the electromagnetic properties of these ostacles, waves can e
scattered, diffused, diffracted or asored see figure D.
For our purposes, it is important to know that the signal reaches its destination through a numer
of different paths, each affected y propagation loss, slow fading, and fast fading. GDNH
*ys=om/&NI) BPPL
L
Figure D< Multi/path propagation of a transmitted signal.
3ropagation loss -or path loss. is due to free space propagation, or asorption and reflection,
e.g., y foliage, water or ground.
*low fading -or shadowing. is due to the locking effect of uildings or natural o@ects. )he
effect is a multiplicative component usually modeled y a random variale with distriution that
depends on antenna height, operating fre!uency and type of the environment.
)he rapid fluctuations of the received signal are usually referred to as fast fading. )hey are
due to the scattering of the signal off of o@ects near the receiver. Fast fading is also called time
selective fading, due to the amplitude variations of the received signal in time.
)he rate of variaility of the channel is measured y the coherence time, i.e., the ma0imum
time separation etween channel impulses responses that can e considered correlated. )he
coherence time can e interpreted as the facing6s time constant.
)he inverse of the coherence time is the Doppler spread, which measures the degree of time/
selectivity in the fre!uency domain. A slowly changing channel has a large coherence time or,
e!uivalently, a small Doppler spread.
*ys=om/&NI) BPPL
M
)he spread of path delays in a multi/path fading environment is referred to as delay spread.
)his is the range of delay values over which the delay power spectrum of the channel is non1ero.
)he delay power spectrum is the autocorrelation function of the e!uivalent low pass impulse
response of the channel, evaluated at a same time instant for impulses applied at different delays
in the past. )he delay spread causes fre!uency/selectivity, which is measured y the so/called
coherence andwidth -the inverse of the delay spread., i.e., the ma0imum separation of correlated
fre!uency components of the channel transfer function.
It also makes sense to define an angle spread, i.e., the spread of angles of arrival or departure of
the multiple paths. Angle spread causes space/selective fading and is inversely proportional to the
coherence distance.
5. Diersit!
In a scattering environment the individual signal path arriving at the receiver faces
independent or highly uncorrelated fading. )his means that when a particular signal path is in a
fade there may e another signal path not in any fade. )he receiver can e0ploit this fact y
receiving more than one path and choosing andCor comining them. 2idely used schemes to do
this are< selection diversity where the path with the est average signal to noise ratio -*N,. is
chosen, e!ual gain comining where the different paths are co phased and added together and
minimum mean s!uare error -MM*&. comining where the different paths are weighted and then
added -weighting coefficients are chosen during a training phase.. ,eceiver diversity can improve
the average *N, -signal to noise ratio. y BPd" to IPd".
In practice, diversity techni!ues can e applied in the space, polari1ation, fre!uency or
time domains. GDNH GDOH GBPH GBDH
5.1 Sace Diversity
Also known as antenna diversity, space diversity uses more than one antenna at the
receiver. )he signals received on antennas separated y a half wavelength or more tend to e
decorrelated. )his is ecause in a rich scattering environment the chance of a line of sight path is
low, and most paths are reflected or diffracted from ostacles. $sually antenna diversity is used
*ys=om/&NI) BPPL
N
only at the radio ase station ecause multiple antennas on the terminal unit pose a design
challenge and do not @ustify the cost.
5.2 'o!ari(ation Diversity
&lectromagnetic waves have vertical and hori1ontal polari1ations that also show
decorrelation. 2here the re!uired antenna spacing for space diversity is not feasile, polari1ation
diversity is used as an alternative as the same antenna can e used for different polari1ations.
However, it is not possile to have more than B/way polari1ation diversity.
5.3 )re*uency Diversity
Fre!uencies separated y more than the coherence andwidth of the channel suffer
independent fades. Fre!uency diversity takes advantage of this fact y transmitting at more than
one carrier fre!uency. )he '*M standard uses fre!uency hopping to achieve fre!uency diversity.
5.4 Ti"e Diversity
In time diversity the same information symol is repeatedly transmitted at different time
slots with the hope that they will suffer independent fading and the receiver will comine them
properly. 2hile highly effective in fast fading environments, time diversity is not as effective in
slow fading channels unless a large decoding delay can e tolerated. A coding structure known as
interleaving is often used to reali1e time diversity where the receiver knows the code efore any
transmission takes place.
". The signal to interference#plus#noise ratio $%I&'(
)he signal to interference/plus/noise ratio -*IN,. corresponding to the received signal
n x H y +
is defined as the ratio etween the desired component and the undesired component
-assuming normali1ed symols
{ } D
B
x E
and { }
B
B
n E
n
.F
B
B
n
H
$IN%
-D.K.
And is ounded y P & *IN, & '. )he upper ound cannot e achieved unless the channel is
noiseless and, similarly, the lower ound cannot e achieved unless the signal component is 1ero
*ys=om/&NI) BPPL
O
which is never the case unless the transmitter stops the transmission. A closely related measure is
the
P
N
E
(
defined as the *IN, per it -assuming that N
P
includes all the interfering signals. GNH.
). Channel Capacit!
+.1 ,ntroy an& Mutua! Infor"ation
)he entropy of a discrete random variale ) is defined as GBDH

n
"
" "
p p ) H
D
B
. - log . -
-D.L.
2here p
"
is the proaility that ) = ". &ntropy measures the uncertainty of a random variale, and
so, it is an indication of the information contained in that variale. GBDH.
"ased on the @oint proaility, the @oint entropy of two random variales ), * is defined to e

n
"
m
+
"+ "+
p p * ) H
D D
B
. - log . , -
-D.M.
2here p
"+
is the @oint proaility that ) = " and * = +. If ) and * are dependent and p
"
-+. denotes
the conditional proaility that * = + given ) = ", then the conditional entropy of * given ),
denoted y H-* ,). is defined as

n
"
m
+
" "+
+ p p * ) H
D D
B
.. - - log . -
-D.N.
)he mutual information of two random variales, ) and *, denoted as I-)- *. is given y
. - . - . F - ) * H * H * ) I
-D.O.
For any two random variales ) and *, I-)- *. S I-*- ).. Also I-)- *. S . when ) and * are
independent.
+.2 -hanne! -aacity
*hannon GBBH defines the capacity of a channel as the ma0imum data rate at which data
transmitted from a transmitter, when passed through the channel, can e received at some
receiver with negligile chance of error. If the data source and received data are viewed as
random variales, then the channel capacity refers to the ma0imum mutual information etween
them.
*ys=om/&NI) BPPL
DP
)he capacity C is
. F -
ma0
. -
* ) I C
x p
-D.DP.
2here the ma0imi1ation is taken over all possile proaility distriutions p-x. of ) when ) is a
random variale. A data source with 'aussian proaility distriution has the ma0imum entropy.
)hus, to achieve a data rate close to the capacity, the data source should e 'aussian distriuted.
For a and limited channel with noise eing 'aussian and white, *hannon GBBH derived the
normali1ed capacity -capacity per unit andwidth. to e
. D - log
B
+ C "psCH1 -D.DD.
2here
is the average received *N,.

+.3 -aacity of MIMO Syste"s
A ase and MIM# system with M
t
transmit antennas and M
r
receive antennas can e
modelled y the linear relationship
n Wx y +
-D.DB.
2here x is the -M
t
/ . transmit vector, y is the -M
r
/ . receive vector, W is the -M
r
/ M
t
.
channel matri0 and n is the -M
r
/ . additive white 'aussian noise vector. )he channel is
assumed to e flat -narrow andwidth. and slow fading so it does not change during a time slot of
transmission. &ach entry of W, 0
i"
represents the comple0 path gain etween the "
th
transmit
antenna and i
th
receive antenna. 2ith 0
i"
eing comple0 'aussian, the magnitude T0
i"
T is ,ayleigh
distriuted. In a rich scattering environment the columns of W are assumed to e independent.
)he mutual information is then
. - . - . F - x y H y H y x I
-D.DI.

. . -- . - x n Wx H y H +

. - . - x n H y H

. - . - n H y H
2here the transmit vector x and noise vector n are assumed independent of each other.
)he third e!uality holds ecause W is constant -1ero entropy. during the transmission of a whole
lock of x. %ast e!uation is ma0imi1ed when y has the ma0imum entropy of ( ) 1K det log
B
. )his
re!uires y to e a circularly symmetric comple0 'aussian vector with covariance matri0
*ys=om/&NI) BPPL
DD
{ } K yy E
H
GBDH where -..
H
denotes comple0 con@ugate transpose. If the transmit vector x is also
comple0 'aussian vector with covariance { } 2 xx E
H
.
)hen K can e found y
( )( ) { }
H
n Wx n Wx E K + + -D.DJ.
{ } { }
H H H
nn E W Wxx E +

n H
K W2W +

n s
K K +
2here the fact that x and n are independent and 1ero mean is used. Here K
s
and K
n
are
respectively the signal and noise parts of the oservation covariance matri0.
)he ma0imum mutual information, which is also the capacity, is
. - . - n H y H C
-D.DK.
[ ] [ ] . det- log .. - det- log
B B
n n s
1K K K 1 +
[ ] . . .- det-- log
D
B

+
n n s
K K K
[ ] .. . - det- log
D
B r
n s
I K K +

( ) ( )
r
n H
I K W2W +
D
B
det log
2here I
r
is the -M
r
/ M
r
. identity matri0. )he noise received at each receiving antenna is
assumed to e uncorrelated so, K
n
= 3
!
I
r
, 3
!
eing the noise power on each receiving antenna.
Also, when the transmitter has no knowledge aout the channel, it is optimum to use e!ual power
on each antennaF that means t
t
t
I
M
P
2
, P
t
eing the total signal power.
)he MIM# channel capacity then ecomes
1
]
1
+ . det- log
B
H
t
r
HH
M
I C

-D.DL.
2here
B
t
P
has een replaced y
, the average *N, at each receiving antenna.

*ys=om/&NI) BPPL
DB
*. %pace time receiers
In this section, we study receiver structures for space time wireless channels. 2e use the
linear relationship
n Hs
M
P
y
t
t
+
-D.DM.
2here s is the
D
t
M
transmitted signal, H the t r
M M
channel matri0, n the D
r
M
additive white 'aussian noise -A2'N. vector with distriution CN
,
_
r
M
I
N
B
F P
P
-N
.
is the
spectral power density. and y the D
r
M received signal.
%et that we have
{ }
t
M
H
I ss E
,
( ) { }
r
M r t
H
I M M HH tr E
and
{ }
r
M n
H
I nn E
B

.
In the following, we assumed that the additive noise is uncorrelated with the transmitted signals.
For that reason, we have { } { } P
H H
sn E ns E . Finally, we give in the following tale the
vectoriel derivations rules.

. -x 4
x
x 4
. -
5 x x 5
H H
+
5
Mx x
H
Mx
7a/le 8: vectoriel derivations rules
2e egin with discussing the ma0imum likelihood -M%. receiver. )hen, we discuss the
1ero forcing and the minimum mean s!uare error -MM*&. receivers. Finally, we discuss the
successive cancellation receivers.
*ys=om/&NI) BPPL
DI
..1 Ma#i"u" /i0e!ihoo& $M/% receiver
)he ma0imum likelihood -M%. receiver performs vector decoding and is the optimal
receiver. Assuming e!uiproale transmitted signal vectors, the M% receiver estimates the
transmitted signal vector y
F min arg E
B
F
t
t
s
Hs
M
P
y s -D.DN.
2here the minimi1ation is performed over all possile transmitted signal vector s. If the signal
transmitted from each antenna is drawn from an M/ary signal constellation, the optimal M%
receiver re!uires search over a total of
t
M
M
signal vectors. )he comple0ity of the optimal M%
receiver grows e0ponentially in the numer of transmit antennasF M
t
. &fforts to reduce the
comple0ity of optimal M% receiver include fast sphere decoding algorithms GDLH and GBIH.
..2 /inear receiver
)he comple0ity of the optimal M% receiver can e significantly reduced y using a linear
filter to estimate the transmitted signal vector. %inear receivers can employ criteria like 1ero/
forcing -;F. or minimum mean s!uared/error -MM*&.. )he 1ero/forcing spatial receiver
performs terrily due to noise/enhancement, which suggests the need for an MM*& receiver that
alances noise/enhancement with spatial interference suppression GDNH GBJH.
*.2.1 ++%E receier
)he ;F receiver completely eliminates M*I at the e0pense of noise enhancement. In the
MIM# system given y e!uation -D.DM., if the receiver, denoted y an M
t
M
r
matri0 W is
employed, then the received signal sE
which is an M
t
vector is given y
n W Hs W
M
P
y W s
MM$E MM$E
t
t
MM$E
+ E
-D.DO.
)he MM*& receiver front/end alances M*I mitigation with noise enhancement y minimising
the mean s!uare error on the transmitted signal at the output of the filter and is given y
{ }. min arg
B
F
W
MM$E
s Wy E W
-D.BP.
%et { }
B
B
F
s Wy E denote the mean s!uare error.
*ys=om/&NI) BPPL
DJ
Now, we developed this e0pression to find the e0pression of W
MM$E
. 2e have
{ }
B
B
F
s Wy E -D.BD.
=onse!uently,
( )( ) { }
H
s Wy s Wy E
B

( )( ) { }
H H H
s W y s Wy E

{ }
H H H H H H
ss W sy Wys W Wyy E +

( ) { }
H H H H H
W sy Wys W Wyy E + + D
If we apply the vectoriel derivation rules to
B
compared to W then we otained
{ } { }
H H
sy E yy WE
W
+
P
B
-D.BB.
2e have
{ }
'
,
_
,
_
+
H
t
t
t
t H
n Hs
M
P
n Hs
M
P
E yy E

'
+
H H H
t
t
nn H Hss
M
P
E

r
M n
H
t
t
I HH
M
P
B
+
{ }
H
t
t
H
t
t H
H
M
P
n Hs
M
P
s E sy E
'
,
_
+
)hen
H
t
t
M n
H
t
t
H
M
P
I HH
M
P
W
W
r

,
_
+ +
B
B
P
)he minimi1ation of the mean s!uare error amounts to annulated the last calculated e0pression
P
B
Ne0t we can dedicated the optimal vector of e!uali1ation of the MM*& criterion
H
t
t
M n
H
t
t
MM$E
H
M
P
I HH
M
P
W
r

,
_
+
B
P
*ys=om/&NI) BPPL
DK
)hus, we have
D
B

,
_
+
H
M
t
n t H
t
t
MM$E
HH I
P
M
H
P
M
W
t
-D.BI.
&!uivalent to
H
M
t
n t H
t
t
MM$E
H I
P
M
H H
P
M
W
t
D
B

,
_
+

-D.BJ.
2here the second e!uality can e easily proved -see the appendi0 A/D.
7*e post detection SI+)
)he output of the MM*& receiver is given y -D.DO.
)he receive signal power is
{ }
'
,
_
,
_
+
H
MM$E MM$E
t
t
MM$E MM$E
t
t H
n W Hs W
M
P
n W Hs W
M
P
E s s E E E
-D.BK.

H
MM$E MM$E n
H
MM$E
H
MM$E
t
t
W W W HH W
M
P
B
+
%et -).
+,+
denote the -+, +.
th
element of matri0 ), then the *IN, associated with +
th
symol is
B
, ,
B
B
,
+ +
MM$E
t
t
+ +
H
MM$E MM$E n
H
MM$E
H
MM$E
t
t
+ +
MM$E
t
t
+
H W
M
P
W W W HH W
M
P
H W
M
P
,
_
1
]
1
,
_
-D.BL.
)he e0pression of
1
]
1
+
H
MM$E MM$E n
H
MM$E
H
MM$E
t
t
W W W HH W
M
P
B
is e!ual to
6
M
I
t
M
t
-see
proofUD in the appendi0.
2here
D
B

,
_
+
t
M
t
n t H
I
P
M
H H 6

i/e
H
t
t
MM$E
6H
P
M
W
And
B
,
_
H W
M
P
MM$E
t
t
is e!ual to
B
,
_
6
M
I
t
M
t
-see proofUB in the appendi0.

*ys=om/&NI) BPPL
DL
)hen
B
, ,
B
,
+ +
t
M
+ +
t
M
+ +
t
M
+
6
M
I 6
M
I
6
M
I
t t
t
,
_
,
_
,
_
=onse!uently,
[ ]
[ ] [ ]
D
D
D
, ,
,

+ +
t
+ +
t
+ +
t
+
6
M
6
M
6
M

D
D
,
D

1
1
]
1
,
_
+ +
Mt
t H t
+
I
M
H H
M

-D.BM.
*ome comments can e made for the high and low *N, region. At low *N,, the MM*&
appro0imates a matched filter
,
_
H
t
t
n
MM$E
H
M
P
W
B
D
and outperforms the ;F receiver that

continues to enhance noise. At high *N,, we get
,
_
A
H
P
M
W
t
t
MM$E
i.e., the MM*& receiver
converges to a ;F receiver and we can e0pect it to e0tract
( ) D +
t r
M M
order diversity. )he
MM*& receiver is therefore superior to the ;F receiver.
*.2.2 ,- receier
)he ;F receive separates the received signal into its component transmitted streams. In
the MIM# system given y e!uation -D.DM., if the receiver, denoted y an M
t
M
r
matri0 W is
employed, then the received signal sE which is an M
t
vector is given y e!uation -D.DO.
)he ;F matri0 filter that separates the received signal into its component transmitted streams is
given y
( )
H H
t
t
t
t
ZF
H H H
P
M
H
P
M
W
D
A

-D.BN.
2here H
7
denotes the Moore/3enrose inverse of the channel matri0 H. -for more precision see
chapter B section III..
*ys=om/&NI) BPPL
DM
)he output of the ;F receiver is otained as
n H
P
M
s y H 8
t
t A A
+
-D.BO.
)his shows that the ;F front/end decouples the matri0 channel into M
t
parallel scalar channels
with additive spatially/coloured noise. &ach scalar channel is then decoded independently
ignoring the noise across the processed streams. )he ;F receiver converts the @oint decoding
prolem into M
t
single stream decoding prolems -i.e., it eliminates M*I -Multi/stream
Interference.. therey significantly reducing receiver comple0ity. )his comple0ity reduction
comes, however, at the e0pense of noise enhancement which in general results in a significant
performance degradation -compared to the M% decoder..
..3 Successive Interference -ance!!ation $SI-% receiver
3erformance and comple0ity issues of linear receivers can e addressed y employing a
multistage interference cancelling structure. )he key idea in a *I= ased receiver is serial
cancellation of the M*I, where the individual data streams are successively decoded and stripped
away layer/y/layer. )he algorithm starts y detecting the symol -e.g., using ;F or MM*&. of
an aritrarily chosen layer, assuming that the other symols from the remaining layers are
interference. $pon detection of the chosen symol, its contriution from the received signal
vector is sutracted and the procedure is repeated until all symols are detected. In the asence of
error propagation the *I= converts the MIM# channel into a set of parallel *I*# channels with
increasing diversity order at each successive stage. In practice, error propagation will e
encountered, especially in the asence of an ade!uate temporal coding for each layer. )he error
rate performance will therefore e dominated y the first stream decoded y the receiver -which
is also the stream e0periencing the smallest diversity order. GBJH GBKH.
..4 Or&ere& SI- $OSI-% receiver
An improved *I= processor is otained y selecting the stream with the highest *ignal to
Interference plus Noise ,atio -*IN,. at each decoding stage. *uch receivers are known as
#rdered *I= -#*I=. receivers or in the MIM# literature as >/"%A*) detectors, ecause they
have een used successfully for "%A*) architectures. #*I= receivers reduce the proaility of
error propagation y realising a selection diversity gain at each decoding step. )he #*I=
*ys=om/&NI) BPPL
DN
algorithm re!uires slightly higher comple0ity than the *I= algorithm resulting from the need to
compute and compare the *IN, of the remaining streams at each stage. A ma@or prolem with
the *I= or the #*I= methods for M*I cancellation is the delay inherent in the implementation of
the canceller, since it re!uires one symol delay per layer. )his prolem may e alleviated to
some e0tent y devising methods that perform interference cancellation in parallel GBJH GBKH.
.. Conclusion
In this chapter, we have given a rief introduction of the different configurations of space
time wireless as well as a description of the different gains of e0ploiting multiple antennas. After
the description of the channel model, an e0haustive literature review is carried out on the notion
of diversity as well as its different techni!ues. After that, a definition of the signal to interference/
plus/noise ratio -*IN,. is given. Ne0t, the information theoretic terms such as entropy, mutual
information and capacity are elaorated and followed y a calculation of the theoretical capacity
of the MIM# channel. Finally, some space time receivers are descried.
In the following chapter, we will represent firstly the system and the channel model. Ne0t,
we will calculate the post detection *IN, in *M system using the ;F detector. Finally, we will
study and discuss the different techni!ues of scheduler such as round roin scheduling,
opportunistic scheduler and proportional fair scheduling when all M
t
allocated to one user.
*ys=om/&NI) BPPL
DO
CHAP7')2: A+A&;SIS $F SCH'%&I+(
7H)$%(HP%7 %SI+( =F '7'C7$)S
=apterB Analysis of *cheduling )hroughput using ;F detectors
1. Introduction
)he designers of MIM# systems can allocate transmit antennas to users in several ways.
)ransmit antennas can e allocated to one user in each time slot or can e shared dynamically.
)he last scheme allocates each antenna dynamically to usersF hence these resources are assigned
to different users in each time slot. )his solution provides higher throughput for a cost of high
receiver comple0ity. From here, we are interested y the scheme where all transmit antennas are
allocated to one user during a time slot.
$sers estimate their channel sate information -=*I. using detectors like 1ero/forcing -;F. and
feed ack them to the node station on an uplink channel. *ome recent interesting works have
provided statistic distriutions of the post detection signal to interference plus noise ratio -*IN,.
in the case of ;F detectors. )hese results are e0ploited in this work to provide a complete
analysis of packet scheduler knowledge for downlink channels.
)he *chedulers in these schemes such as the round roin scheduling, the opportunistic and the
proportional fair scheduling would ma0imi1e system throughput using the knowledge of users6
channels. In this chapter, we investigate the effective throughput gain using these different
schedulers relative to the downlink of a single cell MIM# system in the case study when all M
t
transmit antennas are assigned to one user.
)his chapter is organi1ed as follows< section II descries the system and channel models.
In *ection III, we calculate the post detection signal to interference plus noise ratio -*IN,. for
spatial multiple0ing system using ;F detectors. In section >I, different schedulers6 throughputs
are analy1ed and simulations are discussed. Finally, conclusion is drawn.
2. /ssumptions and %!stem +odel
)he considered scheme is a multi/user MIM# wireless packet transmission system. 2e
consider the downlink transmission of a single cell system comprising a wireless node station
and N MIM# users. )he node station is e!uipped with M
t
transmit antennas, and each user
terminal with M
r
receive antennas. )he node station serves N active users in a time division
multiple0 -)DM. fashion. It is assumed that the system employ slow power control to e!ually
share the total power P
t
on all transmit antennas at the transmitter. $ser data packets are loaded
on transmit antennas using spatial multiple0ing -*M. techni!ues. ;F detectors are considered in
*ys=om/&NI) BPPL
BP
this study. $sers estimate their supportale rates and feed ack them to the node station through
an uplink feedack channel as shown in FigureD.
Figure B< =ellular system with multiple transmits and receives antennas.
2e define the supportale rate of a channel as the ma0imum feasile transmission rate
per unit andwidth, at which data packets can e delivered through the channel with predefined
tolerale errors.
It is assumed that transmit signals e0perience path loss, log/normal shadow fading, and
multi/path fading. Hence the difference of propagation loss and long/term shadow fading among
antennas in a user terminal would e negligile.
)he =*I is measured y matri0 H
+
-t. which represents the short term fading =*I on all
ranches from the node station to the +
th
user during a time slot. According to the slow power
control assumption, -i. each entry of the matri0 H
k
is an independent and identically distriuted
comple0 'aussian random variale with distriution CN -.- . representing short term fadingF
-ii. the =*I has a flat variation during each time slot, and varies independently over time slots.
*ys=om/&NI) BPPL
BD
2e denote y H
+
-t. the M
r
/ M
t
matri0, s-t. M
t
/ the transmitted signal, n
+
-t. M
r
/
the additive white 'aussian noise -A2'N. vector with distriution CN -.- N
.
9!M
r
. for each
element, and y-t. the M
r
/ received signal. N
.
is the spectral power density. )hen, the received
signal for the considered multi/user MIM# system in the slot t is represented as
. - . - . - . - t n t s t H
M
P
t y
+ +
t
t
+
+
2here + = :N. -B.D.
3. %tatistics of %I&' in the case of ,- detectors
A high/rate it/stream, divided into independent su/streams, is considered in this work.
&ach su/stream is transmitted over an antenna among the M
t
transmit antennas. In this section,
we calculate the post detection *IN, at the receiver using 1ero forcing detectors.
3.1 The ost &etection SI12
)he received signal for the considered multi/user MIM# system is given y -D.. )he
output of ;F detectors can e e0pressed as GNH
y W s
ZF
E
-B.B.
2here W
ZF
is the invert of the channel otained y a ;F e!uali1er, which is in other words the
matri0 that inverts the channel yielding to the desired symol stream.
If we apply the ;F receiver then we search to ma0imi1e the resemlance etween s and sE
. 2e have
( )
H
ZF
H
ZF
H H
ns W ss I H W ss s s + + E -B.I.
=onse!uently,
{ } ( ) { }
H
ZF
H
ZF
H H
ns W ss I H W ss E s s E + + E
{ } ( ) { }
H
ZF
H
ZF
H
ns W ss I H W E ss E + +
{ } ( ) [ ] { }
H
ZF ZF
H
s n W s I H W E ss E + +
)hen to ma0imi1e the ne0t e0pression it must minimi1ed the interference and noise terms, we
otain
( ) [ ] { } P +
H
ZF ZF
s n W s I H W E
*ys=om/&NI) BPPL
BB
%et s s 1 E
denote the error vector etween the transmitted signal s and the received signal sE
.
)hen if the received detector is assumed to e ;F,then we otain the following e!uality
[ ] P
H
1s E -B.J.
H
-.. is the Hermitian transpose of -...
)o find the e0pression of a ;F receiver, we should first write out the e0pression of the
error vector 1.
From e!uation -B.B., we have
n W s I H W
M
P
1
ZF ZF
t
t
+
,
_

-B.K.
)hen the sustitution of the e!uation -B.K. in the e!uation -B.J. results in
[ ]
1
1
]
1
,
_
,
_

H
ZF ZF
t
t H
s n W s I H W
M
P
E 1s E -B.L.

I H W
M
P
ZF
t
t

P
2here W
ZF
stands for ;F receiver and the second e!uality comes from that s and n are
independent random variales.
)herefore, we otain the e0pression of 2
;F
( ) [ ]
+ +
H
t
n t
+
H H
P
M
,
D
B
D
-B.M.
&!uivalent to

( ) [ ]
+ +
H t
+
H H
M
,
D
D
2here
A
H
denotes the Moore/3enrose inverse of the channel matri0 H.
)he output of the ;F receiver is otained as
n H
P
M
s y H s
t
t A A
E +
-B.N.
*ys=om/&NI) BPPL
BI
From -B.N. the noise power on the +
th
-where, +=, to M
t
. output data stream is
{ } ( ) ( ) { }
H
+ + + +
H
s s s s E 11 E
, ,
B
E E -B.O.

( ) ( )
'
,
_
,
_

H
+ +
H H
t
t
+ +
H H
t
t
n H H H
P
M
n H H H
P
M
E
,
D
,
D

( ) ( ) [ ] { }
+ +
H H H
t
n t
H H H H H H E
P
M
,
D D
B

( ) [ ]
+ +
H
t
n t
H H
P
M
,
D
B

=onse!uently, the corresponding *IN, of the ;F receiver is e!ual to
( ) [ ]
+ +
H t
+
H H
M
,
D
D
-B.DP.
2here
is the average *N, at each of the receive antennas.

3.2 The ro3a3i!ity &istri3ute& function
'ore et al. in GNH and GOH have demonstrate that the post detection *IN, using a ;F
detector on each of the M
t
streams is distriuted in a =hi/s!uared random variale with
( ) D B +
t r
M M
degrees of freedom.
)he proaility distriuted function -pdf. of
can e given y<

t r t
M M
t
x
M
t r
t
x
M
1
M M
M
x 4

,
_
.V -
. - -B.DD.
)he corresponding cumulative distriution function -cdf. of +
is given y
x
;5 5 4 x F
P
. - . -
-B.DB.
=onse!uently,
,
_

t r
t M M
i
i
t
x
M
x
M
i
1 x F
P
V
D
D . -
-B.DI.
*ys=om/&NI) BPPL
BJ
%et,
x
M
y
t
,
t r
M M M
and
t
M

If we use the following e!uality
( ) ( )
( )
+
+ +
M
+
y +
M
y M M 1
+
y
P
B
, D D
V

)hen, the compact form of the cumulative distriution function is e0pressed as
,
_
x M
M M x F
t
t r inc
, D D . -
-B.DJ.
2here

8
t a
inc
;t 1 t
a
8 a
D
. -
D
. , -
is the regulari1ed incomplete gamma function.
3.3 The ro3a3i!ity &istri3ute& function for the sche&u!ing
2hen all M
t
transmit antennas are assigned to one user, the metric used for the scheduling is<
t
M
m
m +
*
D
,
-B.DK.
)o evaluate the distriution of W, we consider the following theorem and corollary.
7*eorem
%et )
, )
!
, :, )
M
e independent and identically distriuted e0ponential random variales, each
with parameter X.
x
)
1 x 4
i

. -
-B.DL.
)hen
M
m
m
) *
D
is a gamma random variale with parameters -M

, <..
x M M
*
1 x x 4

D
. - -B.DM.
Corollary
It is clear that the sum of M
t
independent and identically distriuted gamma random variales
retains a gamma distriution. If the summands have parameters -n, <., -n, <., Y, -n, <., then each
random variale is a sum of n e0ponentials with parameter X. )he sum of M gamma random
*ys=om/&NI) BPPL
BK
variales is then the sum of Mn e0ponentials and conse!uently has a gamma distriution with
parameters
( ) , Mn
.
Proposition
)he metric used in the case of 1eros forcing detector and when all transmit antennas are allocated
to one user y time slot would e distriuted as<
( )
( )
( ) ( )V D D
. -
D D
D
+
,
_
+
+
t t r
x
M
M M M
M M M
t
*
M M M
1
x
M
x 4
t
t t r
t t r

. -B.DN.
%et
t
M
and
( )
t t r
M M M M D +
F
=onse!uently, the proaility distriuted function is e0pressed as
.V D -
. -
D
M
1
x x 4
x
M M
*
-B.DO.
)he cumulative distriution function -cdf. of this proaility distriuted function -pdf. is

y
x M
M y x
M M
*
;x 1 x
M
;x
M
1
x y F
P
D
P
D
.V D - .V D -
. -

1
1
]
1
D
P
V
.V D - .V D -
.V D -
. -
M
i
i M
i
y
M
M
*
y
i
M
1
M
M
y F

( )

D
P
V
D
D
M
i
i y
y
i
1

( ) ( ) y M P y M 2 , , D
-B.BP.
2here
( ) ( ) ( ) ( ) y M 2 y M P an; y
i
1 y M 2
M
i
i y

, D ,
V
D
,
D
P

4. %chedulers throughputs
)he essential goals of the scheduling are to ma0imi1e the system rate and to provide
fairness among users while reducing the comple0ity of the system. )he channel state dependent
scheduling scheme ma0imi1es the system throughput y the use of multi/user diversity. )he
round roin scheduler -,,*. allocates resources in cyclic round. )his scheduler has the
advantage of providing fairness and low comple0ity for a cost of an important loss in system
*ys=om/&NI) BPPL
BL
throughputs. )o enhance the system performances, resources are allocated to a user with a
channel in its peak level. )hen, the ma0imum throughput gain can e achieved, if each spatial
channel is allocated to a user that e0periences the est channel conditions for each time slot. )his
scheduler is known as the opportunistic scheduler. )his scheme ma0imi1es the throughput ut
shares the system resources in an unfair way. )he proportional fair scheduling provides an
attractive trade/off etween throughput and fairness among users.
After that, we develop an overview study on performances of these scheduler schemes,
where throughputs are analysed in the case of ;F detectors when all transmit antennas are
allocated to one user at each time slot.
4.1 2oun& ro3in sche&u!ing $22S%
4.1.1 Theoretical anal!sis
)he round roin scheduling -,,*. scheme serves users that e0perience *IN, greater than
a threshold in a cyclic fashion independently the other channel conditions. Hence, users have the
same chance to channel access. #ne user among active users is selected at each time slot in a
round roin fashion, and all the spatial channels or transmit antennas are assigned to the
randomly selected active user for a time slot.
)he +
th
user is selected at the time slot t and has to receive data, using all system transmit
antennas. )his user has a throughput
. -t r
+
for the given time slot<
( )
+
t
M
m
m + +
t t r
D
, B
. - D log . - -B.BP.
2here
. -
,
t
m +
is the post detection *IN, at the receiver of the channel from the m
th
transmitting
antenna to the +
th
user.
)he distriution function of the post detection *IN, using a ;F detector is given y
e!uation -B.DP. and it is distriuted as shown in -B.DD.
*ys=om/&NI) BPPL
BM
If we apply the algorithm of the round roin scheduling scheme, the metric used is
randomly selection of users as
t
M
m
m +
+
ran; *
D
,
and the analytic average capacity per slot for
the +
th
user is
+
P
B
. - . D - log
D
;5 5 4 5
N
C
*
%%$
a=
-B.BD.
4.1.2 &umerical results
In this susection, the performance of the round roin scheduling is evaluated in terms of
system throughput. Figure I shows the effect of the variation of transmit antenna M
t
and receive
antenna M
r
in system throughput where the average *N, used for this simulation is Kd". Figure
J illustrates the effect of the variation of the average signal to noise ratio *N, in system
throughput where the numer of antennas M
t
=M
r
=!. )hese figures plot the system throughput
e0pected on a time moving window t
c
of KPP time slots. )he numer of active users N used for
these simulations varies from B to JP.
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
4
Number of Active Users
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
M
t
=M
r
=2
M
t
=M
r
=4
Figure I< &ffect of the variation of the numer of antennas in the ,,* throughput
*ys=om/&NI) BPPL
BN
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
p
s
/
H
z
)
Average SNR=-5dB
Average SNR=0dB
Average SNR=5dB
Figure J< &ffect of the variation of the average *IN, value in the ,,* throughput
2e note that the system throughput is nearly independent of the active users6 numer.
)hen, we can conclude that the round roin scheduling can not take advantages of multiuser
diversity. )hese two simulations results which are carried out for different antennas and different
average *N,, illustrate that system capacity is enhanced in antenna numer growth as well as in
average *N, growth.
4.2 Oortunistic Sche&u!er
)he asic idea is to ma0imi1e the link throughput of the MIM# system. In this
opportunistic scheduling scheme all transmit antennas are assigned to the user chosen at each
time slot. )he opportunistic scheduling scheme chooses the user satisfying
. - ma0 arg
+
+
s
r +
-B.BB.
2hen
. -t r
+
is the instantaneous transmissile throughput of user + given y -B.BP..
)he instantaneous supportale throughput of the scheduled user +
s
, r
+
may e e0pressed as
( )
+
t
s
M
m
m + s +
t r
D
B
D log . - -B.BI.
*ys=om/&NI) BPPL
BO
2here m +,
represents the post detection *IN, at the receiver of the channel from the m
th
transmit antenna to the +
th
user.
)he opportunistic scheduling scheme tends to ma0imi1e the sum capacity over all transmit
antennas, ut not the capacity of each transmit antennas.
)he e0pression of the post detection *IN, using a ;F detector is given y -B.DP. and it is
distriuted as -B.DD.
If we apply the opportunistic scheduling scheme, we have the case when

m + , which
the scheduler metric converges to the optimal est channel selection which can e e0pressed as
t
M
m
m +
+
*
D
,
ma0 -B.BJ.
)he analytic average capacity per slot for the +
th
user is then
( ) ( )
+
P
B
D log ;5 5 4 5 C
*
>PP
a= -B.BK.
In this susection, the performance of the opportunistic scheme is evaluated in terms of
system throughput. Figure K shows the effect of the variation of antennas in the system
throughput versus numer of active users when the average *N,S ?;@. Figure L plots the effect
of the variation of the average *N, value in system throughput when M
t
=M
r
=!. In these two
simulations, we used t
c
=?.. and the numer of active users varies etween to A.#
2e note that the system throughput otained y simulation increases with the numer of
active users and saturates after N B .. )o confirm this, two figures when some simulations are
carried out for different numer of antennas and for different average *N, values. In addition to
that, the system throughput grows as the numer of antennas increases and as the average *N,
value increases.
*ys=om/&NI) BPPL
IP
5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
7
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
M
t
=M
r
=2
M
t
=M
r
=4
Figure K< &ffect of the variation of the numer of antennas in the #* throughput.
5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
p
s
/
H
z
)
Average SNR=-5dB
Average SNR=0dB
Average SNR=5dB
Figure L< &ffect of the variation of the average *N, value in the #* throughput.
4.3 'roortiona! fair sche&u!ing $')S%
2ith the proportional fair scheduling -3F*., a long term average throughput of each user
is tracked y e0pecting his allocated rates measured in a time moving window t
c
time slots. At
*ys=om/&NI) BPPL
ID
the guard period of each time slot, the fed ack =*I is used y the node station process the ratio
of the instantaneous rate
. -t r
+
to the long term average throughput
. -t %
+
for each user. )his
ratio would e used as the scheduler metric to select user for resource allocation. In this scheme,
all transmit antennas are allocated to one user at each time slot. )he user that e0periences the
ma0imum ratio will e selected for transmission at this time slot.
)he instantaneous channel condition of the +
th
user at the t
th
time slot can e represented
as the instantaneous throughput
. -t r
+
and long term average throughput, the proportional fair
scheduling selects user with argument +
s
as
,
_
. -
. -
ma0 arg
t %
t r
+
+
+
+
s
-B.BL.
)he scheduling system would update users6 long term throughput average as
., D - . C D D - . -
t % t t %
+ c + +
s
-B.BM.
c + + c +
t t r t % t t %
s s s
C . - . . D - . C D D - . - +
-B.BN.
4.3.1 Throughput anal!sis
2hen multiple transmit and receive antennas reali1e spatial multiple0ing, multiple spatial
channels in different conditions are created at each time slot. &ach spatial channel is associated
with a transmit antenna, and thus the numer of spatial channels is e!ual to that of transmit
antennas, M
t
. Different data symols can e transmitted through these multiple spatial channels
at the same time. )herefore, the instantaneous supportale throughput
. -t r
+
of the +
th
user can
e e0pressed as the sum of the instantaneous supportale throughput of M
t
spatial channels for
the user
t
M
m
m + +
t r t r
D
,
. - . - -B.BO.
2here
. -
,
t r
m + denotes the instantaneous supportale throughput of the m
th
spatial
channel for the +
th
user at the t
th
time slot, and it can e calculated using the post detection *IN,
calculated in the last susection e0pressed as -B.O. )hen
.. - D - log . -
, B ,
t t r
m + m +
+
-B.IP.
Now, the proportional fair scheduling scheme can e performed using the e0pression
given in -B.BM. and -B.BN..
*ys=om/&NI) BPPL
IB
)he resulting system throughput at the -tC.
th
time slot may e e0pressed as
t
s
M
m
m + s +
t % t %
D
,
. - . - -B.ID.
In this susection, the performance of the proportional fair scheduling scheme is
evaluated in terms of system throughput. Figure M shows the effect of the variation of transmit
antenna M
t
and receive antenna M
r
in system throughput with average *N, of K d". Figure N
illustrates the effect of the variation of the average *N, value in system throughput when
M
t
=M
r
=!. )hese figures plot the system throughput when t
c
is of KPP time slots and the numer
of active users N used for these simulations varies from D to JP.
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
4
4.5
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
M
t
=M
r
=2
M
t
=M
r
=4
Figure M< &ffect of the variation of the numer of antennas in 3F* throughput.
*ys=om/&NI) BPPL
II
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
p
s
/
H
z
)
Average SNR=-5dB
Average SNR=0dB
Average SNR=5dB
Figure N< &ffect of the variation of the average *N, value in 3F* throughput.
2e note that the system throughput otained in the two figures increases with the numer
of active users and saturates after N B .. )o confirm this, two figures and some simulations are
carried out for different numer of antennas and different value of average *N,. As a
conclusion, the simulation results of the proportional fair scheduling and the opportunistic are
similar.
4.4 -o"arison of sche&u!ers erfor"ances
Finally and after the study and the representation of simulation results of the ,,*, the
opportunistic and 3F* schemes, we can compare the performance given y these schemes. )o
compare the performance of the round roin scheduling, opportunistic scheduler and
proportional fair scheduling figure O is illustrated. Figure O shows system throughput versus
numer of active users of simulation results when t
c
= ?.., N = A., M
t
=M
r
=! and
= ?;@.
2e note that the system throughput of the opportunistic scheduler is etter than the round
roin scheduling and the proportional fair scheduling. )he system throughput of the 3F* is
etween the two system capacities of the two other schedulers.
*ys=om/&NI) BPPL
IJ
5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
p
s
/
H
z
)
Round Robin
Proportional Fair
Opportunistic
Figure O< ,,*, #* and 3F* throughput with M
t
=M
r
=!- t
c
=?..
)hen we can note that the performance of the 3F* is etter than the performance of ,,*
and the performance of the opportunistic is etter than the performance of the two others.
According to these comparisons, we can conclude that the opportunistic is the optimal
scheduler ut the system resources would e shared in an unfair way and in an une!ual latency.
)o make the scheduler fair among users, we can apply the proportional fair -3F. scheduling.
5. Conclusion
)he round roin scheduling, the opportunistic scheduler and the proportional fair
scheduling throughputs have een analy1ed in this chapter. )hese schemes assign all transmit
antenna M
t
to one user and only one user is served during each time slot. )herefore in the
following chapter, we will investigated the ,,*, the opportunistic and the 3F* schemes where
the transmit antennas are allowed to e assigned to different users at each time slot and we have
a full uplink feedack channel.
*ys=om/&NI) BPPL
IK
CHAP7')>: A+A&;SIS $F PAC:'7
SCH'%&I+( I+ ;+AMIC SM MIM$
=hapterI Analysis of 3acket *cheduling in Dynamic *M MIM# *ystems
1. Introduction
In this chapter, we investigate the effective capacity using the different schedulers when
transmit antennas are allocated dynamically to different users. )he optimality of these different
schedulers comes from the e0pense of a full channel state information -=*I. reporting which
leads to a large feedack urden. )o solve this issue, we propose a reduced comple0ity scheme,
where each moile user sorts the -*IN,. of all transmit antennas -M
t
. and sends ack to the node
station the K highest channel6s *IN, -K Q M
t
..
)his chapter is organi1ed as follows. In section II, we will study the different schedulers,
give the system throughput in analytical form and discuss simulation results. In section III, the
techni!ue of reduced feedack is applied to the opportunistic and the 3F* schedulers and
simulation results are discussed.
2. %chedulers throughputs
)he essential goals of the scheduling are to ma0imi1e the system throughput and to
provide fairness among users. )he channel state knowledge dependent scheduling scheme
ma0imi1es the system throughput y the use of multi/user diversity and the techni!ue of
allocating the transmit antennas dynamically. At each time slot, the M
t
allocated to different users. In other words, M
t
users are served at each time slot.
In this section, we are developing an overview study on performances of the round roin
scheduling, the opportunistic and the proportional fair scheduling schemes, where analytical
solutions for their throughputs in the case of ;F detectors are developed.
2.1 The roun& ro3in sche&u!ing $22S%
Initially, users are listed in some fashion. )hen, we apply the techni!ue when one
transmit antenna is assigned to one user. At each time slot, M
t
users are selected from N users.
)he selection of users is made in a round roin fashion.
For e0ample, in the case of N=!. and M
t
=!, the selection of users for suse!uent time
slots are Z, ![, ZD, A[,Y, ZE, !.[.
*ys=om/&NI) BPPL
IL
)o guarantee e!ual channel access chance to users as in the round roin scheduling -,,*.
scheme, the selection of users is made in a round roin fashion, and each selected user is
restricted to use one and only one spatial channel.
A mapping etween transmit antennas and users may e represented as a se!uence -+
,+
!
,
:,+
Mt
., with +
m
denoting the user inde0 assigned to the m
th
transmit antenna. For a given
se!uence of +
m
6s, the system capacity for the time slot t may e calculated as
( )
+
t
M
n
m + +
t t r
D
, B
. - D log . - -I.D.
2here
. -
,
t
m +
is the post detection *IN, at the receiver of the channel from the m
th
transmitting
antenna to the +
th
user.
)he post detection *IN, using a ;F detector is given y e!uation -B.DP. and it is
If we apply the algorithm of the round roin scheduling scheme, we denote y
m +
+
ran; *
,

and the analytic average throughput per slot for +
th
user is
+
P
B
. - . D - log
D
;5 5 4 5
N
C
*
%%$
a= -I.B.
( )
( )
,
_
,
_
+
P
V
D log
. B log-
D
;5 5
M
1
M M
M
5
N
t r t
M M
t
5
M
t r
t

If we use the method of integrating y partsF we have

,
_
,
_
P
P
V
D
D
D
. B log-
D
t r
t
M M
+
+
t
5
M
;5 5
M
+
1
5 N
If we apply the theorem of changing the varialeF we have

( )
,
_
,
_
t
t r
t
M
+
t t
M M
+
M
;t
M
t 1
t + N
1 D
V
D
. B log-
P
If we use the e0pression of
+ n +
n
i
n
( a
i
n
( a

,
_

+
D
P
D
. -
F
*ys=om/&NI) BPPL
IM
we have
( ) ( )
( )
1
1
1
]
1
,
_
,
_
,
_
t
t r
t
t
M
n
t
n +
+
n
t
M M
+ M
t
M
;t
M
t
n
+
1
t +
;t 1
t N
1
D
P D
D
D
V
D D
. B log-
=onse!uently,

1
1
]
1
,
_
,
_
,
_
,
_
t
i
t
+
i
M M
+
t
M
%%$
a=
M
i +
M
i
+
+
M
E
N
1
C
t r
t
,
D
V
D
. B log-
D
P D
D
)hen, the system throughput would e
1
1
]
1
,
_
,
_
,
_
,
_
t
i
t
+
i
M M
+
t
M
%%$
a=
M
i +
M
i
+
+
M
E
1
C
t r
t
,
D
V
D
. B log-
D
P D
D
-I.I.
2here
. , - x a
is the incomplete gamma function.
And where
x
t
;t 1 t x E
D
D
. -
is the e0ponential integral function.
2.1.2 0alidation and numerical results
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
Number of active users
S
y
s
t
e
m

t
h
r
o
u
g
h
p
u
t

i
n

b
p
s
/
H
z
M
t
= M
r
= 4
M
t
= M
r
= 2
Simulation results
Theoretical results
Figure DP< &ffect of the variation of the numer of antennas in ,,* throughput.
*ys=om/&NI) BPPL
IN
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t

(
b
p
s
\
H
z
)
Average SNR=5dB
Average SNR=0dB
SNR=-5dB Average
Theoretical
Simulation
Figure DD< &ffect of the variation of the average *N, value in ,,* throughput
In this susection, the performance of the round roin scheduling is evaluated and
compared with the theoretical results in terms of system throughput. Figures DP and DD show the
effect of the variation of transmit antenna M
t
and receive antenna M
r
when *N,S?;@ and the
effect of the variation of the average *N, value when M
t
=M
r
=! in system throughput,
respectively. )hese figures plot the system average capacity when t
c
is of KPP time slots and
numer of active users N varies from K to JP.
2e note that the system throughput is nearly independent of the active users6 numer.
)hese two simulations results which are carried out for different numer of antennas and
different value of average *N,, illustrate that system capacity is enhanced in antenna numer
growth and in average *N, value growth.
)he theoretical solutions are near the empirical solutions otained y simulations which
use t
c
reali1ations.
In the following section, we do similar analysis for opportunistic scheduler.
*ys=om/&NI) BPPL
IO
2.2 Oortunistic Sche&u!er
)he asic idea is to ma0imi1e the capacity of each transmit antenna. In the opportunistic
scheme all users can compete independently for each transmit antenna. At each time slot, each
antenna is assigned to user which e0perience peak level channel. Hence, the metric used in this
case is

( ) . - ma0 arg
,
t +
m +
+
s

-I.J.
2hen
. -t r
+
is given y -I.D., the supportale system capacity
. -t r
s
+
fed ack from the
select user may e e0pressed as
( )
,
_
+
t
s
M
m
m +
+
+
t t r
D
, B
. -
ma0
D log . - -I.K.
2here
. -
,
t
m +
is the *IN, at the receiver of the channel from the m

th
transmitting
antenna to the +
th
user.
)he opportunistic scheduling scheme in dynamic *M tends to ma0imi1e the capacity of
each transmit antenna.
)he e0pression of the post detection *IN, using a ;F detector is given y -B.DP. and is
2e denote y *
max
the ma0imum of m +,
. - ma0
, ma0 m +
+
*
-I.L.
)he proaility distriuted function and the cumulative distriuted function of this stochastic
process are respectively
( ) . - . - . -
D
ma0
y 4 y F N y 4
N
*
-I.M.
( )
N
*
y F y F . - . -
ma0

-I.N.
2here
. - y F
is given y -B.DJ. and N is the numer of active users. )he analytic average
capacity per slot and per antenna is
*ys=om/&NI) BPPL
JP
( )
+
P
B
. - D log
ma0
;5 5 4 5 C
*
>PP
a= -I.O.
=onse!uently
( ) ( )
+
P
D
. - . - D ln
. B log-
D
;y y 4 y F N y C
N >pp
a=
2e have
( ) ( ) ( )
,
_
D
P
, D D
D
. -
N
r
r
inc
r N
y M
r
N
y F

( )
( ) ( ) ( ) ;y y M
r
N
y
C
N
r
r
inc
r >PP
a=
,
_
D
P
P
, D D
D
D
D
B log
D
=onse!uently,
( )
( ) ( )
;y
y
y M
r
N
C
r
inc
N
r
r >PP
a=

+
+
,
_
P
D
P
D
, D
D
D
. B log-
D
If we apply the theorem of changing the varialeF let
y 5 + D
F we have
( )
( ) ( ) ( )
;5
5
5 M
r
N
C
r
inc
N
r
r >PP
a=

,
_
D
D
P
D , D
D
D
. B log-
D
%et
( )
( ) ( ) ( )
;5
5
5 M
x I
x
r
inc
r

D , D
As a result
( ) ( ) D D
D
. B log-
D
D
P
r
N
r
r >PP
a=
I
r
N
C

,
_

-I.DP.
Particular case
If, M
r
= M
t
, the proaility distriuted function and the cumulative distriuted function of the
post detection *NI, will e,
x
M
t
t
1
M
x 4

. -
x
M
t
1 x F

D . -
*ys=om/&NI) BPPL
JD
)he analytic average capacity per slot for the +
th
user has the e0pression
( )
+
P
B
. - D log ;y y 4 y C
*
>PP
a=
( ) ( )
+
P
D
. - . - D ln
. B log-
D
;y y 4 y F N y C
N >pp
a=
$sing the cumulative distriuted function e0pressed in -B.DI., we have
( )
,
_
,
_
D
P
D
D
. -
N
r
r
y
M
r N
t
1
r
N
y F


( )
( ) ;y 1
r
N
y
C
N
r
r
y
M
r >PP
a=
t
,
_
,
_
D
P
P
D
D
D
D
B log
D

=onse!uently,
( ) ;y 1
y r
N
C
r
y
M
N
r
r >PP
a=
t
,
_
,
_
P
D
P
D
D
D
D
. B log-
D

If we apply the theorem of changing the varialeF let
y 5 + D
F we have
( ) ;5 1
5 r
N
C
5
rM
N
r
r >PP
a=
t
,
_
D
. D -
D
P
D
D
D
. B log-
D

)hen
( ) ;5 1
5
1
r
N
C
t
t
rM
5
rM
N
r
r >PP
a=

,
_
D
D
D
. B log-
D
D
P
After all calculation we have the e0pression given y
,
_
D
P
D
. C -
. C - . D -
D
. B log-
D
N
r
t
rM r >PP
a=
rM E 1
r
N
C
t
-I.DD.
In this numerical validation, the performance of the opportunistic scheduler scheme is
evaluated and compared with the theoretical results in terms of system throughput. Figure DB and
figure DI show the effect of the variation of the numer of antennas when the average *N, used
in simulation and in analytical solution is of ?;@ and the effect of the variation of the average
*N, value when M
t
=M
r
=!. )hese two figures show the system throughput of simulation and
*ys=om/&NI) BPPL
JB
theoretical results versus the numer of active users of simulation and theoretical results when
t
c
=?.. and N=A..
2e note that the system throughput in analytical form and that otained y simulation are
in good concordance. )o confirm this, two figures and some simulations are carried out.
According to these comparisons, we can conclude that the proposed analytical solution is the real
average system capacity.
5 10 15 20 25 30 35 40
0
2
4
6
8
10
12
14
S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
M
t
S M
r
S J
M
t
S M
r
S B
*imulation
)heoretical
Figure DB< &ffect of the variation of the numer of antennas in #* throughput.
*ys=om/&NI) BPPL
JI
5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
N
o
r
m
a
l
i
z
e
d

S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
Average SNR=5dB
Average SNR=0dB
AverageSNR=-5dB
Theoretical
Simulation
Figure DI< &ffect of the variation of the average *N, value in #* throughput
2.3 'roortiona! fair sche&u!ing $')S%
2.3.1 Throughput anal!sis
)he proportional fair scheduling scheme descried in the last chapter assigns all M
t
spatial channels to one user, so that only one user is served during each time slot. However, in
multiple transmit and receive antenna systems ased on *M, each spatial channel or transmit
antenna can e allowed to e assigned to different users at each time slot.
)he effective use of this degree of freedom in scheduling is e0pected to achieve multi/user
diversity in the space domain as well as in the multi/user domain.
In the proportional fair scheduling scheme, transmit antennas are allowed to e assigned
to different users at each time slot, and scheduling is conducted in M
t
se!uential stages. At each
stage, one transmit antenna is assigned to the est user in the proportional fair sense, and the
average supportale throughput of users are updated according to the assignment results. Hence,
the proportional fair scheduling procedures may e summari1ed as
Initiali1ation
=alculate
. -
,
t r
m + for m S D, B, Y., M
t
and + S D, B, Y, N -I.DJ.
*ys=om/&NI) BPPL
JJ
,ecursion
{ }

,
_
. -
. -
ma0 arg
,
,.., B , D t %
t r
+
+
m +
N +
s
-I.DK.
. D -
D
D . -
, ., -

,
_
t %
t
t %
m +
c
m + +
s
-I.DL.
. -
D
. D -
D
D . -
, , ,
t r
t
t %
t
t %
m +
c
m +
c
m +
s s s
,
_
,
_

-I.DM.
2here
. -
,
t r
m + denotes the instantaneous supportale throughput of the m
th
spatial
channel for the +
th
user at the t
th
time slot, and it can e calculated using the post detection *IN,
calculated in the last chapter e0pressed as -B.DP.
)hen
.. - D - log . -
, B ,
t t r
m + m +
+
-I.DN.
And where +
s
denotes the user inde0 assigned to the m
th
transmit antenna.
)he resulting system throughput at the -tC.
th
time slot may e e0pressed as
t
s
M
m
m + +
t % t %
D
,
. - . - -I.DO.
2e try in this study to analy1e how the proportional fair scheduling scheme really works,
if the user6s *IN, e0perienced on all spatial channels are assumed to e independent and
identically distriuted. )his scheduler uses two ways to select users ased on how their *IN, are
lower or greater than the average. %et define the two groups of users '
D
and '
B
as
{ }
m +
+ 6
, D

-I.BP.
{ }
m +
+ 6
, B -I.BD.
)he *IN, of group6s '
D
users are greater than the average. )he scheduler allocates
resources to a user according to the metric -I.DJ.. All users in this group have an instantaneous
rate greater than their average. =onse!uently, they have the same chance to e scheduled as
specified in -I.DJ.. )hen, we can conclude that users in this set are scheduled as in the round
roin scheduling.
*ys=om/&NI) BPPL
JK
$sers of group '
B
e0perience *IN, lower than the average. )heir supportale rate is
lower than their average rate. Accordingly, the metric -I.DJ. promotes memers of '
B
that
e0perience strongest channel.
Hence, users having the est instantaneous transmissile rate would e selected for
resource allocation. =onse!uently, users in '
B
are eing allocated resources according to the
opportunistic scheme.
)he main o@ective of the search is to give a solution for the 3F* scheme throughput in
analytical form, users in the two sets are scheduled using the metrics *
m
and )
m
.
i. If

m + , , the scheduler metric converges to the optimal est channel selection which
can e e0pressed as
m +
+
m
*
,
ma0
)he average throughput per slot for the +
th
user is
( )
+
P
B
. - D log
D
; 4 C
m
*
6
a=
)he cumulative distriuted function and the proaility distriuted function of W
m
are
( )
N
*
y F y F
m
. - . -

( ) . - . - . -
D
y 4 y F N y 4
N
*
m

)hen
>PP
a=
6
a=
C C
D
ii. If

m +, , the scheduler metric can e e0pressed as<
m +
+
m
ran; )
,
B
6
a=
C would e in this case<
%%$
a=
6
a=
C C
B
)hen, the proportional fair scheduling average throughput per time slot and per transmit antenna
converges to<
B D
. 3r-
D
. 3r-
D
D
6
a=
6
a=
PF$
a=
C
N
C
N
C +
,
_

*ys=om/&NI) BPPL
JL
)hen, the proportional fair scheduling throughput in analytical form can e written as<
( )
B D
. - D
D
. -
D
D
6
a=
6
a=
PF$
a=
C F
N
C F
N
C

+
,
_

2here
( ) ( )
t t r inc
M M M F , D D +
And
( ) ( )
t t r inc
M M M F , D D +
)hen, the result of proportional fair scheduling throughput in analytical form can e written as
( ) ( ) ( )
B D
, D
D
, D D
D
D
6
a= t t r inc
6
a= t t r inc
PF$
a=
C M M M
N
C M M M
N
C + + +
,
_

-I.BI.
In this susection, the performance of the proportional fair scheduling scheme is
evaluated and compared with the theoretical results in terms of system throughput. Figure DJ and
figure DK are carried out to demonstrate that the system throughput increase with the growth of
the numer of antennas and with the value of the average *N,. In these two figures, we use
t
c
=?.. and N=A..
Figure DJ and figure DK show the system throughput of simulation and theoretical results
versus the numer of active users.
2e note that the system throughput in analytical form and that otained y simulation
converges to the same numer of system throughputs. According to these comparisons, we can
conclude that the proposed analytical solution can e correct.
*ys=om/&NI) BPPL
JM
0 5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
7
8
9
S
y
s
t
e
m

t
h
r
o
u
g
h
p
u
t

i
n

b
p
s
/
H
z
M
t
S M
r
S J
M
t
S M
r
S B
*imulation
)heoretical
Figure DJ< &ffect of the variation of the numer of antennas in 3F* throughput
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
4
5 10 15 20 25 30 35 40
0
0.5
1
1.5
2
2.5
3
3.5
4
S
y
s
t
e
m

t
h
r
o
u
g
h
p
u
t

(
b
p
s
\
H
z
)
Average SNR=5dB
Average SNR=0dB
AverageSNR=-5dB
Theoretical
Simulation
Figure DK< &ffect of the variation of the average *N, value in 3F* throughput
*ys=om/&NI) BPPL
JN
3. The reduced feed1ac2 techni3ue
)he different scheduler schemes are analy1ed in the previous section and the solution for
the different scheduler throughputs in an analytical form is presented. )he optimality of the
different schedulers comes from the e0pense of a full channel state information -=*I. reporting
which leads to a large feedack urden.
)o solve this issue, we propose a reduced comple0ity scheduler scheme, where each
moile user sorts the post detection signal to interference plus noise ratio -*IN,. of all spatial
channel -M
t
. and sends ack to the node station the K highest channel6s *IN, -K F M
t
..
If the numer of users in the system is large enough compared to M
t
, the reporting of the
strongest spatial channel y each user provides the full =*I scheduler throughput. )hen, the
ma0imum throughput is achieved in the cost of M
t
feedack signalling instead of M
t
N -where
N denotes the numer of users.. Hence, the feedack signalling is reduced to KN. )he scheduler
allocates the spatial channel m to the strongest reported user6s channels according to scheduler.
Here, there are two situations<
i. )here are some users that have reported their estimates. Accordingly, the system will
work as the full =*I scheduler.
ii. No user has reported its estimate, and then the system can use one of the two
strategiesF
a. Non 3ost *election -N3*.< following the spatial channel m is not allocated to
any user. )he average rate loss is measured y the proaility< the spatial channel m
th
of
each user is sorted in an order greater than K. )hen the average rate of n
th
user = is
)))
a=
N
t
t NP$
a=
C
M
K M
C
,
_
,
_

D
-I.BJ.
. 3ost *election -3*.< the m
th
spatial channel m is allocated to the user that has
een scheduled in the latest time slot< the post selected user. &ach user can e selected for
the non reported spatial channel.
*ys=om/&NI) BPPL
JO
)hen, the +
th
user average rate C is<

NP$
a=
N
t
t P$
a=
C
M
K M
N
C
,
_
,
_

+
D
D
-I.BK.
)his result would e validated y simulations. )he proposed scheduler which uses partial
=*I instead of the full =*I is referred to us< reduced feedack scheduler scheme -,F/RRR..
2here RRR denoted #33 if we have the opportunistic scheme and 3F* if we have the
proportional fair scheduling scheme.
3.1 2)-O'' sche"e si"u!ation
In this susection, the performance of the reduced feedack techni!ue applied to the
opportunistic scheme is evaluated and compared with the system throughput of the full feedack
techni!ue. Figure DL shows the effect of the variation of the numer of signalling feed ack K in
system throughput with t
c
of KPP, average *N, of K d" and with numer of users N of JP.
5 10 15 20 25 30 35 40
0
5
10
15
N
o
r
m
a
l
i
z
e
d

S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
K=1
K=2
K=4
Figure DL< ,F/#33 simulation with M
t
= A- t
c
= ?..
2e note that the system throughput increases with the numer of active users and
saturates after N\BP. )o confirm this, three simulation are carried out for different numer of
*ys=om/&NI) BPPL
KP
signalling feedack K S D, K S B and K S J S M
t
. In addition to that, we note that the system
throughput for a large numer of active users converges to the optimal throughput in the three
simulations. According to these comparisons, we can conclude that the proposed reduced
feedack techni!ue is a good idea that reduce comple0ity and give the same performance.
3.2 2)-')S sche"e si"u!ation
)he same study is accomplished to the proportional fair scheduling. In this susection,
the performance of the reduced feedack techni!ue applied to the proportional fair scheduling
scheme is evaluated and compared with the system throughput of the full feedack techni!ue.
Figure DM shows the effect of the variation of the numer of signalling feed ack K in system
throughput with t
c
of KPP, average *N, of K d" and with numer of users N of JP.
0 5 10 15 20 25 30 35 40
0
1
2
3
4
5
6
N
o
r
m
a
l
i
z
e
d

S
y
s
t
e
m

T
h
r
o
u
g
h
p
u
t
(
b
i
t
s
/
s
e
c
/
H
z
)
K=1
K=2
K=4
Figure DM< ,F/3F* scheme simulation with M
t
= A- t
c
= ?..
2e note that the system throughput for a large numer of active users converges to the
optimal throughput in the three simulations. According to these comparisons, we can conclude
that the proposed reduced feedack techni!ue reduce comple0ity and give the same performance
that we have a full feedack scheme.
*ys=om/&NI) BPPL
KD
4. Conclusion
)he round roin scheduling, the opportunistic and the proportional fair scheduling
throughputs have een analy1ed in this chapter. In these schemes the transmit antennas are
assigned to different users at each time slot where we have a full uplink feedack channel. After
that, we have proposed a reduced feedack techni!ue and applied in the opportunistic and the
3F* schemes to reduce comple0ity and validate y simulation.
*ys=om/&NI) BPPL
KB
C$+C&%SI$+
In this master thesis, we have investigated the different schedulers in two ways. 2hen all
M
t
transmit antennas are assigned to one user or allocated dynamically to different users at each
time slot. 2e have presented the system model used in this work. 2e have developed the post
detection *IN, e0pression using the ;F receiver in *M system. 2e have also descried the
different schedulers and given their capacity in an analytical form. Furthermore, through
simulation results, we have validated the performance of these schedulers in terms of system
throughput using the theoretical results.
In this study, we have a full uplink feed ack then we have the optimal case. )o solve this
issue, we have proposed a reduced comple0ity scheme, where each moile user sorts the -*IN,.
of all transmit antennas -M
t
. and sends ack to the node station the K highest channel6s *IN, -K
Q M
t
.. )herefore, we have investigated the techni!ue of reduced feedack for the opportunistic
and the 3F* schedulers and validated their simulations to prove that this new scheme gives the
same performance as the optimal scheme.
Future 2ork
In this study, we have used the ;F detectors to develop the capacity in the analytical form and to
make simulations. "esides, we have investigated all schedulers in the MIM# system.
2e can propose in the future work<
)o use the MM*& detectors to develop the capacity in the analytical form and to make
simulations.
)o investigate the different schedulers in the MIM#/#FDM system.
*ys=om/&NI) BPPL
KI
,eferences
)'F')'+C'S
GDH *. M. Alamouti, ]A simple transmit diversity techni!ue for wireless communications,^ I&&&
_. *elect. Areas =ommun., vol. DL, pp. DJKD/DJKN, #ct. DOON.
GBH A. F. Molisch, M. ;.2in, and _. H.2inters, ]=apacity of MIM# systems with antenna
selection,^ in 3roc. I&&& Int. =onf. on =ommun., vol. B, pp. KMPUKMJ, BPPD.
GIH '. _. Foschini and M. _. 'ans, ]#n limits of wireless communications in a fading
environment when using multiple antennas,^ 2ireless 3ersonal =ommun., vol. L, pp. IDK/
IIK, Mar. DOON.
GJH 3. 2. 2olniansky, '. _. Foschini, '. D. 'olden, and ,. A. >alen1uela, ]>/"%A*)< an
architecture for reali1ing high data rates over the rich/scattering wireless channel,^ in 3roc.
$,*I Int. *ymp. *ignals, *ystems, and &lectronics, 3isa, Italy, *ept./#ct. DOON, pp. BOK/IPP.
GKH ;heng and D. N. =. )se, ]Diversity and multiple0ing< A fundamental tradeoff in multiple
antenna channels,^ I&&& )rans. Inf. )h., vol. JO, pp. DPMIUDPOL, May BPPI.
GLH ,.2. Heath, _r., *. *andhu, and A. 3aulra@, ]Antenna selection for spatial multiple0ing with
linear receivers,^ I&&& =omm. %etters, vol. K, pp. DJBUDJJ, April BPPD.
GMH ,.2. Heath and A. 3aulra@, ]*witching etween diversity and multiple0ing in MIM#
systems,^ I&&& )rans. =omm., vol. KI, N#. L, _une BPPK.
GNH Daniel 3(re1 3alomar ]A $nified Framework for =ommunication through MIM# =hannels,^
Doctoral )hesis, "arcelona, May BPPI.
GOH D. 'ore, ,. 2. H. _r., and A. 3aulra@, ]#n performance of the 1ero forcing receiver in
presence of transmit correlation,^ in 3roc. I&&& Int. *ymp. on Info. )heo., p. DKO, BPPB.
GDPH D. 'ore, ,. 2. Heath, _r., and A. 3aulra@, ])ransmit selection in spatial multiple0ing
systems,^ I&&& =omm. %etters, vol. L, pp. JOD UJOI, Nov. BPPB.
GDDH _ing %iu, ]%inear *)"= Design for MIM# *ystems with MM*& ,eceivers^ Master
)hesis, McMaster $niversity _une BPPJ.
GDBH #./*. *hin and +. ". %ee, ]Antenna/assisted round roin scheduling for MIM# cellular
systems,^ I&&& =ommun. %ett., vol. M, pp. DPO/DDD, Mar. BPPI.
*ys=om/&NI) BPPL
KJ
,eferences
GDIH ,. 2. Heath, M. Airy, and A. _. 3aulra@, ]Multiuser diversity for MIM# wireless systems with
linear receivers,^ in 3roc. Asilomar =onf. *ignals, *ystems, and =omputers, 3acific 'rove, =A, $*A,
Nov. BPPD, pp. DDOJ/DDOO.
GDJH >. +. N. %au, W. %in, and ). A. =hen, ]#ptimal multi/user space time scheduling for wireless
communications,^ in 3roc. I&&& >eh. )echnol. =onf. Fall, >ancouver, =anada, *ept. BPPB, pp. DOIO/
DOJB.
GDKH >incent +. N. %au, ]3roportional fair space/time scheduling for wireless communications^, I&&&
)rans. =omm., >ol. KI, N#. N, August BPPK.
GDLH A. 3aulra@, ,. Naar and D. 'ore, ]Introduction to *pace/)ime 2ireless
=ommunications^ =amridge $niversity 3ress BPPI.
GDMH _ia *hen ]Iterative Multiuser Detection^ Doctoral )hesis, $niversity of Work IPth
*eptemer BPPJ.
GDNH #livier ,oy, ]#ptimal &stimator/Detector ,eceivers for *pace/)ime "lock =oding,^
Master`s degree, =ommunication *ystems Division -**=., *chool of =omputer and
=ommunication *ciences -Ia=., *wiss Federal Institute of )echnology %ausanne -&3F%.,
March BPPJ.
GDOH 2. _akes _r., ]Microwave Moile =ommunications,^ _ohn 2iley a *ons, New Work,
DOMJ.
GBPH 2. = %ee, ]&ffects on =orrelation "etween )wo Moile ,adio "ase *tation Antennas,^
I&&& )rans. on =ommunications, vol. com/BD, no. DD, pp. DBDJ/DBBJ, Novemer DOMJ.
GBDH &. )elatar, ]=apacity of Multi/antenna 'aussian =hannels,^ )echnical Memorandum,
A)a) "ell %aoratories, DOOK.
GBBH =. &. *hannon, ]A Mathematical )heory of =ommunication,^ "ell *ys. )ech. _ournal,
vol. BM, pp. IMO/JBI, DOJN.
GBIH Neng 2ang, ])ransmit optimi1ation for multicarrier and multiple input multiple output
wireless communication,^ Doctoral )hesis, bueen6s $niversity +ingston, #ntario, =anada
May BPPK
GBJH Francesco *averio #stuni,^ Iterative processing for space/time multiuser wireless
communications^, Doctoral )hesis, +ing`s =ollege %ondon Decemer BPPJ.
GBKH _. '. Andrews, ]Interference cancellation for cellular systems< A contemporary
overview,^ I&&& 2ireless =ommunications Maga1ine, vol. DB, no. B, pp. DOUBO, Apr. BPPK.
*ys=om/&NI) BPPL
KK
P%#&ICA7I$+
During the development of this master thesis, four papers were written and sumitted for
pulication. At the moment, we have the acceptance of two paper descried as follow
Imen *faihi and Noureddine HAMDI ])heoretical Analysis of =apacities in Dynamic
*patial Multiple0ing MIM#^ Ird International =onference on *ignal 3rocessing,
I=*3`PL, "udapest, Hungary, May BL/BN, BPPL.
Imen *faihi and Noureddine HAMDI ]Analysis of *cheduling )hroughput in 2ireless
MIM# 3acket )ransmission *ystems with ;F Detectors^ Ird International *ymposium on
ImageC>ideo =ommunications over fi0ed and moile networks Hammamet, )unisia on
*eptemer DI/DK, BPPL.
*ys=om/&NI) BPPL
KL
Appendi0
APP'+I?
A-8:
)ake singular value decomposition -*>D. on the channel matri0 H such that
H H
G H H
1
]
1
P
B C D
-A.D.
2here $ and > are unitary matrices with dimension
r r
M M and t t
M M
respectively,
B C D
H

is a t t
M M
diagonal matri0 and P is an
( ) ( )
t r t
M M M 1ero matri0. Now the e!uation
-D.BJ. ecomes
[ ]
D
B B C D
P P
P
P

,
_
1
]
1
+
H H
t
t
M n
H
H
t
t
MM$E
H H
M
P
I H G
M
P
W
t
-A.B.
[ ]
H H
t
t
M n H
t
t
H
M
P
I G
M
P
t
D
B B C D
P P
P
P

,
_
1
]
1
+
[ ]
H
H H
t
t
M n
t
t
H
M
P
I G
M
P
t
P
B C D
D
B
,
_
[ ]
H
H
H
H
t
t
M n
t
t
H G G G
M
P
I
M
P
t
P
B C D
D
B
,
_

H H
t
t
M n
t
t
H H H
M
P
I
M
P
t
D
B

,
_
+
H H
M
t
n t
t
t
H H H I
P
M
P
M
t
D
B

,
_
+

H
M
t H
t
t
H I
M
H H
P
M
t
D
,
_
Proo. @ 8:
*ys=om/&NI) BPPL
KM
Appendi0
[ ]
H H H H
MM$E
H
MM$E
t
t
H6 HH 6H W HH W
M
P
1
]
1
2here
H
t
t
MM$E
6H
P
M
W
and '
H
S '.
[ ]
1
]
1
1
]
1
+
1
]
1
+ 6 I
M
I
M
H H I
M
I
M
H H 6 H6 HH 6H
t t t t
M
t
M
t H
M
t
M
t H H H

1
]
1
1
]
1
1
]
1

6 I
M
6 I
M
6 6
t t
M
t
M
t

D D
1
]
1
1
]
1
1
]
1
6
M
I 6
M
I
t
M
t
M
t t

B
1
]
1
6
M
I
t
M
t
B
B

,
_
+ 6
M
6
M
I
t t
M
t

[ ]
1
]
1
1
]
1
6 6HH
M
6 6HH
P
M
W W
H t H
t
t
n
H
MM$E MM$E n

B B
1
]
1
1
]
1
+
1
]
1
6 I
M
I
M
HH 6
M
6 6HH
M
t t
M
t
M
t H t H t

6 6
M
I
M
t
M
t
t 1
]
1
,
_
6
M
6
M
t t

Proo. @ 2:
( )
B
B
H 6H H W
M
P
H
MM$E
t
t
,
_
,
_
1
]
1
+
t t
M
t
M
t H
I
M
I
M
H H 6

B
,
_
6
M
I
t
M
t
*ys=om/&NI) BPPL
KN

Niversité Unis EL Anar

Uploaded by

Document Information

Original Description:

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

Niversité Unis EL Anar

Uploaded by

Copyright:

Available Formats

UNIVERSIT TUNIS EL MANAR

Mmoire de Mastre Systmes de Communications

Average signal to noise ratio at each receiver antenna

is the average received *N,.

, the average *N, at each receiving antenna.

-see proofUB in the appendi0.

and outperforms the ;F receiver that

is the average *N, at each of the receive antennas.

can e given y<

If we use the method of integrating y partsF we have

If we apply the theorem of changing the varialeF we have

is the *IN, at the receiver of the channel from the m

If we use the method of integrating y partsF we have

You might also like