Sunteți pe pagina 1din 3

Survey of LMS, RLS and SMI Algorithm for

Smart Antenna System


Bremachandran Santhanam
K00367167
Department of Electrical and Computer Engineering
Texas A&M University
Kingsville,Texas
bremachandran@hotmail.com
AbstractIn the field of communication, demand for the
spectrum is increasing very rapidly which force developers to use
the spectrum as efficiently as possible and smart antenna is one
the emerging technologies which can fill the requirement. Smart
antennas as systems of antennas include huge variety of
techniques that tries to increase the received signal strength,
suppress the interfering signals, and hence increase the overall
SNR of the system. Paper includes the analysis and comparison of
Least Mean Square (LMS), Recursive Least Square (RLS) and
Sample Matrix Inversion (SMI) algorithm on the basis of number
of antenna elements, spacing between the elements for smart
antenna and number of samples. Radiation pattern has been
obtained for the specified adaptive beam forming algorithm by
providing system with signal of interest (SOl) and Signal Noise of
Interference (SNOl).

Keywords: Smart antenna, Adaptive beam forming, SMI, RLS and


LMS

I. INTRODUCTION
Smart antenna is the combination of antenna array and
signal processing in both space and time. The concept of using
antenna arrays and adaptive signal processing combined is not
new to radar and aerospace technology. Until previous decade,
higher cost of system has prevented their use in commercial
systems. The inclusion of very fast and low-cost digital signal
processors has made smart antennas practical available for
cellular land or satellite mobile communication systems.
Adaptive Beam Forming is also referred as spatial filtering is a
technique in which an array of antennas exploited to achieve
maximum reception in desired direction and rejecting signals
of same frequency in the other direction. This can be
accomplished by adjusting weights of each of the antennas
used in the array. Recently, the application of smart antenna
arrays has been suggested for mobile communication systems,
to overcome the problem of limited channel bandwidth,
satisfying a growing demand for a large number of mobiles on
communications channel. A smart antenna is a phased or
adaptive array that adjusts to the environment. That is, for the
adaptive array, the beam pattern changes as the desired user
and the interference move, and for the phased array, the beam

is steered or different beams are selected as the desired user


moves.
II. ADAPTIVE BEAM FORMING ALGORITHM
Among many adaptive algorithms that exist in the open
literature, the class of approaches which are derived from the
optimization of radiation pattern. Probably the simplest
algorithm belonging to this class is the Least Mean Squared
(LMS) algorithm which has the advantage of low complexity
and simplicity of implementation. One of the main concerns in
all practical situations is to develop algorithms which provide
fast convergence of the adaptive filter coefficients and in the
same time good filtering performance. There are some
applications where the adaptive filters were applied with
success, namely: system identification, inverse modeling,
prediction and interference (Noise and Echo) cancelling and
smart antenna. An adaptive algorithm is a set of recursive
equations used to adjust the weight vector automatically to
minimize the error signal (n) such that the weight vector
converges iteratively to the optimum solution wo that
corresponds to the bottom of the performance surface, i.e. the
minimum MSE at J min and estimating the radiation pattern for
given signal of interest [5].Following adaptive algorithm has
been analyzed in the paper:
III. LMS ALGORITHM
LMS algorithm is adaptive and Non-blind algorithm
because it uses the training or reference signal. It uses the
gradient based steepest decent method. It follows an iterative
procedure that makes successive corrections to the weight
vectoring the direction of the negative of the gradient vector
which eventually leads to the minimum mean square error.
LMS algorithm is relatively simple and it does not require
correlation function calculation and matrix inversions.

Fig.2 RLS Algorithm

Fig. 1 Smart Antenna Array System


In Fig. 1 the outputs of the individual sensors are linearly
combined after being scaled with corresponding weights
optimizing the antenna array to have maximum gain in the
direction of desired signal and nulls in the direction of
interferers. The linear combination of input vector u(n) and
weight vector w(n) is the output of uniform linear antenna y(n)
at any time n is given by
y(n) = wH (n)u(n)
where
w(n) = [ w1+w2.wN ]H
and
u(n) = [ u1+u2+.+uN ]
The error signal is given by the following equation
e(n) = d(n) - y(n)
The LMS algorithm avoids matrix inverse operation and uses
the instantaneous gradient vector J(n) for weight vector up
gradation.
From the method of Steepest descent, the weight vector w(n+1)
at time n + 1 can be written as w(n + 1) = w(n) + [ - J (n)]
Where J(n)=E[e(n)2 ]is the mean square error
(MSE) cost function and is the step size parameter which
control the convergence rate. It describes how fast the LMS
reaches the steady state. The adaptive step size should be
within the range specified as 0 < < (6) Where, max is the
largest Eigen value of correlation matrix R. If is chosen to be
very small, then convergence becomes slow. If is kept large,
then convergence becomes fast, but stability becomes a
problem. Therefore it is better to select within bounded
conditions as defined in equation

Figure 2 shows the block diagram of smart


Antenna system used for RLS algorithm.
The output of uniform linear antenna y(n) at any time n is
given
By y(n) = wH (n)u(n). (1)
where w(n) is weighted vector and u(n) is input vector.
The error signal is given by the following equation
e(n) = d(n) - y(n)
= d(n) wH(n)u(n) ........(2)
Where, H= Hermitian transposition
(transposition of complex conjugate)
The RLS algorithm can be summarized by the
following these equation
(n) = d(n) - y(n).... (16)
w(n) = w(n-1) + k(n)e*(n)......(17)
P(n) = -1P(n-1) -1k(n)uH(n)P(n-1)18)
Where P in the above equation is first initialized to -1 I
where I is a small positive constant and I is an identity matrix.
All weights are again initialized to zeroes. K is a vector called
the gain factor and is the forgetting factor.
V.SAMPLE MATRIX INVERSION ALGORITHM
One of the discontinuous adaptive algorithms is sample matrix
inversion. Its used in discontinuous transmission, however it
requires the number of interferers and their positions remain
constant during the duration of the block acquisition. Sample
matrix inversion have faster conversion rate since it employs
direct inversion of the covariance matrix. So, its useful to use
it if the signal rabidly changed.
Fig.3 shows the generic block diagram of SMI.

IV. RLS ALGORITHM


The RLS algorithm is one of the important adaptive beam
forming algorithms for smart antenna system which provides
fastest convergence and optimize the LMS algorithm. RLS
algorithm does not require any matrix inversion calculation as
the inverse correlation matrix is computed directly. It requires
reference signal and correlation matrix information [6].

Figure 3 Sample Matrix Inversion adaptive beamforming


network
V. CONCLUSION
In this paper LMS, RMS and SMI adaptive beam forming
algorithms are discussed. If number of array elements of the

antenna was increased, it will lead to the improvement in the


radiation pattern as main lobe will become narrower in band
width and side lobes get reduced in amplitude and hence the
performance of system will increase. In the upcoming final
report, We are going to compare and discuss about performance
analysis of LMS, SMI and RLS algorithms on the basis of
different parameters.

References
[1] Constantine A.Balanis, 'Antenna Theory Analysis and Design,'
3/e 2005.
[2] Sergey Makarov and Chuck Fung, 'Basic Antenna Theory and
Application', 2011.
[3] Curtis, T., 'Digital Beamforming for Sonar Systems,' IEEE
Proceedings on Pt. F, Vol. 127, pp. 257265, Aug. 1980.

S-ar putea să vă placă și