Professional Documents
Culture Documents
telecommunication
Overvie
w:
Source of inspiration
Different types of adaptive
algorithms
Applications in field of
telecommunication
Channel equalizer model
LMS
Principles, Usage, Advantages &
Disadvantages
PSO
Basic ideas, Advantages over LMS
Why bioinspired?
Types of Adaptive
algorithms:
LM
S
Overview of a Digital
Communication System:Transmitter
sk
Data Source
Encoder
Modulator
Physical Channel
Equalizer
Demodulator
rk
Decision
Device
Decoder
AWGN
Receiver
s 'k-d
Overview of a Digital
Communication System:-
Data Source
sk
Physical Channel
rk
Equalizer
Decision
Device
Decoder
s 'k-d
AWGN
Digital Channel
Equalizers: Located in the front end of the receivers ( in
series with the channel )
Inverse system of the channel model (Transfer
function of the equalizer is inverse to the
transfer function of the channel)
Use to reduce : Inter-Symbol Interference (ISI)
Inter User Interference in the form of Co-channel
Interference(CCI)
Adjacent Channel Interference(ACI) in the presence
of Additive White Gaussian Noise (AWGN)
Channel
Noise
Random
Binary
Input Digital
x (k)
Channel
H (z)
+
+
Channel y (k)
_
Equalizer
d (k)
+
e (k)
Adaptive
Algorithm
Dela
y
z-m
The LMS
Algorithm:
Standard LMS Algorithm for updating channel
weights, uses a gradient descent to estimate a
time varying signal, finds a minimum, if it exists,
by taking steps in the direction negative of the
gradient.
An adaptive channel equalizer is basically an
adaptive tap-delay digital filter.
Equalization problem can be viewed as an
optimization problem i.e. it can be viewed as a
squared error minimization problem.
The LMS algorithm approaches the minimum of
a function to minimize error by taking the
negative gradient of the function.
a0
x(k)
Random Z-1
a1
Binary
x(kInput
-1
Z 1)
a2
( +1, -1 )
x(k2)
Channel
Nois
e
Equalizer
h0(k)
Z-1
h1(k)
Z-1
h2(k)
Z-1
h3(k)
Z-1
h4(k)
Z-1
Z-1
Z-1
d (k)
y (k)
h5(k)
e (k)
h6(k)
h7(k)
LMS Algorithm
Error square
No. of iterations
Disadvantages of LMS
Algorithm: Derivative based algorithm, so there are chances
that the parameters may fall to local minima
during training.
Does not perform satisfactorily under high noise
condition.
Does not perform satisfactorily if the order of the
channel increases.
Once close to optimal solution they normally
rattle around it rather than converging.
Does not perform satisfactorily for nonlinear
Channels.
Above mentioned disadvantages motivated us to
go for another adaptive algorithm using PSO
Particle Swarm
Optimization: Optimization heuristic inspired by social behavior
of bird flocking or swarming of bees, proposed by
Eberhart and Kennedy in 1995
Based on attraction of particle to best found
solutions
Each candidate solution is called PARTICLE and
represents one individual of a population
The population is set of vectors and is called
SWARM
The particles change their components and move
(fly) in a space
They can evaluate their actual position using the
function to be optimized. The function is called
10/6/15FITNESS FUNCTION.
16
Particle Swarm
PSO continue..
Optimization: Swarm of particles is flying through the parameter space
and searching for optimum
vi(t)
Each particle is characterized by
Position vector.. xi(t)
Velocity vector...vi(t)
Particle i
xi(t)
10/6/15
17
PSO
Algorithm: Each particle has
Individual knowledge pbest
its own best-so-far position
Social knowledge gbest
pbest of its best neighbor
Velocity update:
vi(t+1)=w vi(t) +c1*rand *(pbest(t) xi(t))
+c2*rand*(gbest(t) - xi(t))
Position update:
xi(t+1)=xi(t) + vi(t+1)
10/6/15
18
10/6/15
19
Advantages of PSO
over LMS:
Referenc
es: