International Journal of Engineering &Technology, 7 (1.

8) (2018) 236-239

International Journal of Engineering & Technology

Website: www.sciencepubco.com/index.php/IJET

Research paper

Implementation of Adaptive Channel Estimation and CIR Sup-

port Based on Pilot Arrangement and Adaptive Filtering in
MIMO-OFDM Systems
S.Srinivas1*, T.Chandraprakash2, M.Shyam sunder3
1Department of ECE, S R Engineering College, Warangal Urban, Telangana, India
2Department of ECE, SRITW, Telangana, India
3Department of ECE, SRITW, Telangana, India

*Corresponding author E-mail: srinivas_s@srecwarangal.ac.in

Abstract

OFDM is a promising Technique for achieving high data rates in mobile environment because of its multicarrier modulation technique
and ability to convert a frequency selective fading channel into several nearly flat fading channels. The channel estimation techniques for
OFDM systems based on pilot arrangement are investigated. The channel estimation based on comb type pilot arrangement is studied
through different algorithms for both estimating channel at pilot frequencies and interpolating the channel. In this paper, we initially
studied the channel estimation approaches that mainly concentrate on the pilot sequences that have the ability of inserting channel effi-
ciently avoiding interference and maintain orthogonality for OFDM system. However to extend the work, we investigated different adap-
tive channel schemes namely LMS, RLS and fast RLS. To evaluate the performance of this techniques, the simulations are carried out
under Rayleigh channel

Keywords: Orthogonal frequency Division Multiplexing (OFDM); Inter Carrier Interference (ICI); Carrier to Interference Power Ratio; Channel Estima-
tion, Adaptive system

accordingly. The widely used schemes that are in practice present-

1. Introduction
OFDM is an outstanding performance for promising broadband
communication systems such as digital audio broadcasting (DAB),
high-definition television (HDTV), wireless local area network
(IEEE 802.11a and HIPERLAN/2). OFDM is promising as the
supreme modulation scheme that encodes the digital data on nu-
merous carrier frequencies [1]. And their subcarrier is compactly
spaced and overlap with each other, due to this overlapping spec-
trum OFDM has high data rate transmission capability with high
bandwidth efficiency which makes OFDM robust to multipath
fading. OFDM is very supreme case of multi-carrier modulation.
The basic theory of OFDM is that, dividing the single signal
which is of high data rate into numerous signals which is of low
data rate and modulate each of these new low data rate signal with
orthogonal frequency channel or subcarrier and at the receiver end,
they are combined to generate the original signal. Even so, it
should be recognized that the OFDM is having several benefits
having certain demerits like frequency and phase offset errors
prevailing in the communication system. This type of problem
majorly affects the orthogonal nature of OFDM and results in ICI.
In the similar way, it is clear that the several works have done by
the authors to solve the ICI effects.
In a wireless environment, the channel model is highly dependent
on the physical location of the reflectors. As objects move, the
channel model must change accordingly. In particular, if either the
transmitter or receiver is mobile, every channel coefficient will
gradually change, and the adaptive channel equalizer must change
Copyright © 2018 Authors. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted
use, distribution, and reproduction in any medium, provided the original work is properly cited.
ly are adaptive types that focus on the majority channel equalizer
are well known scheme so called Least Mean Square (LMS), also
other popular scheme is Recursive Least Square (RLS) and Gradi-
ent Adaptive Lattice Structure. Different algorithms have different
performances and some disadvantages. To take the decision which
one is better suitable for certain application is decided based on
the following considerations apparently
1. Convergence rate
2. Misadjustment
3. Tracking
4. Robustness
5. Computational Complexity
6. Structure
The rate at which an adaptive filter converges to the system is
important, particularly in situations where the signal statistics are
varying in time. Unfortunately, speed of adaption is typically in-
versely proportional to computational complexity. Misadjustment
measures the offset between the actual signal and the signal pro-
duced by the adaptive filter. Misadjustment is usually inversely
proportional to both speed of adaption and computational com-
plexity. To operation of adaptive schemes shows that it needs an
eye on the statistical variations of channel while it estimating be-
forehand due to presence of the noise in the channel that may in-
fluence the convergence rate which can decrease the system per-
formance. To make better in all the aspects of adaptive filter, care
International Journal of Engineering & Technology 237

should be taken in the point of estimating the channel correctly in As discussed in [3], the authors suggested it is better to use second
presence of noise variations in the internal as well as externally to order interpolation in place of the linear, then it can be augmented
the environment. Computational complexity measures the amount with that of the mathematical form as:
of computation which must be expended at each time step in order
to implement an adaptive algorithm and is often the governing H e (k ) = H e (mL + l )
= c1H p (m − 1) + c0 H p (m ) + c−1H p (m + 1)
factor in whether real-time implementation is feasible. The struc-
ture of algorithm determines the manner of information flow
 ( − 1)
which is implemented in hardware form. An algorithm whose 
structure exhibits high modularity, parallelism, or concurrency is c1 = ,
well suited for implementation using very large-scale integration  2
(VLSI). As there are several works done on this channel estima- where c = −( − 1)( + 1),  =l/N
0
tion namely pilot assistance based in [2] and the new blind scheme   ( + 1)
based in [9]. So in this paper the primary requirement of scheme is c = ,
 − 1 2
to put faster convergence rate that will be depends on the step size
and its improper selection leads to the malfunction of the system.
So if the step size is too small that leads to the low convergence
rate in the system and if the step size is too large that results in the In this particular situation the LP interpolation is executed by in-
convergence defect that cause the failure in the system serting zeros into the original sequence and then spread over suit-
able LP filter that allows the original data to permit that is sup-
The main contributions and organization of this paper are summa-
posed to decrease as explained in the [14].
rized as follows: In section 2 we describe background details of
different adaptive filtering schemes. The section 3 proposed work.
As explained in the [7] the suitable modification that can be done
The section 4 results and discussion. Finally in section 5 we con-
subsequently tracking down the estimated channel to convert it to
cluded the paper.
time domain by using IDFT:

2. Background work N p −1 j
2kn

GN (n ) =  H (k )e , n = 0,1,  N p − 1
Np
p
k =0
Consider the particular cannel estimation scheme founded on the
suitable comb-type pilot that have the pilot signals Np that are
carefully inserted in to the X(k) by following the argument as Then, by using the basic multi-rate signal processing properties
shown below [8], the signal is interpolated by transforming the Np points into N
points with the following method:
X (k ) = X (mL + l )
x p (m ), l =0  Np
= 
 inf . data,
 l =1,L−1 G p (n ), 0n −1
 2
 Np Np
Where L=number of carriers/Np and xp(m) is the mth pilot carrier GN = 0, n N− −1
value. We describe {Hp(k) k=0,1,…Np} as the frequency response  2 2
of the channel at pilot sub-carriers. The estimate of the channel at
pilot sub-carriers grounded on LS estimation is assumed by:  p
( p )
G n − N + 1 + N , N − N p − 1  n  N − 1
 2

Y p (k )
H e (k ) = k = 0,1,  N p − 1 The estimate of the channel at all frequencies is obtained by:
X p (k )
N −1 2
−j
H (k ) =  GN (n )e
nk
Where Yp(k) and Xp(k) are output and input at the kth pilot sub- N
0  k  N −1
carrier correspondingly. n =0

As having so many benefits LS scheme is more prone to noise and

ICI, so for mitigating this work is concentrated on the MMSE that
based on the matrix inversion lemma for every iteration which was
discussed clearly by the authors in [5]. Similarly the work in [3]
by the authors was shown more beneficial towards the reduction in
the complexity with the assistance of the low rank approach by
incorporating widely used form so called singular value decompo-
sition.
Also there is need of better scheme that have the ability to esti-
mate the channel with the help of information provided by the
channel at suitable pilot carriers as in [13]. In [6], the authors
mainly focus on the piecewise interpolation shows better carry out
with the available data-carrier that can be formulated as:
H e (k ) = H e (mL + l )
= (H p (m + 1) − H p (m )) + H p (m )
l and keeps on doing until the mean square error is kept as low as
L possible. To do this it have two modes of operation the former one
0l  L
3. Proposed framework
In this framework the work can be started with considering system
with LMS and RLS by implementing suitable filtering techniques
that will fix the problem of accurate channel estimation in pres-
ence of noise variations in the estimated channel. These schemes
are extensively used to introduce a fixed amount of error that can
be reduced with the extension schemes that are mainly focussed in
several adaptive filtering approaches.
3.1 The Least Mean Squares (LMS) Algorithm:
To explain the functionality of LMS as it initially with its own
data it tries to estimate the required gradient that has the ability to
makes corrections to the given weights through iterative procedure
is to filtering the linear filter output with that of given inputs and
produces proportional error to the desired response of the system.
And the secondary is purely adaptive that takes the responsibility
238 International Journal of Engineering & Technology

of adjusting the filter parameters accordingly with error estimated

at that instant. The total process is done on feedback loop as it  
balances the overall system performance. w(n) = w(n − 1) + k (n)e(n)
P ( n ) =  −1P ( n − 1) − k ( n ) xT ( n )  −1P ( n − 1)

Y(k)
P ( n ) =  −1P ( n − 1) − k ( n ) xT ( n )  −1P ( n − 1)
Input vector
Transversal Filter
X(k) 
w (k ) Output

3.3 Stabilized fast transversal RLS algorithm:

This filter so called Fast Transversal RLS (FT-RLS) is imple-

-
mented to prototype the characteristics that of the simple RLS
Error scheme that can filter the errors similar at the reduced computa-
e(k)
Adaptive weight-
Control Mechanism
Σ tional cost and simpler construction and less time to achieve the
same outcome. As it is solves many problem it is well suited for
+
Desired many real time uses in the industry. This filter mainly relies on the
Response lattice least squares that suits the construction of same structure
d(k)
that is identical to the transversal filter characteristics as its reduc-
Fig.1: Block diagram representation of the LMS algorithm es the complexity that is clearly discussed in the [13] and in the
similar manner its complete information of the algorithm was
3.2 Recursive Least Squares (RLS) Algorithm: deliberated in the [14] where all its four types of filter forms are
shown with brief explanation:
As the name arises because the behavior of the RLS is identical to
that of least squares only the difference is recursive nature design- 1) Forward Prediction: The primary usage of the filter is that it can
ing makes it possible to estimate the least squares of particular calculates the particular weights for the forward filter based on the
tap-weight vector for each iteration of the filter. However with the weights to explicitly reduces the prediction error of the following
updated estimated data, the more accurate vector can be achieved input sample by having the knowledge of the earlier input samples.
with less time and less complexity. The idea of this algorithm Another purpose of the filter is that it keeps track of the previous
mainly concentrated on the widely used lemma so coined as ma- and future error prediction using weights of the filter maintenance
trix inversion to be low as possible.

2) Backward Prediction: Its main purpose is to work exactly calcu-

 lating the weights of the filter in as such a way that it basically
Input vector
Transversal Filter
y(i) = wH (n −1)x(i)
x(i)  relies on the least squares of the predetermined samples by utiliz-
w ( n − 1) Output
ing the input argument. Another persistence of the filter is that it
preserves track of the prior and forthcoming error prediction using
weights of the filter maintenance to be low as possible

3) Conversion Factor: In order to update the weights of the filter

- like forward, backward and joint estimation approach there is
requirement of transversal filter for gain calculation purpose. As it
Adaptive weight-
Control Mechanism
Σ name suggests that its computation mainly depends on the recur-
Error
e (i) +
sive nature based on the prior and future error computations
Desired
Response 4) Joint-Process Estimation: It process is defined in a such way
d(i)
that it calculates the weights of the filter that basically depends in
Fig.2: Block diagram representation of the RLS algorithm the error that relies among the input signal and estimated signal
that can be reduced to least value possible. It primary job is that
This particular scheme is in use most of the applications because
weights of the filter are equivalent to the weights of the estimated
of its speedy convergence rate and less mean square error as relat-
one in certain other schemes.
ed other adaptive schemes such as LMS, but this can be possible
associated with the more computational cost of the algorithm con-
struction.
Algorithm initialization by set with the aid of


w(0) = 0
P(0) =  −1 I , where  is regulation parameter,
 0
For each instant time, n = 1, 2, 3, compute
 (n) = P(n − 1) x (n)
 (n )
k (n ) =
 + x T (n ) (n )

e(n ) = d (n) − x T (n ) w(n − 1)
International Journal of Engineering & Technology
4. Results and discussion
The simulations carried with the aid of Matlab tool with the assis-
tance of communication toolbox. Here all the evaluations are done
with respect to Mean square error (MSE) for number of iterations.
Fig.3: MSE comparison between RLS and LMS algorithm
Fig.3 shows that two tradational schemes belongs to the adaptive
channel estimation schemes in which the performane of RLS in
case of convergence rate is better as related to the LMS scheme.
Fig.4: MSE comparison between fast-RLS, RLS and LMS algorithms
Refering to figure.4, the simulation curves of the all the four
techniques are done on Matlab shows that different convergent
rates and mean square erorrs for several iterations. It is observed
that fast and proposed RLS scheme have same better outcome and
performance efficiency on the other hand LMS and RLS have
poor permance in terms of MSE. This is due to impropper
channel estimation during the pilot sequences in the system.
5. Conclusion
In this paper as initial work mainly focussed on the comb type
channel estimation of particular relevance to check for orthogonal-
ity in the OFDM systems are examined. Later due to frequency
and phase offset ICI arises because the mismatch presence in the
channel estimation there is need for adopting the different adap-
tive channel estimation approaches. The proposed and fast RLS
shows better performance in terms of mean square error and fast
convergence rate for given iterations as related very poor behav-
iour of traditional schemes like LMS and RLS techniques with the
help of simulation curves under the presence of Rayleigh channel.
239
Acknowledgement
Authors would like to express sincere gratitude to management
and principal of SR Engineering College, for their support and
encouragement to carry out the research work
References
[1] Ghassan M. T. Abdalla, “Orthogonal Frequency Division Multi-
plexing Theory and Challenges”, UofKEJ, Vol. 1, Issue 2, pp. 1-8,
(October 2011).
[2] He Zhongqiu, Xing Yanan “Pilot aided channel estimation of
MIMO-OFDM system”, Vehicular Technology Conference (VTC
Spring), 2013 IEEE Xplore: 06 January 2014
[3] M. Hsieh and C. Wei, “Channel estimation for OFDM systems
based on comb-type pilot arrangement in frequency selective fading
channels” in IEEE Transactions on Consumer Electronics, vol. 44,
no.1, February 1998
[4] R. Steele, Mobile Radio Communications, London, England, Pen-
tech Press Limited, 1992
[5] U. Reimers, “Digital video broadcasting,” IEEE Communications
Magazine, vol. 36, no. 6, pp. 104-110, June 1998.
[6] L. J. Cimini, Jr., “Analysis and simulation of a digital mobile chan-
nel using orthogonal frequency division multiplexing,” IEEE Trans.
Commun., vol.33, no. 7, pp. 665-675, July 1985.
[7] Y. Zhao and A. Huang, “A novel channel estimation method for
OFDM Mobile Communications Systems based on pilot signals and
transform domain processing”, in Proc. IEEE 47th Vehicular Tech-
nology Conference, Phoenix, USA, May 1997, pp. 2089-2093
[8] A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Pro-
cessing, New Jersey, Prentice-Hall Inc., 1999
[9] Tan Yun*, Xu Wenbo, He Zhiqiang, “MIMO-OFDM Channel Es-
timation Based on Distributed Compressed Sensing and Kalman
Filter”, Signal Processing, Communications and Computing
(ICSPCC), 2011 IEEE International Conference, IEEE Xplore: 27
October 2011.
[10] Zheng Xiang Zhou Zhi-Jie Zhang Wen-Qiang "An Adaptive Chan-
nel Tracking Algorithm Combined LMS and KALMAN, Fil-
ter"2008 IEEE.
[11] Navid daryasafar and Babak ehyaee, “Evaluation of Channel Esti-
mation Algorithms in MIMO OFDM Systems with Considering the
Carrier Frequency Offset”, IJSCT, Volume 3, Issue 5, May 2012.
[12] Scott C. Douglas, Markus Rupp, “Convergence Issues in the LMS
Adaptive Filter” article.
[13] S.Uma maheshwar (2015). “Limited Feedback Block Diagonaliza-
tion in Multiuser MIMO Downlink Channels”, International Journal
of Applied Engineering Research (IJAER), Volume-Issue: 10-70,
Page Nos: 226-231, PISSN: 0973-4562.
[14] S.Uma maheshwar (2017). “Performance Analysis of K-Best
Sphere Decoder Algorithm for Spatial Multiplexing MIMO Sys-
tems” International Journal of Pure and Applied Mathematics
(IJPAM), JUL, 2017, Volume-Issue: 114-10, Page Nos: 097-106,
PISSN: 1311-8080.