Professional Documents
Culture Documents
Joint Synchronization and Channel Estimation For MIMO-OFDM Systems Using EM Algorithm
Joint Synchronization and Channel Estimation For MIMO-OFDM Systems Using EM Algorithm
Joint Synchronization and Channel Estimation For MIMO-OFDM Systems Using EM Algorithm
=
and variance. 2
1
2
i
h
=
.
3.The channel between each transmit and receive antenna varies randomly with time. However, the channel is
assumed to remain constant over two time slots.
4. On the receive antenna, the noise w has the Gaussian probability density function with
2
2
2
( )
2
1
2
( )
n
e p n
=
with
0 =
and
2 0
2
N
=
.
5. The channel is known at the receiver.
Receiver with Alamouti STBC
In the first time slot, the received signal is,
| |
1
1 1 1 2 2 1 1 2 1
2
s
y h s h s w h h w
s
(
= + + = +
(
(1)
In the second time slot, the received signal is,
| |
*
* * 2
2 1 2 2 1 2 1 2 2
*
1
s
y h s h s w h h w
s
(
= + + = +
(
(2)
where y1 and y2 is the received symbol on the first and second time slot respectively, h1 is the channel from 1st
transmit antenna to receive antenna, h2 is the channel from 2nd transmit antenna to receive antenna, s1 and s2 are the
transmitted symbols and w1 and w2 is the noise on 1st and 2nd time slots.
Since the two noise terms are independent and identically distributed,
IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm
A Publisher for Research Motivation........ Email: editoriijec@ipasj.org
Volume 2, Issue 8, August 2014 ISSN 2321-5984
Volume 2, Issue 8, August 2014 Page 56
2
1 1 *
1 2 * 2
2
2
0
0
w w
E w w
w
w
(
(
( ( =
`
(
( )
(3)
For convenience, the above equation can be represented in matrix notation as follows:
1 1 2 1 1
* * * *
2 2 1 2 2
y h h s w
y h h s w
( ( ( (
= +
( ( ( (
(4)
Let us define
1 2
* *
2 1
h h
H
h h
(
=
(
. To solve for
1
2
s
s
(
(
,we need to find the inverse of H. We know that, for a general m x
n matrix, the pseudo inverse is defined as,
( )
1
H H
H H H H
+
=
(5)
The term,
( )
2 2
*
1 2 1 2 1 2
* * * 2 2
2 1 2 1
1 2
0
0
H
h h h h h h
H H
h h h h
h h
(
+ ( (
( = =
( (
( +
(6)
Since this is a diagonal matrix, the inverse is just the inverse of the diagonal elements, i.e.,
( )
2 2
1
1 2
2 2
1 2
1
0
1
0
H
h h
H H
h h
(
(
+
(
=
(
(
+
(
(7)
The estimate of the transmitted symbol is,
( )
( )
( )
1
1 1
*
2 2
1
1 1
*
2 2
1
1 1
*
2 2
H H
H H
H H
s y
H H H
s y
s w
H H H H
s w
s w
H H H
s w
( (
=
( (
| | ( (
= +
|
( (
\ .
( (
= +
( (
(8)
BER with Almouti STBC
Two transmitting antennas are used in Alamoutis STBC. Hence the total transmit power in the Alamoutis scheme
is twice that of the power used in 1Tx, 2Rx system that uses MRC. The BER for BPSK modulation in Rayleigh
channel with 1 transmit, 2 receive case is, on MRC
2
,
[1 2(1 )]
e M R C M R C M R C
P P P = +
(9)
where .
1
2
0
1 1 1
1
2 2
MRC
b
P
E
N
| |
|
| = +
|
|
\ .
(10)
With Alamoutis 2 transmit antenna, 1 receive antenna STBC case,
1
2
0
1 1 2
1
2 2
S TBC
b
P
E
N
| |
|
| = +
|
|
\ .
(11)
and BER is
| |
2
,
1 2(1 )
e STBC STBC STBC
P P P = +
(12)
IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm
A Publisher for Research Motivation........ Email: editoriijec@ipasj.org
Volume 2, Issue 8, August 2014 ISSN 2321-5984
Volume 2, Issue 8, August 2014 Page 57
4. DETECTION TECHNIQUES
1. Linear ZF Detection
Linear ZF detection is a common approach in MIMO detection, due to the simplicity of implementation without any a
priori knowledge of noise statistics as compared to MMSE detection. The mathematical expression of ZF filter is given
by
(13)
Thus the symbol estimate of ZF detection can be written as
(14)
we can observe that the performance of ZF detection is mainly affected by
(15)
Using SVD, the post-detection noise power can be decomposed
(16)
where the quantity denotes the equivalent signal power of the
i
th transmit antenna the receiver. The noise
enhancement effect will be enlarged if becomes small, which implies that the signals from the
i
th transmit
antenna experience the null channel. In other words, the
i
th singular value of H is close to zero. In the following
subsection, the MMSE detection will be presented, and the noise enhancement will be reduced by introducing statistical
information of the noise.
2. Linear MMSE Detection
Linear MMSE detection is based on the minimum mean square error criterion, which maximizes the SINR after
detection. The linear MMSE filter is given by
(17)
Hence, the output of linear MMSE detection can be evaluated as
(18)
Similar to ZF detection using SVD, the post-detection noise power can be expressed as
(19)
From the above equation, the noise enhancement is significantly reduced. If the equivalent signal power becomes
small, the mean square error will be close to zero.Hence, the noise enhancement in MMSE filter is
less critical compared to that in ZF filter.
3. ML Detection
Maximum likelihood (ML) detection is the optimum approach to detect the symbols from multiple transmit antennas
without iterative processing. In other words, ML detection can be considered as MAP detection without the aid of a
priori information. Defining C as a set of constellation points, and Nt as the number of transmit antennas , the ML
metric can be expressed as
(20)
where the quantity denotes all combinations of transmit symbols. The ML criterion calculates all combinations of
transmit symbols, and chooses one particular combination with the minimum Euclidean distance. Because the ML
IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm
A Publisher for Research Motivation........ Email: editoriijec@ipasj.org
Volume 2, Issue 8, August 2014 ISSN 2321-5984
Volume 2, Issue 8, August 2014 Page 58
metric will test every possible constellation point combination, its complexity will increase exponentially with the
number of transmit antennas. Hence, the application of ML detection will be prohibitive for high order modulation and
a large number of transmit and receive antennas.
5. EM ALGORITHM-BASED CHANNEL ESTIMATION
The proposed EM (Expectation-Maximization) algorithm has been widely used in a large number of areas that deal
with unknown factors affecting the outcome, such as signal processing, genetics, econometric, clinical, and sociological
studies. The EM-based channel estimation is an iterative technique for finding maximum likelihood (ML) estimates of
a channel. It is classified as a semi-blind method since it can be implemented when transmit symbols are not available.
Suppose that X is one of the C-
ary
symbols in the constellation of size C, such that X where Xi denotes
the
i
th symbol in the constellation. Then, the received signal for some subcarrier is given
Y=H.x+n (21)
The conditional probability density function of Y given H and X can be expressed as
(22)
Assuming that are transmitted with the same probability of 1/C, the conditional probability density function
of Y given H is
(23)
Assuming that the channel is not time-varying over D OFDM symbols, denote those
transmitted and received symbols in a vector form as
(24)
(25)
In the context of EM algorithm, Y is called incomplete data since the transmitted (latent) data X is hidden in the
observed data Y. Meanwhile, (Y, X) is called complete data because the observed and latent data are included in the
set. Since it is difficult to estimate the channel with incomplete data, the probability density function of incomplete
data is converted into the probability density function of complete data. The probability density function of
incomplete data is given by
(26)
which can also be represented by using the log-likelihood function as
(27)
Meanwhile, the probability density function of complete data can be rewritten by using the log-likelihood function as
(28)
In the conventional ML algorithm, H is estimated by maximizing the likelihood function f(YH) in Equation (5.3).
Due to the summation term of the exponential functions, however, it is not easy to derive a closed-form solution for H.
In the EM algorithm, H is estimated by iteratively increasing the likelihood function in Equation (5.8). In fact, the EM
algorithm consists of two iterative steps: expectation (E) step and maximization (M) step. In the E-step, the expected
value of the log-likelihood function of H is computed by taking expectation over X, conditioned on Y and using the
latest estimate of H, as follows:
(29)
where H^((P) )denotes the latest estimate of H. In the E-step, the log-likelihood functions of complete data in
Equation (5.8) are averaged over D OFDM symbols. In the subsequent M-step, is determined by maximizing
Equation (5.9) over all possible values of H. More specifically, it is obtained by differentiating Equation (5.9) with
respect to H and setting its derivative to zero, to yield the following result
H (30)
IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm
A Publisher for Research Motivation........ Email: editoriijec@ipasj.org
Volume 2, Issue 8, August 2014 ISSN 2321-5984
Volume 2, Issue 8, August 2014 Page 59
where and can be obtained by Equation (5.2) and Equation (5.3), respectively. Note that
Equation (5.10) can be viewed as a weighted least-square solution where an estimate of cross-correlation function is
divided by an estimate of auto-correlation function ,each being weighted by the corresponding probability density
functions.
6. SIMULATION AND RESULTS
System parameters in our simulations follow the IEEE802.11a standard, where the DFT size N and the number of
modulated sub carriers P equal 64 and 52, respectively. Each multipath is modelled as a zero-mean complex Gaussian
random variable; so, it varies according to Rayleigh distribution.
0 5 10 15
10
-3
10
-2
10
-1
Eb/No, dB
B
i
t
E
r
r
o
r
R
a
t
e
BER for BPSK modulation with Alamouti STBC (Rayleigh channel)
theory (nTx=1,nRx=1)
theory (nTx=1,nRx=2, MRC)
theory (nTx=2, nRx=1, ZF)
theory (nTx=2, nRx=1, ML)
sim (nTx=2, nRx=1, EM)
Fig. 5: BER plot for BPSK with 2 Tx and 1 Rx with EM Algorithm.
The Zero Forcing equalizer is not the best possible way to equalize the received symbol. The zero forcing equalizer
helps us to achieve the data rate gain, but can not take the advantage of diversity gain. With ML equalization, we come
close to the performance of 1 transmit 2 receive MRC case. We gain both throughput gain and diversity gain. A large
improvement in the performance of STBC OFDM compared to that of OFDM can be noted from the table. The results
of the present analysis shows that the transmission characteristics of a MIMO STBC OFDM (2X1) system employing
OFDM transmission , exhibits large improvement in BER values between the OFDM and MIMO STBC OFDM (2X1)
with EM algorithm multiplexing. It also indicates further increases in SNR improvement as we go from lower to higher
digital modulation schemes.
Conclusions
It can be concluded from the results presented above that,
1. For a MIMO STBC system, the OFDM Multiplexing techniques promotes to achieving better SNR performances
for digital transmission.
2. For MIMO-OFDM transmission for BER values of 10-3, the SNR performance increases with different modulation
schemes from BPSK to 4-QAM (~11 dB) and 4-QAM to 16-QAM (~1 dB) and BPSK to 16-QAM (~12 dB).
3. The SNR performance for BER values ~10-3 the STBC OFDM (EM equalization) multiplexing indicates large
improvements in the SNR values compared to that of OFDM multiplexing techniques.
4. The comparison of performance between OFDM and STBC OFDM techniques indicates SNR improvement for
BPSK modulation ~17dB, at BER ~10-3.
7. CONCLUSION
Here we proposed a joint carrier frequency synchronization and channel estimation scheme for OFDM systems based
on the EM algorithm. In the proposed scheme, expectation and maximization steps provide both channel and carrier
frequency offset estimates iteratively using an OFDM preamble symbol. The simulation results show that the proposed
algorithm achieves almost ideal performance compared other equalization methods.
IPASJ International Journal of Electronics & Communication (IIJEC)
Web Site: http://www.ipasj.org/IIJEC/IIJEC.htm
A Publisher for Research Motivation........ Email: editoriijec@ipasj.org
Volume 2, Issue 8, August 2014 ISSN 2321-5984
Volume 2, Issue 8, August 2014 Page 60
REFERENCES
[1] M. Speth, S. A. Fechtel, G. Fock, and H. Meyr, Optimum receiver design for wireless broad-band systems using
OFDMPart 1, IEEE Trans. Commun., vol. 47, no. 11, pp. 16681677, Nov. 1999.
[2] J. J. van de Beek, O. Edfors, and M. Sandell, On channel estimation in OFDM systems, in Proc. Vehi. Technol.
Conf., vol. 2, Chicago, IL, Jul. 1995, pp. 815819.
[3] O. Edfors, M. Sandell, J. J. van de Beek, S. K. Wilson, and P. O. Borjesson, OFDM channel estimation by singular
value decomposition, IEEETrans. Commun., vol. 46, no. 7, pp. 931939, Jul. 1998.
[4] M.Morelli and U.Mengali, A comparison of pilot-aided channel estimation methods for OFDM systems, IEEE
Trans. Signal Process., vol. 49,no. 12, pp. 30653073, Dec. 2001.
[5] F. Daffara and O. Adami, A new frequency detector for orthogonal multicarrier transmission techniques, in Proc.
Veh. Technol. Conf., vol. 2, Jul.1995, pp. 804809.172 IEEE TRANSACTIONS ON VEHICULAR
TECHNOLOGY, VOL. 55, NO. 1, JANUARY 2006
[6] J. J. van de Beek, M. Sandell, and P. O. Borjesson, ML estimation of timing and frequency offset in OFDM
systems, IEEE Trans. Signal. Process., vol. 45, no. 7, pp. 18001805, Jul. 1997.
[7] T.M. Schmidl and D. C. Cox, Robust frequency and timing synchronization for OFDM, IEEE Trans. Commun.,
vol. 45, no. 12, pp. 16131621,Dec. 1997.
[8] A. J. Coulson, Maximum likelihood synchronization for OFDM using a pilot symbol: Algorithm, IEEE J. Sel.
Areas Commun., vol. 19, no. 12,pp. 24862494, Dec. 2001.
[9] F. Tufvesson, O. Edfors, and M. Faulkner, Time and frequency synchronization for OFDM using PN-sequence
preamble, in Proc. Veh. Technol. Conf., vol. 4, Sep. 1999, pp. 22032207.
[10] T. Cui and C. Tellambura, Robust joint frequency offset and channel estimation for OFDM systems, in Proc.
Veh. Technol. Conf., vol. 1, Los Angeles, CA, Sep. 2004, pp. 603607.
[11] X. Ma, H. Kobayashi, and S. C. Schwartz, Joint frequency offset and channel estimation for OFDM, in Proc.
IEEE Global TelecommunicationConf., vol. 1, Dec. 2003, pp. 1519.
[12] B. H. Fleury,M. Tschudin, R. Heddergott, D. Dahlhaus, and K. I. Pedersen, Channel parameter estimation in
mobile radio environments using the SAGE algorithm, IEEE J. Sel. Areas Commun., vol. 17, no. 3, pp. 434450,
Mar. 1999.
[13] A. P. Dempster,N.M. Laird, andD. B. Rubin, Maximum-likelihood from the incomplete data via the EM
algorithm, J. Roy. Statist. Soc., vol. 39,pp. 117, 1977.
[14] C. N. Georghiades and J. C. Han, Sequence estimation in the presenceof random parameters via the EM
algorithm, IEEE Trans. Commun., vol. 45, no. 3, pp. 300308, Mar. 1997.