International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882

Volume 4, Issue 6, June 2015

Soft Computing Technique for the Design of Optimal Stable Digital FIR Band
Stop Filter
Arshpreet1, Balraj Singh2
1

Department of Electronics and Communication Engineering, Giani Zail Singh Punjab Technical University Campus, Bathinda,
Punjab, India
2
Associate Professor, Department of Electronics and Communication Engineering, Giani Zail Singh Punjab Technical University
Campus, Bathinda, Punjab, India

ABSTRACT
Differential Evolution (DE) algorithm is a fast, efficient
and robust population based stochastic search technique
of global optimization which finds near optimal solution
in terms of the set of filter coefficients and used for
solving various optimization problems. This paper
explores different mutation strategies of DE algorithm
for the design of digital FIR band stop filter. In this five
mutation strategies of DE algorithm are implemented
and various parameters have been tuned. The
effectiveness of the DE algorithm is validated by
designing the digital FIR band stop (BS) filters in order
to approximate the magnitude response, minimizing pass
band and stop band ripples. The results reveal that the
purposed algorithm can optimize the digital FIR filter in
terms of minimizing the magnitude error and ripple
magnitude of both pass band and stop band.
Keywords - Digital FIR Band Stop filter, Differential
Evolution (DE) algorithm, Ripple magnitude response,
Magnitude response.

1. INTRODUCTION
Signals are the detectable quantities used to convey
information about time-varying physical phenomena.
The example of such signals is human speech,
temperature, pressure, etc. Therefore, signals arise in
almost every field of science and engineering. Signals
are basically categorized as continuous time and discrete
time signals. The analog signals are called continuous
time signal having some value at every instant of time.
The Digital signals are discrete time signal and are
defined only at particular set of time instant. Therefore,
they are represented as a sequence of number that has a
continuous range of values. The numerical manipulation
of signals and data in discrete-time signals is called
digital signal processing. The advances in the Integrated
Circuit technology had a major impact on the DSP. The
inherent flexibility, higher performance in terms of
attenuation and selectivity, better time and environment
stability along with lower equipment production costs of
digital elements permits the utilization of a variety of

sophisticated signal processing technique which had

previously been impractical to implement. Application
of Digital Signal Processing is widely used in the area of
biomedical engineering, speech communication,
telephony, nuclear science, image processing, radar,
seismology, and many more [2,3,4,7,8,13].
DSP algorithm or processor can be described as a
filter. Filtering is a process by which the frequency
spectrum of a signal can be modified, reshaped, or
manipulated according to some desired specifications.
There are four main filter shapes: Low Pass, High Pass,
Band Pass, and Band Reject (or Band Stop). Filters
perform two basic function signal separation and signal
restoration. Signal separation is done when a signal gets
contaminated due to interference, noise or other signal.
Signal restoration is done d when a signal gets distorted
in some way. These problems can be solved with the
help of analog and digital filters. The digital filters are
superior in the level of performance as compared to
analog filter. Analog filters is an electronic circuit
operating on continuous time analog signal and consists
of active and passive basic elements like amplifiers,
capacitors, resistors etc, whereas digital filter operate on
discrete time signals and consist of DSP processor and
controller which are
used for signal analysis and
estimation. Analog filter are cheap, fast and easy to
assemble but these electronic components impose
restriction on the accuracy and stability. Digital filter
may be more expensive than an analog filter due to their
increased complexity, but they make many practical
designs that are impractical or impossible as analog
filters. Thus digital filter outperforms analog filter in
many aspect. There are two basic types of digital filters,
Finite Impulse Response (FIR) and Infinite Impulse
Response (IIR) filters. FIR filter has a number of
advantages like guaranteed stability, free from phase
distortion and low coefficient sensitivity and simplicity
which make it preferred over the IIR filter [2, 3, 4, 5, 8,
14].
Various methods exist for designing of digital FIR
filter such as window functions Butterworth, Chebshev,
Kaiser, etc. but they limit the infinite length impulse

www.ijsret.org

696

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

response of ideal filter into a finite window to design an

actual response. For designing the digital filter it
involves various objective function such as control of
various parameters and is highly non-uniform, nonlinear, etc. To satisfy such objective function an
evolutionary optimization method was introduced. Based
on this method different stochastic optimization methods
have been developed, which have proved themselves
quite efficient for the design of FIR filter like Genetic
Algorithm, simulated annealing, Tabu Search, artificial
bee colony optimization differential evolution and many
more. GA proves itself to be far efficient in terms of
obtaining local optimum while maintaining its moderate
computational complexity but they are not very
successful in determining the global minima in terms of
convergence
speed
and
solution
quality
[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15].
The approach detailed in this paper for the designing
of digital FIR Band Stop filter is differential evolution
(DE) algorithm. DE algorithm is a stochastic technique
introduced by Storn and Price in 1995. This algorithm is
most favored by engineers for solving continuous
optimization problem. It is faster and robust solution for
numerical optimization problem and is more likely to
find the function true global optimum. In this five
mutation strategies of DE algorithm are used and various
parameters which are population size, mutation factor
and crossover rate are tuned [1, 2, 3, 4, 5, 7, 8, 9, 10, 11,
12, 13, 14].
The paper is organized in five different sections as
follows-Section 2 FIR filter design problem is
formulated. Section 3 Discussion on DE algorithm.
Section 4 presents the simulation results obtained from
digital FIR band stop filter. Section 5 it concludes paper.

where, h (n) represents the impulse response of filter.

The difference equation representation is described as:
y(n) h(0)x(n) h(1)x(n 1) .... h(N)x(n N) (3)
where, N is the order of the filter having (N+1) number
of coefficients. The value of h (n) determines the type of
the filter i.e. low pass, high pass, band pass and band
stop. The linear phase FIR filter has a symmetric
property, according to this the dimension of the problem
is halved and only half the coefficients are updated. The
condition for symmetric property is:
h (n) = n (N+2-n)
(4)
where, N is the order and number of coefficient to be
optimized is (N+1/2). The frequency Response of the
FIR digital filter is described as:
N

H( ) h(n)e
k
n 0

Digital filters are used to perform mathematical

operations on input signal and give the desired output.
The digital filters are mainly of two types: Finite
Impulse Response (FIR) and Infinite Impulse Response
(IIR). This paper presents design of linear phase FIR
Band stop filter using differential evolution. The
advantage of using FIR filter is that it can achieve
exactly linear phase frequency response and depends
upon present and past inputs because there is no
feedback therefore, it is also called non-recursive filter.
The impulse response of FIR filter is characterized as:
(1)
Hz h0 h1 z 1 ..... hN z N

where, k = 2Nk , H (k) represents Fourier transform

complex vector. The ideal response of band stop FIR
filter is described as:

0 for pl ph ;
H (k )
i
otherwise
1

(6)
where, pl and ph are the cut-off frequencies of band
stop filter. The main objective of FIR filter is to find out
the filter coefficients using optimization algorithm to
minimize the approximation error function for
magnitude and ripple magnitude of pass band and stop
band. The optimization algorithm used here is
differential evolution. The performance of FIR digital
filter is calculated using error function. The e1(x) denotes
the absolute error of the magnitude response and e2(x)
denotes the mean squared error of the magnitude
response of FIR filter and are defined as given below:

N
e 2 x H d ( k ) H( k , x)
k 0

(2)

(7)
2

(8)
where, is the magnitude response of the designed
approximate filter; is the magnitude response of the
obtained filter
The desired magnitude response of FIR filter is given as:
H ( )
d
k

1, for k passband

0, for k stopband

(9)

The ripple magnitudes of pass-band and stop-band are to

be minimized, which are denoted by p(x) and s(x)
respectively. Ripple magnitudes are defined as:

n 0

(5)

e1x H d (k ) H(k , x )
k 0

2. DESIGN FORMULATION OF DIGITAL

FIR FILTER

or, H(z) h(n)z N

jk n

p (x)

www.ijsret.org

max
min
H( , x)
H( , x) for i passband (10)
k
k

k
k

697

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

s (x)

max

H( k , x)

for i stopband

(11)

The four objective functions to be optimized is defined

as
Minimize O1(x) = e1(x)
Minimize O2(x) = e2(x)
Minimize O3(x) = p(x)
Minimize O4(x) = s(x)

The multi objective constrained optimization problem

for the design of digital FIR filter is converted into a
scalar constrained optimization problem by using
weighting method. The objective function to be
optimized is defined as:
4

Minimize f(x) =

w o
a 1

DE starts with a population of NP candidate solutions

which is represented as shown in equation (13). At every
generation G during the optimization process, DE
maintains a population X(G) of NP vectors of candidate
solutions to the problem at hand. The population of NP
candidate is shown as:
G)
(13)
X ( G ) X 1( G ) ,....., X i( G ) ,....., X (NP

(x)

where, wa is non-negative real number

weight[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15].

where, i=1,2,..........NP. i index denotes the population

and G denotes the generation to which the population
belongs. Each candidate solution Xi is a D-dimensional
vector, containing as many integer-valued parameters
(14) as the problem decision parameters as:
(14)
Xi(G) x1(,Gi ) ,....x (j,Gi ) ,....,x (DG,i)

where, j=1,2,.........D
(12)
called

3. DIFFERENTIAL EVOLUTION
Differential Evolution (DE) is new floating point
encoded evolutionary computational technique for
global optimization which was proposed by Storn and
Price in 1995. The innovation of a new optimization
technique is a population based stochastic search
technique for minimizing these different types of
nonlinear, non-differentiable, and non-convex functions
which have found their wide application in a number of
branches of engineering. DE incorporates only a few
control parameters with negligible parameter tuning,
ability to find the true global minimum regardless of the
initial parameter values, quick convergence, easy
implementation, simple and high performance. This
particular optimization process can be utilized in an
effective way in various engineering problems, such as
design of digital filters electromagnetic inverse
problems, antennas, composite materials and so on.
DE evolutionary approach comprises of four stages
namely Initialization, Mutation, Crossover or
Recombination and Selection. The main idea behind DE
algorithm is that it generates the trial parameter vectors
and in each step DE mutates vectors by adding weighted,
random vector differentials to them. If the objective or
fitness function of the trial vector is better than that of
the target, the trial vector replaces the target vector in the
next generation.

3.1 Parameter setup

The various key parameters that control the Differential
Evolution are size of population NP, dimension D of a
individual also known as variables, (3) Mutation factor
(F), Crossover rate (CR) and the stopping criterion of
maximum number of iterations (generations) Gmax.

3.2 Initialization
In this the population of candidate solutions is initialized
with random values generated according to a uniform
probability distribution in the D dimensional problem
space. Initialize the entire solution population within the
given upper and lower limits of the search space. The
population is initialized as:

x (j,Gi 0) x min
rand j 0,1 x max
x min
j
j
j

(15)

where, i=1,2,..........NP, j=1,2,.........D, randj [0,1] is

uniform random number between 0 and 1, x (j,Gi 0) is the
initial value (G=0) of the jth parameter of the ith
individual vector. x min
and x max
are the lower and upper
j
j
bounds of the jth decision parameter, respectively. Once
every vector of the population has been initialized, its
corresponding fitness value is calculated and stored for
future reference. The population size is varied from 50 to
150.

3.3 Mutation
After initializing the population, DE employs the
mutation operation to produce a mutant vector Vi( G1)
with respect to each individual Xi(G) so-called target
vector, in the current population. At every generation G,
each vector in the population has to serve once as a
target vector Xi(G) , the parameter vector has index i, and
is compared with a mutant vector. The mutation operator
generates mutant vectors (Vi(G+1)) by perturbing a
randomly selected vector (Xr1) with the difference of two
other randomly selected vectors (Xr2 and Xr3). The
mutant vector is produced as:
(16)
Vi( G 1) X (r1G ) F( X (r G2 ) X (r G3 ) )
where, i = 1,........,NP. The Vector indices r1, r2 and r3
are mutually exclusive integers randomly generated

www.ijsret.org

698

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

within the range (1,,NP) which are different from the

index i. These indices are randomly generated once for
each mutant vector. The mutation factor F is a positive
control parameter for scaling the difference vector,
which ensure that the running index i is different from
the other three distinct indices r1, r2 and r3. For each
target vector at the generation, its associated mutant
vector can be generated via certain mutation strategy.
The five variations mutation strategies implemented are:
G)
Vi( G 1) X (best
F( X (r G2 ) X (r G3 ) )

(17)

)
Vi( G 1) X (r1G ) F( X (r G2 ) X (r G
)
3

(18)

G)
Vi( G 1) X i( G ) (X (best
X i( G ) ) F(X (r1G ) X (rG2 ) ) (19)

G)
)
(G )
(G )
Vi(G 1) X(best
F(X(r1G) X(rG
2 X r3 X r 4 )

(20)

Vi( G 1) X 5( G ) F(X (r1G ) X (rG2 ) X (rG3 ) X (rG4 ) )

(21)

G)
where, i = 1,...,NP. X (best
is the best performing vector of the

current generation, F is the mutation factor. The mutation

factor is varied from 0.6 to 1

3.4 Crossover
After the mutation phase, crossover operation is applied
to each pair of the target vector (Xi(G)) and its
corresponding mutant vector (Vi(G+1)) to generate a trial
vector (Ui(G)) .the trial vector is expressed as:

(G)
i

(G 1)
j,i

v (j,Gi 1) if rand j (0,1) CR or j s

(G )
otherwise
x j,i

(22)

where, j=1,2,.........D. The crossover constant CR is a

user-defined value (known as the crossover
probability), which is usually selected from within the
range [0,1] which controls the fraction of parameter
values copied from the mutant vector. S is a randomly
chosen integer in the range (1,,D). The randj is a
uniformly distributed random number within the range
(0,1) generated a new for each value of j. The crossover
operator copies the jth parameter of the mutant vector
(Vi(G+1) ) to the corresponding element in the trial vector
(Ui(G)) if randj(0,1)CR or j=s otherwise, it is copied
from the corresponding target vector (Xi(G)).The
condition j=s is introduced to ensure that the trial vector
will differ from its corresponding target vector by at
least one parameter. The crossover rate is varied from
0.1 to 0.3.

3.5 Selection
The selection operator is applied in the last stage of the
DE procedure. The objective function value of each trial
vector (Ui(G)) is compared to that of its corresponding
target vector (Xi(G)) in the current population. If the trial

vector has less or equal objective function value than the

corresponding target vector, the trial vector will replace
the target vector and enter the population of the next
generation. Otherwise, the target vector will remain in
the population for the next generation. The selection
operation can be expressed as follows:

( G 1)
i

( G 1)

U i

(G )

Xi

if f ( Ui( G 1)

f (Xi( G ) )

(23)

otherwise

The above three steps i.e. mutation, crossover and

selection process are repeated generation after
generation until it reaches maximum number of
generations or other predetermined convergence
criterion is satisfied[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15].

3.6 DE Algorithm
The overall procedure of the DE optimization program
has been described as follows:
Step1: Set up all required parameters of the DE
optimization process.
Step2: Set generation G = 0 for initialization
Step3: Initializing the population X of individuals
according to equation (15)
Step4: Calculate and evaluate the fitness values of the
initial individuals according to the problems
fitness function.
Step5: Rank the initial individuals according to their
fitness.
Step6: Set iteration G = G+1.
Step7: Apply mutation operator to generate mutant
vectors (Vi(G+1)) according to equation (16) and
a select the DE mutation operator strategy.
Step8: Apply crossover operator to generate trial vectors
(Ui(G+1)) according to equation (22).
Step 9: Apply selection operator according to equation
(23) by comparing the fitness of the trial vector
(Ui(G+1)) and the corresponding target vector
(Xi(G+1)) and then select one that provides the
best solution.
Step10: Calculate and evaluate the fitness values of new
individuals according to the problems fitness
function.
Step11: Rank new individuals by their fitness.
Step12: Update the best fitness value of the current
iteration and the best fitness value of the
previous iteration.
Step13: Check the termination criteria. If the current
generation remains not over the maximum
number of generations G < Gmax, set G = G + 1
and return to step 7 for repeating to search the
solution. Otherwise, go to step 14.
Step14: Stop

www.ijsret.org

699

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015
Table 2: Filter coefficients obtained for designing BS
FIR filter on order 26

4. RESULTS AND DISCUSSION

The differential evolution algorithm is used for the
designing of band stop FIR digital filter using five
mutation strategies. The algorithm is implemented by
varying the different parameters such as order of filter,
population size, mutation factor and crossover rate. The
band stop FIR digital filter is designed by 200 equally
spaced points within frequency domain [0, ]. The
design condition for the band stop filter design is shown
in table1.

h(n)

Filter Coefficients

h(0) = h(26)

-.008846

h(1) = h(25)

-.000537

h(2) = h(24)

.021539

h(3) = h(23)

.000462

h(4) = h(22)

-.007780

h(5) = h(21)

-.000186

h(6) = h(20)

-.049288

h(7) = h(19)

-.000682

h(8) = h(18)

.098207

h(9) = h(17)

.000617

h(10) = h(16)

-.014797

h(11) = h(15)

.000438

h(12) = h(14)

-.539354

h(13)

-.000975

Table 1: Design conditions for Band Stop filter

Filter
Type
Band
Stop

Pass Band

Stop Band

0 0.25 0.4 0.6

0.75

Max Value
Of H(, x)
1

The mutation strategy 2 has been implemented for filter

order varying from 12 to 32 and for each order the
algorithm runs 100 times. The Fig1 depicts graph which
shows variation in objective function with variation in
order of filter. It is observed that objective function at
order 26 on mutation strategy 2 is minimum. The
objective function at order 26 is 0.904548 and is applied
on different strategies having magnitude error 1 is
0.472452, magnitude error 2 is 0.0594441, pass band
ripple and stop band ripple are 1.005115 and 0.010715.

In this first five mutation strategies are applied on order

26. The minimum objective function is obtained at order
26. The table3 depicts the objective function for different
strategies for order 26.The best mutation strategy with
minimum objective function is at strategy 2 having value
0.904548 selected.
Table 3: Objective function for different strategies for
order 26

Figure1: Objective function verses filter order for

mutation strategy 2

The filter order at 26 results in number of coefficients as

27. In this only half of the coefficients are calculated due
to symmetric property as shown in table 2.

www.ijsret.org

Mutation Strategy

Objective Function

Mutation Strategy 1

1.120743

Mutation Strategy 2

0.904548

Mutation Strategy 3

0.956694

Mutation Strategy 4

1.711746

Mutation Strategy 5

1.041299

700

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

In this population size is varied from value 50 to 150 on

mutation strategy 2 and order 26. The best population is
obtained at 130 population which is selected to design
Band stop FIR filter having objective function value is
0.830642. The Fig 2 depicts graph which shows the
variation in objective function with variation in
population size.

Figure 4: Graph between objective function and crossover

rate

Figure 2: Objective function verses population size at filter

order 26

The absolute magnitude response of digital FIR band

stop filter has been obtained at order 26 by obtaining the
values for different parameters. The Fig 5 depicts graph
which shows the variation in absolute magnitude
response of order 26 with variation in normalized
frequency and the Fig 6 depicts graph which shows the
variation in magnitude response in db with variation in
normalized frequency of order 26 to design Band Stop
filter.

The mutation vector is varied from 0.6 to 1.0 on

population size 130 mutation strategy 2 and order
26.The minimum value of objective function is 0.829528
at 0.75 mutation factor. The Fig 3 depicts graph which
shows the variation in objective function with variation
in mutation factor.

Figure 5: Graph between Absolute Magnitude Response

and Normalized Frequency

Figure 3: Objective function verses mutation factor at

filter order 26

The crossover rate value is varied from 0.1 to 0.3. The

minimum objective function is obtained at 0.25 having
value 0.8293541 is selected to design Band Stop FIR
digital filter. The Fig 4 depicts the graph which shows
variation in objective function with variation in
crossover rate.
www.ijsret.org

Figure 6: Graph between Magnitude Responses and

Normalized Frequency

701

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

The Fig 7 depicts graph which shows the variation in

phase response with variation in normalised frequency
of order 26 to design Band Stop FIR filter.

than 1, therefore it authenticates that the obtained results

are robust and efficient in nature.

REFERENCES
Storn R. and Price K, (1997), Differential
Evolution -A Simple and Efficient Heuristic for
Global Optimization over Continuous Spaces,
Journal of Global Optimization, 11, pp. 341359.
[2] Sen M Kuo and Bob H Lee, (2001), Real-Time
Digital Signal Processing, John Wiley and Sons
Ltd.
[3] N. Karaboga, (2005), Digital IIR Filter Design
Using Differential Evolution Algorithm, EURASIP
Journal on Applied Signal Processing, vol. 8.
[4] A. K. Qin, V. L. Huang, and P. N. Suganthan,
(2009),Differential Evolution Algorithm With
Strategy Adaptation for Global Numerical
Optimization, IEEE Transactions on Evolutionary
Computation,vol.13,no.2.
[5]
S. Mondal, Vasundhara, R. Kar, D. Mandal, S. P.
Ghoshal, (2011) , Linear Phase High Pass FIR
Filter Design using Improved Particle Swarm
Optimization, World Academy of Science,
Engineering and Technology, vol.5.
[6]
S. Mondal, S.P. Ghoshal, R. Kar, D. Mandal,
(2012), Novel Particle Swarm Optimization for
Low Pass FIR Filter Design, WSEAS Transactions
on Signal Processing, vol.8, no.3.
[7]
S. Mandal, S. P. Ghoshal, P. Mukherjee, D.
Sengupta, R. Kar, D. Mandal, (2012), Design of
Optimal Linear Phase FIR High Pass Filter using
Improved Particle Swarm Optimization, ACEEE
International Journal on Signal & Image Processing,
vol. 03, no. 01.
[8]
A. Chandra,S. Chattopadhyay, (2012),Role of
Mutation Strategies of Differential Evolution
Algorithm in Designing Hardware Efficient
Multiplier-less Low-pass FIR Filter, Journal of
Multimedia,vol.7,no.5.
[9]
C. Patil, A. Bhalvi, R. Dubeys, (2013), Design
of Low Pass FIR Filter Using D.E. Algorithm,
IORD Journal of Science & Technology, vol. 1,
no.1.
[10]
M. Bansal, D. S. Sidhu, B. S. Sidhu, (2014),
Optimal Design of Digital IIR Band Pass Filter
Using Practical Swarm Optimization, International
Journal of Advanced Research in Computer Science
and Software Engineering vol.4, no.5
[11]
D. Singh, J.S. Dhillon, (2014), IIR Band Pass
and Band Stop Filter Design Employing TeachingLearning
based
Optimization
Technique,
[1]

Figure 7: Graph between phase response and normalized

frequency

The maximum, minimum, average value of objective

function with mutation strategy 2 along with standard
deviation is shown in table 4.
Table 4:- Maximum, Minimum, Average value of objective
function with Mutation Strategy 2 along with Standard
Deviation
Maximum
Minimum
Average
Standard
Value
Value
Value
Deviation

0.516255

0.48431

0.500023

0.006771

The standard deviation value .006771 is less than 1, it

authenticates that the obtained results are robust and
efficient.

5. CONCLUSION
Differential Evolution (DE) algorithm is applied to
design Band Stop FIR digital filter on order 26. In this 5
mutation strategies are applied on filter order 26 out of
which the mutation strategy 2 gives the best objective
function. After this, the DE algorithm parameters are
varied to achieve the optimum value of objective
function. It is concluded that population size 130,
mutation factor 0.75 and crossover rate 0.25 gives the
optimum value of objective function. The results
obtained by proposed DE are better in magnitude error
and ripple magnitude in pass band and stop band. The
digital FIR filter is a fast, stable and gives better
performance and the proposed DE algorithm is a
powerful tool and efficient for designing various filters.
The standard deviation value is 0.006771 which is less

www.ijsret.org

702

International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 4, Issue 6, June 2015

International Journal of Computer Applications,

vol.104, no.14.
[12]
I. Kamra, D.S. Sidhu, B.S. Sidhu, (2014),
Design of Digital IIR Low Pass Filter Using
Particle Swarm Optimization (PSO), International
Journal of Scientific Research Engineering &
Technology (IJSRET), vol.3, no.2.
[13]
Neha, A. P. Singh, (2014), Design of Linear
Phase Low Pass FIR Filter using Particle Swarm
Optimization Algorithm, International Journal of
Computer Applications, vol.98, no.3.
[14]
A. Singh and N. R. Grewal, (2014), Review on
FIR Filter Designing by Implementations of
Different Optimization Algorithms, International
Journal of Advanced Information Science and
Technology (IJAIST), vol.31, no.31.
[15]
S. Sharma, S. Katiyal , L. D. Arya, (2015),
Design of Linear-Phase Digital FIR Filter Using
Differential Evolution Optimization with an
Improved Ripple Constraint Handling Method,
BIJIT - BVICAMs International Journal of
Information Technology, vol.7,no.1.

www.ijsret.org

703