MIMO-Rake Receiver in WCDMA
MIMO-Rake Receiver in WCDMA
MIMO-Rake Receiver in WCDMA
=
=
. (2)
Where
1
b
PT =
, for 0 t <
b
T , and
0
b
PT =
, otherwise. The spreading signal
( )
k
t a
can be expressed as:
( ) ( )
k
k i c
i
t t i T a a
=
=
.. (3)
Where ( ) t is a chip wave form that is time limited to
[0, ]
c
T
and normalized to have energy
c
T
, where
Pravindra Kumar et al. / International Journal of Engineering Science and Technology (IJEST)
ISSN : 0975-5462 Vol. 3 No. 10 October 2011 7531
2
0
( )
c
T
c
t dt T =
}
is the chip period, and
( ) k
i
a is the
th
i chip value of k
th
user; This chip value can be either -1 or +1.
If
c
T
is the chip period and there are
c
N
chips per bit, thus
c b c
N T T = is the spreading factor of user K. Let the
desire user is K=0 and all other users contribute to MAI.
If ( )
k
h t is the low pass impulse response of the Frequency Selective Fading channel then-
,
, ,
1
( ) ( )
k
k
k l
k
k k l k l
k
k
L
j
t
l
t h e
=
=
.. (4)
Where
, k l
k
and
, k l
k
are the phase and time delays introduced by the channel; they can be assumed to be random
variables uniformly distributed in [0, 2 ) and [0,
max
T
) respectively, where
max
T
is the maximum delay at which
there can be multipath ray.
k
L is the number of multipaths generated by frequency selective channel for the k
th
transmitted signal.
, k l
k
are the path gain components with Rayleigh distribution:
2
2
( ) e x p f
=
`
)
. . (5)
The received signal is:
( ) ( ) . ( ) ( )
k i
r t h t S t n t = +
.. (6)
Thus the total received signal can be written as:
( ) ( ) ( )
1
, , , ,
0
1
2 ( ) ( ) ( )
k
k k l k k l k k l c k l
k k k k
k
k
k
L
P b t C o s C o s t
l
r t t a t n t
=
=
= + +
(7)
Where ( ) n t is Additive White Gaussian Noise (AWGN) with a two sided power spectral density of No/2 .Where
No is the noise power spectral density measured in watts/hertz (joules). Now the decision statistic is:
0 0 0 , 0
0
( ) ( ) ( )
b
T
c
Z r t a t Cos t dt =
}
0
1
0
0 0 , 0 ,
0 [ 1, 1]
2
k
k
L K
b k l
k
k l l
P
b T
= =
= + +
. (8)
Where
0
b is the transmitted bit from user
0,0
0, is the amplitude of the desired multipath component,
0
P is the
transmitted power of the desired user, and
0 0 , 0
0
( ) ( ) ( )
b
T
c
n t a t C o s t d t =
}
. (9)
is a Zero-mean Gaussian random variable with variance
2 0
4
b
N T
=
, we can re-write the decision statistic in
(8) as -
0 0
Z D = + +
(10)
Where
0
D
- desired signal component (1
st
term in (8)), - the MAI (2
nd
term in (8)), and - the AWGN.
In case of cellular networks, it is worth to decompose the MAI term in to two distinct contributes:
0 I
= +
,
where
0
is the interfering signal due to users within the same cell of the desired user (own-cell interference)
and
I
is the interfering signal due to presence of active users in other cells surrounding the cell of interest
(inter-cell interference). Hence:
0 0 0 I
Z D = + + +
. (11)
It is conceivable to suppose that 0 and I is statistically independent.
II. GENERALIZED RAKE RECEIVER :-
The block diagram of Generalized Rake Receiver is in fig.4. Here
*
( )
k
h t
is the estimated channel value. The
channel estimated value is multiply with the each received signal and do the integration from 0 to
b
T
after this
calculate the summation of all the estimated signal. The real part of this is known as the decision variable and
then pass it through the decision device to get the decision about the bit whether it is 0 or 1. With the concept of
Rake receiver in multipath fading channel the useful term in (10) becomes [8]:
0
0
0
0 0 ,
1
2
o
L
b l
l
P
D T
=
=
.. (12)
Here
0
l indicates the number of multipath rays relative to the useful signal, received with amplitude
0
0 0,l
P
Pravindra Kumar et al. / International Journal of Engineering Science and Technology (IJEST)
ISSN : 0975-5462 Vol. 3 No. 10 October 2011 7532
Fig.4. Block Diagram of Generalized Rake Receiver.
In case of frequency-selective fading, with the hypotheses of identical mean number L of multipaths for each
source and identical mean number of users per cell, it is possible obtaining:
0 0 0
2 2 2 2
2 2 2
, 0 ,
0 { } { }{ 1} { }{ 1}
3 3
k
b
k k l
c
b
c
A T A T
E E K E L K
N N
= +
2 2 2
2
0
( 1) 2
{ }
3
b
c
L K A T
E
N
=
.(13)
1 1 1
2 2
2 2 4
,
{ } { } { }
3
k
b
I k l k
c
A T
E E E L K
N
=
2 2
2
2
5 3
b
c
LK A T
N
=
.. (14)
Where
0
0
,
k
k l
}
(16)
Where
m
U
represent the decision variables;
*
( )
lm
S t
is the transmitted signal transmitted signal and
( )
l
r t
is the
received signal. If the transmitted signal is
1
( )
l
S t
, then the received signal is:
1
1
( ) ( / ) ( )
M
l n l
n
r t h S t n w n t
=
= +
(17)
Thus -
* *
1
1 1
0
Re ( / ) ( / )
b
T
M M
m k n l lm
k n
U h h S t n w S t k w dt
= =
(
=
(
(
}
* *
1
0
Re ( ) ( / )
b
T
M
k lm
k
h n t S t k w dt
=
(
+
(
(
}
; 1, 2 m=
..... (18)
If we assume that our binary signals are designed to satisfy this property then,
2
*
1
1
0
Re ( / ) ( / )
b
T
M
m k l lm
k
U h S t k w S t k w dt
=
(
=
(
(
}
* *
1
0
Re ( ) ( / )
b
T
M
k lm
k
h n t S t k w dt
=
(
+
(
(
}
; 1, 2 m= ..... (19)
When the binary signals are antipodal, a single decision variable suffices. In this case reduces to:
2
1
1 1
R e 2
M M
b k k k
k k
U E N
= =
(
= +
(
; Where
k k
h =
and *
0
( ) ( / )
b
T
j k
k i
N e n t S t k w dt
=
}
...(20)
Pravindra Kumar et al. / International Journal of Engineering Science and Technology (IJEST)
ISSN : 0975-5462 Vol. 3 No. 10 October 2011 7533
BIT-ERROR PROBABILITY FOR GENERALIZED RAKE RECEIVER- For coherent BPSK with
Rayleigh Frequency Selective Fading channel with using convolution coding at the transmitter side the coded
bit-error probability of Rake with MRC assuming identical noise in each branch is [4]:
1 1
0
1 1
2 2
M j
M M j
c
j
j
BEP
+
=
+ | | | | | |
=
| | |
\ . \ . \ .
.. (21)
Where-
0
2
1
2
1 1 1
2. . 3. . 5
c
b a c
N M
LK
r E D N
=
( | |
+ + +
| (
\ .
Where M is the number of fingers in Rake Receiver,
c
M
is the interfering cells equipped by conventional
correlation type receiver at the base station with perfect implementing the power control. L is the number of
multipaths per signal.
b
E is the energy per bit and
0
2 N
is the two-sided power spectral density of the thermal
noise,
a
D
is the directivity of Base station antenna, r is the code rate of error control coding (convolutional
coding),
c
N
is the spreading factor, Kis the number of users using the channel simultaneously.
Now if we are using viterbi decoding [9] at the receiver side. The BER performance of Generalized Rake
Receiver is-
( )
( ) 1; 1; 2 1
; ;
c c
N
J N D BEP BEP
d
BER T D J N
d
= = =
. (22)
Where
( ) ; ; T D J N
denotes the transfer function of the signal flow graph. The exponent of D on a branch
describes the hamming weight of encoder output corresponding to that branch. The exponent of J is always
equal to 1, since the length of each branch is one. The exponent of Ndenotes the number of 1s in the
information sequence for that path. (i.e. for input 0, exponent of N is 0 and for input 1, it is equal to1).
III. MIMO-RAKE RECEIVER-
This section has two sub sections-
A. MIMO with ML Equalization-
In this paper, we will discuss another receiver structure called Maximum Likelihood (ML) decoding [10], [11]
which gives us an even better performance. Now we assume that the channel is a flat fading Rayleigh multipath
channel and the modulation is BPSK.
Fig.5. MIMO Structure
In a 22 MIMO channel with two transmit antennas if we have a transmission sequence, for example
1 2 3
, , ,.......,
n
X X X X
, In normal transmission, we can send
1
X
in the first time slot,
2
X
in the second time slot,
3
X
and so on. Now as we now have 2 transmit antennas, we may group the symbols into groups of two. In the
first time slot, send
1
X
and
2
X
from the first and second antenna. In second time slot, send
3
X
and
4
X
from the
first and second antenna, send
5
X
and
6
X
in the third time slot and so on. From here we notice that by grouping
two symbols and sending them in one time slot, we need only 2 n time slots to complete the transmission i.e.
data rate is doubled. This forms the simple explanation of a MIMO transmission scheme with two transmit
antennas and two receive antennas.
Let us now try to understand the math for extracting the two symbols which interfered with each other. In
the first time slot, the received signal on the first receive antenna is,
1
1 1,1 1 1, 2 2 1 1,1 1, 2 1
2
X
Y h X h X n h h n
X
(
( = + + = +
(
.. (23)
Pravindra Kumar et al. / International Journal of Engineering Science and Technology (IJEST)
ISSN : 0975-5462 Vol. 3 No. 10 October 2011 7534
The received signal on the second receive antenna is,
1
2 2 ,1 1 2 , 2 2 2 2 ,1 2 , 2 2
2
X
Y h X h X n h h n
X
(
( = + + = +
(
.. (24)
Where-
1
Y
,
2
Y
are the received symbol on the first and second antenna respectively,
1,1
h
is the channel from first
transmit antenna to first receive antenna,
1, 2
h
is the channel from second transmit antenna to first receive
antenna,
2,1
h
is the channel from first transmit antenna to second receive antenna,
2,2
h
is the channel from
second transmit antenna to second receive antenna,
1
X
and
2
X
are the transmitted symbols and
1
n
,
2
n
is the
noise on first and second receive antennas. We assume that the receiver knows
1,1
h
,
1, 2
h
,
2,1
h
and
2,2
h
. The
receiver also knows
1
Y
and
2
Y
. The unknowns are
1
X
and
2
X
.
For convenience, the above equation can be represented in matrix notation as follows:
1,1 1, 2
1 1 1
2 2,1 2, 2 2 2
h h
Y X n
Y h h X n
(
( ( (
= +
(
( ( (
. (25)
Equivalently, Y HX n = + (26)
We have assume here that - The channel experience by each transmit antenna is independent from the channel
experienced by other transmit antennas. The channel experienced between each transmit to the receive antenna
is independent and randomly varying in time. The channel is known at the receiver.
Maximum Likelihood (ML) Receiver - The Maximum Likelihood receiver tries to find
X (estimate of the
transmitted symbol X) which minimizes,
2
J Y HX =
. If we are using BPSK modulation, the possible values
of
1
X is +1 or -1 similarly
2
X also take values +1 or -1. So, to find the Maximum Likelihood solution, we
need to find the minimum from the all four combinations of
1
X
and
2
X .
2
J Y HX =
. (27)
So-
2
1,1 1, 2
1 1
2 1,2 2,2
2
h h
Y X
J
Y h h
X
(
(
(
= (
(
(
(
. (28)
The four combination of
1
X
and
2
X
are : +1,+1; +1,-1; -1,+1; -1,-1. Therefore-
2 2
1,1 1,2 1,1 1,2
1 1
1, 1 1, 1
2 1,2 2,2 2 1,2 2,2
2
1,1 1,2 1,1 1,2
1 1
1, 1 1, 1
2 1,2 2,2 2 1,2 2,2
1 1
;
1 1
1
;
1
h h h h
Y Y
J J
Y h h Y h h
h h h h
Y Y
J J
Y h h Y h h
+ + +
+
( ( + + ( ( ( (
= =
( (
( ( ( (
+
( ( ( (
= =
(
( ( (
+
2
1
1
`
( (
(
(
)
.. (29)
The estimate of the transmit symbol is chosen based on the minimum value from the above four values i.e. if the
minimum is
[ ]
1, 1
1 1 J
+ +
, if the minimum is
[ ]
1, 1
1 0 J
+
, if the minimum is
[ ]
1, 1
0 1 J
+
and if the
minimum is
[ ]
1, 1
0 0 J
.
The results for 22 MIMO with Maximum Likelihood (ML) equalization [11] helped us to achieve a
performance closely matching the 1 transmit 2 receive antenna Maximal Ratio Combining (MRC) case.
B. BIT-ERROR PROBABILITY FOR GENERALIZED MIMO RAKE RECEIVER-
For coherent BPSK with Rayleigh Frequency Selective Fading channel with using convolution coding at the
transmitter side the coded bit-error probability of MIMO-RAKE Receiver with ML equalizer, assuming
identical noise in each branch, is given as-
1 1
0
1 1
2 2
d j
d d j
c
j
j
BEP
+
=
+ | | | | | |
=
| | |
\ . \ . \ .
.. (30)
Pravindra Kumar et al. / International Journal of Engineering Science and Technology (IJEST)
ISSN : 0975-5462 Vol. 3 No. 10 October 2011 7535
Where-
0
2
1
2
1 1 1
2. . 3. . 5
c
b a c
N M
L K
r E D N
=
( | |
+ + +
| (
\ .
. d M A = ; M is the number of Rake fingers attached with one antenna in MIMO arrangement; Ais the
number of Antenna used in MIMO arrangement.
IV. PERFORMANCE ANALYSIS-
In Fig.6 the number of multipaths L =8; the number of Users K=3; Spreading Factor
c
N
=32; Antenna
Directivity
a
D
= 5dB; Number of Interfering Cells
c
M
=4; n umber of Rake Fingers M =3; Code Rate r =1/2;
Constraint length
L
C
=3. From this at BER value of
4
10