Swarm and Evolutionary Computation 7 (2012) 5864

Contents lists available at SciVerse ScienceDirect

Swarm and Evolutionary Computation

journal homepage: www.elsevier.com/locate/swevo

Regular Paper

Craziness based Particle Swarm Optimization algorithm for

FIR band stop lter design
Rajib Kar a, Durbadal Mandal a,n, Sangeeta Mondal b, Sakti Prasad Ghoshal b
a
b

Department of Electronics & Communication Engineering, National Institute of Technology, Durgapur, India
Department of Electrical Engineering, National Institute of Technology, Durgapur, India

a r t i c l e i n f o

a b s t r a c t

Article history:
Received 22 June 2011
Received in revised form
12 March 2012
Accepted 12 May 2012
Available online 15 June 2012

In this paper, an improved particle swarm optimization technique called Craziness based Particle
Swarm Optimization (CRPSO) is proposed and employed for digital nite impulse response (FIR) band
stop lter design. The design of FIR lter is generally nonlinear and multimodal. Hence gradient based
classical optimization methods are not suitable for digital lter design due to sub-optimality problem.
So, global optimization techniques are required to avoid local minima problem. Several heuristic
approaches are available in the literatures. The Particle Swarm Optimization (PSO) algorithm is a
heuristic approach with two main advantages: it has fast convergence, and it uses only a few control
parameters. But the performance of PSO depends on its parameters and may be inuenced by
premature convergence and stagnation problem. To overcome these problems the PSO algorithm has
been modied in this paper and is used for FIR lter design. In birds ocking or sh schooling, a bird or
a sh often changes directions suddenly. This is described by using a craziness factor and is modelled
in the technique by using a craziness variable. A craziness operator is introduced in the proposed
technique to ensure that the particle would have a predened craziness probability to maintain the
diversity of the particles. The algorithms performance is studied with the comparison of real coded
genetic algorithm (RGA), conventional PSO, comprehensive learning particle swarm optimization
(CLPSO) and Parks and McClellan (PM) Algorithm. The simulation results show that the CRPSO is
superior or comparable to the other algorithms for the employed examples and can be efciently used
for FIR lter design.
& 2012 Elsevier B.V. All rights reserved.

Keywords:
FIR band stop lter
RGA
PSO
CLPSO
CRPSO
Parks and McClellan (PM) Algorithm

1. Introduction
A digital lter is simply a discrete time, discrete amplitude
convolver. Filtering is, in essence, the multiplication of the signal
spectrum by the frequency domain impulse response lter, e.g. for an
ideal band stop lter the pass band part of the signal spectrum is
multiplied by one and the stop band part of the signal is by zero.
Digital lters are basic building blocks in many digital signal processing systems. They have wide range of applications in communication, image processing, pattern recognition, etc. There are two major
classes of digital lters, namely, nite impulse response (FIR) lters
and innite impulse response (IIR) lters depending on the length of
the impulse response [1]. FIR lter is an attractive choice because
of the ease in design and stability. By designing the lter taps to be
symmetrical about the centre tap position, a FIR lter can be
guaranteed to have linear phase. FIR lters are known to have many
n

Corresponding author. Tel.: 91 9434788059.

E-mail addresses: rajibkarece@gmail.com (R. Kar),
durbadal.bittu@gmail.com (D. Mandal), sangeeta.aas@gmail.com (S. Mondal),
spghoshalnitdgp@gmail.com (S.P. Ghoshal).
2210-6502/$ - see front matter & 2012 Elsevier B.V. All rights reserved.
http://dx.doi.org/10.1016/j.swevo.2012.05.002

desirable features such as guaranteed stability, the possibility of exact

linear phase characteristic at all frequencies and digital implementation as non-recursive structures. Linear phase FIR lters are also
required when time domain features are specied [2]. The most
frequently used method for the design of exact linear phase weighted
Chebyshev FIR digital lter is the one based on the Remez-exchange
algorithm proposed by Parks and McClellan [3] which is popularly
known as PM algorithm. Further improvements in their results have
been reported in [4]. The main limitation of this procedure is that the
relative values of the amplitude error in the frequency bands are
specied by means of the weighting function, and not by the
deviations themselves. Therefore, in case of designing band stop
lters with a given stop band deviation, lter length and cut-off
frequency, the programme has to be iterated many times [5]. A
number of models have been developed for the FIR lter techniques
and design optimization methods. This is a thrust research area,
aiming at obtaining more general and innovative techniques that are
able to solve or optimize new and complex engineering problems [6].
In some cases, such initiatives were successful and proven to exhibit
better performance than the conventional approaches. However,
there are few drawbacks associated to these methods, e.g., increased

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

computational cost and non-existence of theoretical proof of convergence to global optimum in sufciently general conditions.
The conventional gradient based optimization method [7] is not
sufcient to optimize the multimodal and non-uniform objective
function, and it cannot converge to the global minimum solution. The
classical gradient based optimization methods are not suitable for
FIR lter optimization because of the following reasons: (i) highly
sensitive to starting points when the number of solution variables
and hence the size of the solution space increase, (ii) frequent
convergence to local optimum solution or divergence or revisiting
the same suboptimal solution, (iii) requirement of continuous and
differentiable objective cost function (gradient search methods),
(iv) requirement of the piecewise linear cost approximation (linear
programming), and (v) problem of convergence and algorithm complexity (nonlinear programming).
So, evolutionary methods have been implemented in the design of
optimal digital lters with better control of parameters and the
highest stop band attenuation. Different heuristic optimization techniques are reported in the literatures. When considering global
optimization methods for digital lter design, the GA [810] seems
to have attracted considerable attention. Filters designed by GA have
the potential of obtaining near global optimum solution. Although
standard GA (also known as Real Coded GA (RGA)) shows a good
performance for nding the promising regions of the search space,
they are inefcient in determining the global optimum in terms of
convergence speed and solution quality. In order to overcome the
problems associated with RGA, orthogonal genetic algorithm (OGA)
[11], hybrid Taguchi GA (TGA) [12] have been proposed. Tabu search
[13], Simulated Annealing (SA) [14], Bee Colony Algorithm (BCA) [15],
Differential Evolution (DE) [16,17], Differential cultural algorithm
[18], Particle Swarm Optimization (PSO) [1921], some variants of
PSO like Quantum PSO (QPSO) [22], PSO with Quantum Infusion
(PSO-QI) [23,24], Adaptive inertia weight PSO [25], Chaotic mutation
PSO (CM PSO) [26,27], some hybrid algorithms like, DE-PSO [28,29]
have also been used for the lter design problem.
Most of the above algorithms show the problems of premature
convergence, stagnation and revisiting of the same solution over
and again. In order to get rid of these problems and to maintain
the diversity of the particles and moreover, because in birds
ocking or sh schooling, a bird or a sh often changes directions
suddenly, the authors, in this paper have modied the conventional PSO by introducing an entirely new velocity expression
associated with many random numbers and a craziness velocity
having a predened probability of craziness.
This paper describes an alternative technique for the FIR band
stop (BP) digital lter design using Craziness based Particle Swarm
Optimization Technique (CRPSO). CRPSO technique tries to nd the
best coefcients that closely match the ideal frequency response.
Based upon the improved PSO approach, this paper presents a good,
comprehensive set of results, and states arguments for the superiority
of the algorithm. Simulation results demonstrate the effectiveness
and better performance of the proposed designed method.
The rest of the paper is arranged as follows. In Section 2, the FIR
lter design problem is formulated. Section 3 briey discusses on the
algorithms of real coded genetic algorithm (RGA), classical PSO,
CLPSO, and the CRPSO techniques. Section 4 describes the simulation
results obtained for FIR BP lter using PM algorithm, RGA, classical
PSO, CLPSO and the proposed CRPSO. Finally, Section 5 concludes
the paper.
2. Problem formulation
A digital FIR lter is characterized by
Hz

N
X
n0

hnzn ,

59

where N is the order of the lter which has (N 1) number of lter

impulse response coefcients h(n). The values of h(n) will determine the type of the lter e.g. low pass, high pass, band pass, etc.
and are to be determined in the design process. This paper
presents optimal design of an even order linear phase FIR band
stop (BS) lter with positive symmetric h(n). The number of
coefcients h(n) is (N 1). Because the coefcients h(n) are
symmetrical, the dimension of the problem is halved. The
(N 1)/2 coefcients are then ipped and concatenated to nd
the required (N 1) number of coefcients. The optimization
algorithm attains the minimum error between the desired frequency response and the actual frequency response by determining the optimal h(n) values after a certain maximum number of
iterations. The optimal h(n) values, after concatenation, nally
represent the lter with optimal frequency response.
Various lter parameters which are responsible for the optimal
lter design are stop band and pass band normalized edge
frequencies (op, os), pass band and stop band ripples (dp and ds),
stop band attenuation and transition width. These parameters are
mainly decided by the lter coefcients [29]. In this paper, the
proposed CRPSO and other existing techniques (for the sake of
comparison) as mentioned earlier are individually applied in order
to obtain the desired lter response as close as possible to the ideal
response, where dp, ds, N, op, os are individually specied.
Now for (1), each lter coefcient particle vector is {h0, h1 y hN}.
The particle vectors are distributed in a D-dimensional search space,
where D(N1) for Nth order FIR lter. The frequency response of
the FIR digital lter can be calculated as
Hejwk

N
X

hnejwk n ,

n0

where Hejwk is the Fourier transform complex vector. This is the

FIR lter frequency response. The frequency is sampled in [0, p] with
M sampling points; the position of each particle vector in
D-dimensional search space represents the same coefcients h(n)
of the transfer function (1).
In this paper, the authors have adopted a new error tness
function in order to achieve higher stop band attenuation and to
have an accurate control on the transition width. The error tness
function J used in this paper is given in (3). Using (3), it is found
that the proposed lter design approach results in considerable
improvement over PM and other optimization techniques:
J







 X
abs absHo1dp
absHods

where abs or, 99 indicates the absolute value.

For the rst term of (3), oApass band including a portion of
the transition band and for the second term of (3), oAstop band
including a portion of the transition band. The error tness
function given in (3) represents the generalized tness function
to be minimized using the evolutionary algorithms RGA, conventional particle swarm optimization (PSO), CLPSO and CRPSO
individually. Each algorithm tries to minimize this error tness J
and thus improves the lter performance. Unlike other error
tness functions as given in [16,19,21,24] which consider only
the maximum errors, J involves summation of all absolute errors
for the whole frequency band, and it is experienced that minimization of J yields higher stop band attenuation and lesser pass
band ripples. Transition width is affected a little. Since the
coefcients of the linear phase lter are matched, the dimension
of the problem is thus reduced by a factor of 2. By only
determining half of the coefcients, the lter can be designed.
This greatly reduces the computational burdens of the algorithms,
applied to the design of linear phase FIR lters.

60

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

the group best of the group at kth iteration. The searching point in
the solution space may be modied by

3. Evolutionary techniques employed

3.1. Real coded genetic algorithm (RGA)

1
Sik 1 Sk
V k
i
i

Real coded genetic algorithm (RGA) is mainly a probabilistic

search technique, based on the principles of natural selection and
evolution. At each generation, it maintains a population of vectors
where each vector is a coded form of a possible solution of the
problem at hand called chromosome. Chromosomes are constructed over some particular alphabet, e.g., the binary alphabet
{0, 1}, so that chromosomes values are uniquely mapped onto the
real decision variable domain. Each chromosome is evaluated by a
function known as tness function, which is usually the objective
function of the corresponding optimization problem [35].
The basic steps of RGA are shown in Table 1.
3.2. Particle Swarm Optimization (PSO)
PSO is a exible, robust population-based stochastic search/
optimization technique with implicit parallelism, which can
easily handle with non-differential objective functions, unlike
traditional optimization methods. PSO is less susceptible to
getting trapped on local optima unlike GA, Simulated Annealing,
etc. Eberhart et al. [30,31] developed PSO concept similar to the
behaviour of a swarm of birds. PSO is developed through simulation of bird ocking in multidimensional space. Bird ocking
optimizes a certain objective function. Each particle (bird) knows
its best value so far (pbest). This information corresponds to
personal experiences of each particle. Moreover, each particle
knows the best value so far in the group (gbest) among pbests.
Namely, each particle tries to modify its position using the
following information:

 The distance between the current position and the pbest.

 The distance between the current position and the gbest.

The rst term of (4) is the previous velocity of the particle

vector. The second and third terms are used to change the velocity
of the particle. Without the second and third terms, the particle
will keep on ying in the same direction until it hits the
boundary. Namely, it corresponds to a kind of inertia represented
by the inertia constant, w and tries to explore new areas.
3.3. Comprehensive Learning Particle Swarm Optimization (CLPSO)
Steps of CLPSO as implemented for optimization of h(n)
coefcients are adopted from [36]. In this work, initialization of
real chromosome string vectors of np population, each consisting
of a set of h(n) coefcients is made. Size of the set depends on the
number of coefcients in a particular lter design. The same sets
of parameters are used as mentioned in [36].
3.4. Craziness based Particle Swarm Optimization (CRPSO)
In order to get rid of the limitations of classical PSO [3233]
already mentioned and because in birds ocking or sh schooling, a bird or a sh often changes directions suddenly, the authors
have modied the conventional PSO by introducing an entirely
new velocity expression (6) associated with many random numbers and a craziness velocity having a predened probability of
craziness. This modied PSO is termed as CRPSO.
The velocity in this case can be expressed as follows [34]:
1
k
k
V k
r 2 nsignr 3 nV k
i
i 1r 2 nC 1 nr 1 nfpbest i Si g

1r 2 nC 2 n1r 1 nfgbest k Sk

i g

where r1, r2 and r3are the random parameters uniformly taken

from the interval [0,1] and sign(r3)is a function dened as

Similar to GA, in PSO techniques also, real-coded particle

vectors of population np are assumed. Each particle vector consists of components or sub-strings as required number of normalized lter coefcients, depending on the order of the lter to be
designed.
Mathematically, velocities of the particle vectors are modied
as follows:
1
V k
wnV ik C 1 nrand1 npbest k
Sik C 2 nrand2 ngbest k Sik
i
i

4
where V i k is the velocity of ith particle at kth iteration; w is the
weighting function; C1 and C2 are the positive weighting factors;
rand1and rand2 are the random numbers between 0 and 1; Si k is
the current position of ith particle vector at kth iteration; pbesti k
is the personal best of ith particle vector at kth iteration; gbest(k) is

signr 3 1 where r 3 r 0:05

1 where r 3 4 0:05

The two random parameters rand1 and rand2 of (4) are

independent. If both are large, both the personal and social
experiences are over used and the particle is driven too far away
from the local optimum. If both are small, both the personal and
social experiences are not used fully and the convergence speed of
the optimization technique is reduced. So, instead of taking
independent rand1and rand2, one single random number r1 is
chosen so that when r1 is large, (1 r1) is small and vice versa.
Moreover, to control the balance of global and local searches,
another random parameter r2 is introduced. For birds ocking for
food, there could be some rare cases that after the position of the
particle is changed according to (5), a bird may not, due to inertia,
y towards a region at which it thinks is most promising for food.

Table 1
Steps for RGA.
In RGA, initialize the real chromosome string vectors of np population, each consisting of (N/2 1) number of h(n) coefcients within maximum and minimum bounds
(,  1, respectively) for positive symmetric linear phase even Nth (N 20 or 28 or 36 in this work) order lter design. The steps of RGA as adopted from [35] and
used for the implementation of FIR BS lter are as follows:
Step 1. Initialization.
Step 2.Decoding the strings and evaluation of error tness value of each string.
Step 3. Selection of elite strings in order of increasing error tness values from the minimum value.
Step 4. Copying the elite strings over the non-selected strings.
Step 5. Crossover and mutation generate the off-springs.
Step 6. Genetic cycle updating.
The iteration stops when the maximum number of genetic cycles is reached. The grand minimum error tness value, its corresponding chromosome string having
optimal (N/2 1)h(n) coefcients and nally, (N 1) number of optimal lter coefcients are obtained by concatenation to get the nal optimal frequency spectrum
of the lter.

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

Instead, it may be leading toward a region which is in opposite

direction of what it should y in order to reach the expected
promising regions. So, in the step that follows, the direction of the
birds velocity should be reversed in order for it to y back to the
promising region. sign(r3) is introduced for this purpose. In birds
ocking or sh schooling, a bird or a sh often changes directions
suddenly. This is described by using a craziness factor and is
modelled in the technique by using a craziness variable. A
craziness operator is introduced in the proposed technique to
ensure that the particle would have a predened craziness
probability to maintain the diversity of the particles. Consequently, before updating its position the velocity of the particle
is crazed by
V i k 1 V i k 1 P r 4 nsignr 4 nvcraziness
i

where r4 is a random parameter which is chosen uniformly within

the interval [0,1];
vcraziness
is a random parameter which is uniformly chosen
i


from the interval vmin
,vmax
; and P(r4) and sign(r4) are dened,
i
i
respectively, as
Pr 4 1 when r 4 r P cr
0 when r 4 4 P cr

signr 4 1 when r 4 Z 0:5

1 when r 4 o 0:5

10

where Pcr is a predened probability of craziness.

Reversal of the direction of birds velocity should rarely occur;
to achieve this, r3 r0.05 (a very low value) is chosen when
sign(r3) will be 1 to reverse the direction. If Pcr is chosen less
or, equal to 0.3, the random number r4will have more probability
to become more than Pcr, in that case, craziness factor P(r4) will be
zero in most cases, which is actually desirable, otherwise heavy
unnecessary oscillations will occur in the convergence curve near
the end of the maximum iteration cycles as referred to (9).
vcraziness is chosen very small ( 0.0001) as shown in Table 3.
r4 Z0.5 or, o0.5 is chosen to introduce equal probability of
direction reversal of vcrazinessas referred to (8) and (10).
The design objective in this paper is to obtain the optimal
combination of the BS lter coefcients, so as to acquire the
maximum stop band attenuation with the least increment in
transition width. Here lies the authors contribution that this
design objective has been attained by the proposed CRPSO
technique. The steps of CRPSO algorithm are given in Table 2.
The values of the parameters used for the RGA, PSO and CRPSO
techniques are given in Table 3. The values of the parameters used
for the CLPSO technique are adopted from [36].

61

4. Results and discussions

4.1. Analysis of magnitude response of FIR BS lters
The MATLAB simulation has been performed extensively to
realize the FIR BS lters of the orders of 20, 28 and 36. Hence, the
lengths of the lter coefcients are 21, 29 and 37, respectively.
The sampling frequency has been chosen as fs 1 Hz. Also, for all
the simulations the sampling number is taken as 128. Each
algorithm is run for 30 times to get the best solutions.
The parameters of the FIR BS lter to be designed are as
follows:

 Pass band ripple (dp)0.1

 Stop band ripple (ds) 0.01
 Lower pass band (normalized) cut-off frequency (opl) 0.30
Table 3
RGA, PSO, CRPSO parameters.
Parameters

RGA

PSO

CRPSO

Population size
Iteration cycles
Crossover rate
Crossover
Mutation rate
Selection probability
C1
C2
vmin
i
vmax
i
wmax
wmin
Pcr
vcraziness

120
100
0.8
Two point crossover
0.001
1/3

120
100

2.05
2.05
0.01

120
100

2.05
2.05
0.01

1.0
1.0
0.4

1.0

0.3
0.0001

Table 4
Optimized coefcients of FIR BS lter of order 20.
h(N)

RGA

PSO

CLPSO

CRPSO

h(1) h(21)
h(2) h(20)
h(3) h(19)
h(4) h(18)
h(5) h(17)
h(6) h(16)
h(7) h(15)
h(8) h(14)
h(9) h(13)
h(10) h(12)
h(11)

0.0045
 0.0366
0.0762
0.0514
 0.0732
 0.0007
 0.0938
 0.0399
0.2985
0.0300
0.5840

 0.0079
 0.0277
0.0662
0.0569
 0.0674
 0.0047
 0.0851
 0.0568
0.2947
0.0309
0.5881

 0.0079
 0.0306
0.0658
0.0559
 0.0595
 0.0028
 0.0844
 0.0507
0.2915
0.0360
0.5898

0.0065
 0.0324
0.0626
0.0557
 0.0585
0.0050
 0.0884
 0.0448
0.2926
0.0323
0.5894

Table 2
Steps of CRPSO.
Step 1: Initialization: Population (swarm size) of particle vectors, nP; maximum iteration cycles; lter order N 20 or 28 or 36; number of lter coefcients to be
optimized, (h(n) (N/2 1)) (since the FIR BS lter is positive, symmetric, linear phase and is of even order); xing values of C1, C2, Pcr, vcraziness; minimum and
maximum values of lter coefcients, hmin  1, hmax 1; number of samples 128; dp 0.1, ds 0.01; initialization of the velocities of all the particle vectors.
Step 2: Generate initial particle vectors of lter coefcients (N/2 1) randomly within limits; Computation of initial error tness values of the total population, nP.
Step 3: Computation of population based minimum error tness value and computation of the personal best solution vectors (hpbest), group best solution
vector (hgbest).
Step 4: Updating the velocities as per (6) and (8); updating the particle vectors as per (5) and checking against the limits of the lter coefcients; nally, computation
of the updated error tness values of the particle vectors and population based minimum error tness value.
Step 5: Updating the hpbest vectors, the hgbest vector; replace the updated particle vectors as initial particle vectors for step 4.
Step 6: Iteration continues from step 4 till the maximum iteration cycles or the convergence of minimum error tness values; nally, hgbest is the vector of optimal FIR
band stop lter coefcients (N/2 1); form complete (N 1) coefcients by copying (because the lter has linear phase) before getting the optimal frequency spectrum.

62

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

 Lower stop band (normalized) cut-off frequency (osl)0.35

 Upper pass band (normalized) cut-off frequency (oph)0.75
 Upper stop band (normalized) cut-off frequency (osh) 0.70
The best optimized coefcients for the designed FIR BS lters
with the orders of 20, 28 and 36 have been calculated by PM, RGA,
PSO, CLPSO and CRPSO algorithms and are given in Tables 46,
respectively. Tables 79 summarize the comparative results of
different performance parameters obtained using PM, RGA, PSO,
CLPSO and CRPSO algorithms for BS lters of orders 20, 28 and 36,
respectively.
Table 5
Optimized coefcients of FIR BS lter of order 28.
h(N)

RGA

PSO

CLPSO

CRPSO

h(1) h(29)
h(2) h(28)
h(3) h(27)
h(4) h(26)
h(5) h(25)
h(6) h(24)
h(7) h(23)
h(8) h(22)
h(9) h(21)
h(10) h(20)
h(11) h(19)
h(12) h(18)
h(13) h(17)
h(14) h(16)
h(15)

0.0122
0.0368
 0.0256
 0.0231
 0.0080
 0.0344
0.0613
0.0466
 0.0512
0.0003
 0.0906
 0.0474
0.2981
0.0307
0.6032

0.0062
0.0350
 0.0303
 0.0195
 0.0068
 0.0287
0.0599
0.0413
 0.0558
 0.0006
 0.0862
 0.0466
0.3023
0.0237
0.6038

0.0105
0.0334
 0.0286
 0.0230
 0.0004
 0.0238
0.0554
0.0423
 0.0496
0.0026
 0.0900
 0.0507
0.3006
0.0271
0.6038

0.0060
0.0281
 0.0236
 0.0242
0.0005
 0.0228
0.0515
0.0408
 0.0538
 0.0006
 0.0874
 0.0468
0.2974
0.0289
0.6035

Table 6
Optimized coefcients of FIR BS lter of order 36.
h(N)

RGA

PSO

CLPSO

CRPSO

h(1) h(37)
h(2) h(36)
h(3) h(35)
h(4) h(34)
h(5) h(33)
h(6) h(32)
h(7) h(31)
h(8) h(30)
h(9) h(29)
h(10) h(28)
h(11) h(27)
h(12) h(26)
h(13) h(25)
h(14) h(24)
h(15) h(23)
h(16) h(22)
h(17) h(21)
h(18) h(20)
h(19)

0.0007
 0.0321
0.0044
 0.0033
0.0078
0.0370
 0.0230
 0.0289
 0.0014
 0.0258
0.0563
0.0434
 0.0516
 0.0035
 0.0868
 0.0552
0.2968
0.0345
0.5998

 0.0011
 0.0262
0.0057
 0.0025
0.0104
0.0333
 0.0202
 0.0247
 0.0004
 0.0267
0.0568
0.0413
 0.0528
 0.0047
 0.0861
 0.0527
0.2993
0.0328
0.5992

 0.0046
 0.0311
0.0047
 0.0081
0.0061
0.0278
 0.0257
 0.0268
 0.0020
 0.0259
0.0533
0.0342
 0.0549
 0.0013
 0.0897
 0.0516
0.2934
0.0271
0.5939

 0.0050
 0.0250
0.0015
0.0018
0.0074
0.0312
 0.0193
 0.0272
 0.0034
 0.0232
0.0484
0.0466
 0.0479
 0.0000
 0.0803
 0.0502
0.2979
0.0328
0.5993

Figs. 13 show the magnitude (dB) plots for the FIR BS lters of
orders 20, 28 and 36, respectively. The statistical test results have
been calculated by using [37]. The maximum, mean, variance and
the standard deviation of stop band attenuation have been
calculated for the lter orders of 20, 28 and 36 and are shown
in Tables 79, respectively, for all the above mentioned optimization algorithms.
The proposed CRPSO based approach for 20th order BS lter
design results in the highest 17.57 dB stop band attenuation,
minimum pass band ripple (normalized) 0.095, minimum stop
band ripple (normalized) 0.132. The proposed CRPSO based
approach for 28th order BS lter design results in the highest
25.22 dB stop band attenuation, maximum pass band ripple
(normalized)0.066, maximum stop band ripple (normalized)
0.0547. The simulation results show that the proposed CRPSO
based approach for 36th order BS lter design results in 29.38 dB
stop band attenuation, maximum pass band ripple (normalized)0.061, maximum stop band ripple (normalized)0.0339.
The novelty of the proposed lter design approach is also justied
by the comparison made with [24]. The particle swarm optimization with quantum infusion (PSO-QI) model proposed in [24]
reveals no improvement with respect to the PM algorithm,
whereas, the proposed lter design technique shows 3.39 dB,
6.51 dB, 7.32 dB improvement as compared to PM for the BS
lters of orders 20, 28 and 36, respectively.
From the diagrams and above discussions it is evident that
with almost same level of the transition width, the proposed
CRPSO based lter design approach produces the highest stop
band attenuation (dB) and the lowest stop band and pass band
ripples (normalized) with a little change in the transition width,
compared to those of PM algorithm, RGA, PSO and CLPSO, as
shown in Tables 79. So, the lters designed by the CRPSO result
in the best responses in the stop band region, Thus, it can be
nally inferred that the CRPSO based FIR BS lter design is the
best among the techniques reported in this work.
4.2. Comparative effectiveness and convergence proles of RGA, PSO,
CLPSO and CRPSO
In order to compare the algorithms in terms of the error tness
value, Fig. 4 shows the convergences of error tnesses obtained
when RGA, PSO, CLPSO and the CRPSO are employed, respectively.
The convergence proles are shown for the BS lter of order 36.
Similar plots have also been obtained for the BS lters of orders of
20 and 28, which are not shown here. The CRPSO converges to
much lower error tness as compared to RGA, PSO and CLPSO
which yield suboptimal higher values of error tnesses. As shown
in Fig. 4, in case of BS lter of order 36, the RGA converges to the
minimum error tness value of 7.62; the conventional PSO
converges to the minimum error tness value of 6.72; the CLPSO
converges to the minimum error tness value of 6.05; whereas,
the CRPSO converges to the minimum error tness value of 5.47.

Table 7
Comparison summary of the parameters of interest of order 20 for different algorithms.
Algorithm

Order 20
Stop band attenuation (dB)

PM
RGA
PSO
CLPSO
CRPSO

Maximum

Mean

Variance

Std. deviation

14.18
14.92
15.45
16.51
17.57

14.18
15.61
16.12
16.55
18.03

0.00016
0.8208
0.2291
0.00056
0.2923

0.0126
0.9059
0.4786
0.0236
0.5406

Maximum pass band

ripple (normalized)

Maximum stop band

ripple (normalized)

0.196
0.12
0.086
0.07
0.095

0.195
0.179
0.169
0.149
0.132

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

63

Table 8
Comparison summary of the parameters of interest of order 28 for different algorithms.
Algorithm

Order 28
Stop band attenuation

PM
RGA
PSO
CLPSO
CRPSO

Maximum

Mean

Variance

Std. deviation

18.71
19.3
20.2
22.13
25.22

18.768
24.52
25.09
24.468
26.464

0.004136
15.82
18.38
3.1666
0.4707

0.0643
3.977
4.287
1.779
0.686

Maximum pass
band ripple (normalized)

Maximum stop band

ripple (normalized)

0.115
0.084
0.08
0.072
0.066

0.116
0.109
0.0978
0.0779
0.0547

Table 9
Comparison summary of the parameters of interest of order 36 for different algorithms.
Algorithm

Order 36
Stop band attenuation

PM
RGA
PSO
CLPSO
CRPSO

Maximum

Mean

Variance

Std. deviation

22.06
24.28
25.13
27.0
29.38

22.106
34.02
35.69
35.80
34.89

0.0018
109.398
67.528
120.489
21.566

0.0422
10.459
8.217
10.976
4.644

Maximum pass band

ripple (normalized)

Maximum stop band

ripple (normalized)

0.079
0.086
0.081
0.065
0.061

0.0788
0.0611
0.0554
0.0444
0.0339

5
0

-5

-10
Magnitude (dB)

Magnitude (dB)

-10
-15
-20
-25
-30
PM
RGA
PSO
CLPSO
CRPSO

-35
-40
-45

-30
-40
PM
RGA
PSO
CLPSO
CRPSO

-50
-60
-70

-50
0

0.1

0.2

0.3

0.4
0.5
0.6
Frequency

0.7

0.8

0.9

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

Frequency

Fig. 1. Magnitude (dB) plot of the FIR BS lter of order 20.

Fig. 3. Magnitude (dB) plot of the FIR BS lter of order 36.

The above results may be veried from Tables 79. Similar

observations hold good for BS lters of orders 20 and 28 as
shown in the same tables.
For all BS lters of different orders, the CRPSO algorithm
converges to the least minimum error tness values in nding
the optimum lter coefcients. With a view to the above fact, it
may nally be inferred that the performance of CRPSO algorithm is
the best among all algorithms. All optimization programs were run
in MATLAB 7.5 version on core (TM) 2 duo processor, 3.00 GHz
with 2 GB RAM.

0
-10
Magnitude (dB)

-20

-20
-30
-40

PM
RGA
PSO
CLPSO
CRPSO

-50

5. Conclusions

-60
0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

Frequency
Fig. 2. Magnitude (dB) plot of the FIR BS lter of order 28.

0.9

In this paper, a novel Craziness based Particle Swarm Optimization (CRPSO) technique is applied to the solution of the constrained,
multimodal, non-differentiable, and highly nonlinear FIR band stop
lter design problem to obtain the optimal lter coefcients. With

64

R. Kar et al. / Swarm and Evolutionary Computation 7 (2012) 5864

18
RGA
PSO
CLPSO
CRPSO

16

14

12

10

4
0

10

20

30

40

50

60

70

80

90

100

Iteration cycle
Fig. 4. Convergence prole for RGA, PSO, CLPSO and CRPSO in case of 36th order
BS FIR lter.

almost same level of the transition width, the CRPSO produces the
highest stop band attenuation and the lowest stop band and the
pass band ripples as compared to those of PM algorithm, RGA and
conventional PSO and CLPSO. It is also evident from the results
obtained by a large number of trials that the CRPSO is consistently
free from the shortcoming of premature convergence exhibited by
the other optimization techniques. Thus, it reveals that the CRPSO
may be used as a good optimizer for the solution of obtaining the
optimal lter coefcients in a practical digital lter design problem
in digital signal processing systems.
References
[1] L. Litwin, FIR and IIR digital lters, IEEE Potentials 0278-6648 (2000) 2831.
[2] T.W. Parks, C.S. Burrus, Digital Filter Design, Wiley, New York, 1987.
[3] T.W. Parks, J.H. McClellan, Chebyshev approximation for non recursive digital
lters with linear phase, IEEE Transactions on Circuits Theory CT-19 (1972)
189194.
[4] J.H. McClellan, T.W. Parks, L.R. Rabiner, A computer program for designing
optimum FIR linear phase digital lters, IEEE Transactions on Audio and
Electroacoustics AU-21 (1973) 506526.
[5] L.R. Rabiner, Approximate design relationships for low-pass FIR digital lters,
IEEE Transactions on Audio Electroacoustics AU-21 (1973) 456460.
[6] Z. Lin, An introduction to time-frequency signal analysis, Sensor Review 17
(1997) 4653.
[7] T. Ciloglu, An efcient local search method guided by gradient information
for discrete coefcient FIR lter design, Signal Processing 82 (10) (2002)
13371350.
[8] S.U. Ahmad, A. Antoniou, A genetic algorithm approach for fractional delay
FIR lters, IEEE International Symposium on Circuits and Systems, ISCAS
(2006) 25172520.
[9] N.E. Mastorakis, I.F. Gonos, M.N.S. Swamy, Design of two dimensional
recursive lters using genetic algorithms, IEEE Transaction on Circuits and
SystemsI; Fundamental Theory and Applications (2003) 63463950 (2003)
634639.
[10] Lu Hung-Ching, Tzeng Shian-Tang, Design of arbitrary FIR log lters by
genetic algorithm approach, Signal Processing 80 (2000) 497505.
[11] S.U. Ahmad, A. Andreas, Cascade-form multiplier less r lter design using
orthogonal genetic algorithm, in: IEEE International Symposium on Signal
Processing and Information Technology, 2006, pp. 932937.
[12] W. Tang, T. Shen, Optimal design of FRM-based FIR lters by using hybrid
Taguchi genetic algorithm, in: 2010 International Conference on Green
Circuits and Systems (ICGCS-2010), 2010, pp. 392397.

[13] D. Karaboga, D.H. Horrocks, N. Karaboga, A. Kalinli, Designing digital FIR

lters using Tabu search algorithm, IEEE International Symposium on
Circuits and Systems, 1997, ISCAS 97, vol. 4, pp. 22362239.
[14] S. Chen, IIR model identication using batch-recursive adaptive simulated
annealing algorithm, in: 6th Annual Chinese Automation and Computer
Science Conference, 2000, pp. 151155.
[15] N. Karaboga, A new design method based on articial bee colony algorithm
for digital IIR lters, Journal of the Franklin Institute 346 (4) (2009) 328348.
[16] N. Karaboga, B. Cetinkaya1, Design of digital FIR lters using differential
Evolution algorithm, Circuits Systems Signal Processing 25 (5) (2006)
649660.
[17] G. Liu, Y.X. Li, G. He, Design of digital FIR lters using differential evolution
algorithm based on reserved gene, in: IEEE Congress on Evolutionary
Computation, July 2010, pp. 17.
[18] H. Gao, M. Diao, Differential cultural algorithm for digital lters design, in:
Second International Conference on Computer Modelling and Simulation,
2010, vol. 3, pp. 459463.
[19] M.Najjarzadeh, A. Ayatollahi, FIR digital lters design: particle swarm
optimization utilizing LMS and minimax strategies, in: IEEE International
Symposium on Signal Processing and Information Technology, ISSPIT 2008,
pp. 129132.
[20] D.J. Krusienski, W.K. Jenkins, A modied particle swarm optimization algorithm for adaptive ltering, in: IEEE International Symposium on Circuits and
Systems, ISCAS 2006, pp. 137140.
[21] J.I. Ababneh, M.H. Bataineh, Linear phase FIR lter design using particle
swarm optimization and genetic algorithms, Digital Signal Processing 18 (4)
(2008) 657668.
[22] W. Fang, J. Sun, W. Xu, J. Liu, FIR digital lters design based on quantumbehaved particle swarm optimization, in: First International Conference on
Innovative Computing, Information and Control, ICICIC 06, vol. 1, pp. 615619.
[23] B. Luitel, G.K. Venayagamoorthy, Particle swarm optimization with quantum
infusion for system identication, Engineering Applications of Articial
Intelligence 23 (5) (2010) 635649.
[24] A. Sarangi, R.K. Mahapatra, S.P. Panigrahi, DEPSO and PSO-QI in digital lter
design, Expert Systems with Applications 38 (9) (2011) 1096610973.
[25] X. Yu, J. Liu, H. Li, An adaptive inertia weight particle swarm optimization
algorithm for IIR digital lter in: International Conference on Articial Intelligence
and Computational Intelligence, 2009, AICI 09, vol. 1, pp. 114118.
[26] D. Jia, Y. Jiao, J. Zhang, Satisfactory design of IIR digital lter based on chaotic
mutation particle swarm optimization, in: 3rd International Conference on
Genetic and Evolutionary Computing, 2009, WGEC 09, pp. 4851.
[27] Y. Gao, Y. Li, H.Qian, The design of IIR digital lter based on chaos particle
swarm optimization algorithm, in: Second International Conference on
Genetic and Evolutionary Computing, 2008, WGEC 08, pp. 303306.
[28] Z.F. Hao, G.H. Guo, H. Huang, A particle swarm optimization algorithm with
differential evolution, in: International Conference on Machine Learning and
Cybernetics, 2007, vol. 2, pp. 10311035.
[29] B. Luitel, G.K. Venayagamoorthy, Differential evolution particle swarm
optimization for digital lter design, in: IEEE World Congress on Computational Intelligence (IEEE Congress on Evolutionary Computation), CEC 2008,
pp. 39543961.
[30] J. Kennedy, R. Eberhart, Particle swarm optimization, in: Proceedings of the
IEEE International Conference on Neural Network, 1995, pp. 19421948.
[31] R.C. Eberhart, Y..Shi, Particle swarm optimization: developments, applications and resources, evolutionary computation, in: Proceedings of the 2001
Congress on Evolutionary Computation, 2001, pp. 8186.
[32] S.H. Ling, H.H.C. Iu, F.H.F. Leung, K.Y. Chan, Improved hybrid particle swarm
optimized wavelet neural network for modeling the development of uid
dispensing for electronic packaging,, IEEE Transactions on Industrial Electronics 55 (9) (2008) 34473460.
[33] B. Biswal, P.K. Dash, B.K. Panigrahi, Power quality disturbance classication
using fuzzy C-means algorithm and adaptive particle swarm optimization,
IEEE Transactions on Industrial Electronics 56 (no. 1) (Jan. 2009) 212220.
[34] D. Mandal, S.P. Ghoshal, A.K. Bhattacharjee, Radiation pattern optimization
for concentric circular antenna array with central element feeding using
Craziness based Particle Swarm Optimization, International Journal of RF and
Microwave Computer-Aided Engineering 20 (5) (Sept. 2010) 577586.
[35] D. Mandal, S.P. Ghoshal, A.K. Bhattacharjee, Application of evolutionary
optimization techniques for nding the optimal set of concentric circular
antenna array, Expert Systems with Applications 38 (2010) 29422950.
[36] J.J. Liang, A.K. Qin, P.N. Suganthan, S. Baskar, Comprehensive Learning particle
swarm optimizer for global optimization of multimodal functions, IEEE
Transactions on Evolutionary Computation 10 (3) (2006) 281295.
[37] J. Derrac, S. Garca, D. Molina, F. Herrera, A practical tutorial on the use of
nonparametric statistical tests as a methodology for comparing evolutionary
and swarm intelligence algorithms, Swarm and Evolutionary Computation
1 (1) (2011) 318.