Int. J. Electron. Commun.

(AE) 70 (2016) 8594

Contents lists available at ScienceDirect

International Journal of Electronics and

Communications (AE)
journal homepage: www.elsevier.com/locate/aeue

Adjustable window based design of multiplier-less cosine modulated

lter bank using swarm optimization algorithms
I. Sharma a, , A. Kumar a , G.K. Singh b
a
b

PDPM-Indian Institute of Information Technology Design and Manufacturing, Jabalpur 482005, India
Indian Institute of Technology Roorkee, Roorkee 247667, India

a r t i c l e

i n f o

Article history:
Received 22 June 2015
Accepted 21 October 2015
Keywords:
Roll-off factor
Multiplier-less lter bank
Canonic signed digit
Cuckoo search algorithm
Articial bee colony algorithm

a b s t r a c t
In this paper, an adjustable window based approach is presented for the design of multiplier-less near
perfect reconstruction cosine modulated lter bank (CMFB) for specied stopband attenuation (As ) and
channel overlapping. Kaiser window function is employed for designing the computationally efcient
prototype lter with lter coefcients in canonic signed digit (CSD) space. Optimized performance of
the designed lter is achieved using swarm based algorithm such as cuckoo search (CS) optimization,
so that the lter coefcients of a multiplier-less prototype lter are optimized to achieve the magnitude
response of 0.707 at frequency = /2M. In this method, instead of using two optimization techniques:
one for designing continuous coefcients and other for optimizing quantized prototype lter coefcients,
single swarm based technique is used, while a comparative study using proposed scheme based on the
performance of different window functions as well as different swarm based techniques such particle
swarm optimization (PSO) and articial bee colony (ABC) algorithm is made. Design examples presented,
using this technique, illustrates the improved performance of proposed technique as compared to other
published algorithms.
2015 Elsevier GmbH. All rights reserved.

1. Introduction
During the past few years, design of multirate lter banks has
become an important eld of research due to continuously increasing numerous applications of signal processing such as power
harmonic analysis [1], EEG signal analysis [2], and image analysis
and classications [3]. The research effort was originally motivated
by the subband coder for audio signal, image and video signals for
transmission and storage purpose. Subsequently, this was extended
to various elds such as beam forming antenna, and communication systems [4]. Filter banks are classied into two types: rst
is two-channel lter bank, also known as quadrature mirror lter (QMF) bank and second is multi-channel lter bank (FB) based
on separation of input signal into number of sub-bands [4]. Cosine
modulated based multichannel lter bank is widely used in different applications due to its simple and efcient design; in which
only one prototype lter is needed to design, and rest of other
composing lters are derived from it using cosine modulation [4].
Efciency of all the subband coders used in various applications

Corresponding author. Tel.: +91 7587148908.

E-mail addresses: ilasharma23@gmail.com (I. Sharma), anilkdee@gmail.com
(A. Kumar), gksngfee@gmail.com (G.K. Singh).
http://dx.doi.org/10.1016/j.aeue.2015.10.008
1434-8411/ 2015 Elsevier GmbH. All rights reserved.

mentioned above is signicantly dependent on optimal design of

cosine modulated lter banks. Therefore, several algorithms have
been proposed for optimal design of cosine modulated lter bank
(CMFB) using linear search optimization [511] and evolutionary
techniques [12,13]. In linear search optimization based algorithms
[511], either pass-band edge frequency (p ) or 3 dB cutoff frequency (c ) was optimized to get optimal reconstruction error.
In [12,13], evolutionary techniques such as PSO, and Memetic
optimization were used to compute the optimal value of cutoff frequency. In [14], authors have proposed a closed form method for
optimal designing of CMFB, and were further modied in [15].
In several applications, digital lters and lter banks are
required to be designed such that they can satisfy some sophisticated design specications such as high stopband attenuation, fast
switching resolution and small channel overlapping that is important for high quality reconstruction of audio signal [3,5,1416],
fast switching resolution and adjustable stopband attenuation is
more essential for biomedical signal processing [3,14,15]. For hearing aids, a lter bank with adjustable gain characteristics in the
required band of frequency is required [17,18]. In software dened
radio (SDR) application, a exible technology is required that
provides multi-band, multi-standard and multi-service, for which
several important features of the channel lters such as low complexity, low power consumption and recongurable are required

86

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

[19,20]. When digital lters are realized in hardware, adders and

multipliers are needed. Multipliers are the expensive components
than adder rising implementation complexity, and consume more
power and space [21,22]. If coefcients of lter are represented in
sign power of two terms (SPT), then multipliers can be realized
as a simple circuit, consisting of adder and shifter; and hence, the
circuit becomes multiplier-less that reduces the implementation
complexity, area requirement and power consumption [2123].
Signed digit number system provides diversity in representation, while canonic signed digit representation is a unique case of
signed digit number system, which possesses special qualities with
minimum number of SPTs, providing efcient implementation of
multiplier into adders and shifters [2123]. Thus, the resulting lter becomes multiplier less; and this leads to realization of lter
with less implementation complexity with low power and low silicon area. Therefore, during the past few years, several researchers
have developed the new design of digital lters which were computationally efcient and with low hardware requirement [2225].
When continuous lter coefcients are rounded in terms of
quantized CSD valued coefcients, performance of the lter is deteriorated and given specications are no longer satised. Therefore,
to overcome these problems, authors in [26] have used genetic
algorithm (GA) for designing digital lter with optimal performances. Since then, several designs for digital lter and lter banks
have been proposed based on GA [2730]. Recently, evolutionary
algorithms (EA) such articial bee colony (ABC), differential evolution (DE), harmony search algorithm (HSA), gravitational search
algorithm (GSA), CS algorithm and PSO have been developed and
have become more promising optimization techniques in problem
solving due to their multi dimension and multivariable steps for
achieving a global solution [3841]. Therefore, researchers have
exploited these techniques for designing optimal digital lter banks
[30,31]. Multiplier-less recongurable non-uniform channel lters using meta-heuristic algorithms have been proposed, where
DE, HAS, gravitational search algorithm and articial bee colony
algorithm were used to design the multiplier-less recongurable
non-uniform channel lters [32,33]. Then, modied meta-heuristic
algorithms such as modied ABC algorithm, GA, and GSA have
been employed to design frequency response masking (FRM) based
multiplier-less uniform and non-uniform lter bank [34,35], while
authors in [36,37] have used linear search technique for designing lter bank and represented the lter coefcients in CSD form
and DE for digital lter, respectively. In all the methods discussed
above for designing multiplier-less lter banks, two optimization
techniques have been used. Initially, continuous lter coefcients
of a prototype lter are derived to satisfy perfect reconstruction,
and then CSD coefcients are optimized using evolutionary techniques. There is no technique available for designing digital lter
bank that can satisfy sophisticated design specications, give perfect reconstruction and also optimize the CSD coefcients using
single optimization.
Therefore in above context, in this paper, an adjustable window
based simplied design of multiplier-less CMFB is proposed, using
evolutionary technique. This technique is more efcient than other
existing techniques as instead of using complex objective function, multiplier-less prototype lter coefcients are computed at
= /2M in each iteration using evolutionary techniques such CS
algorithm, ABC and PSO algorithm. In other words, optimization is
done in single step, i.e. lter coefcients are generated and converted into quantized CSD value each time inside the respective
swarm based algorithm used for optimization. There is no need of
generating lter coefcients separately, and then again optimizing
the CSD rounded coefcients.
Organization of this paper is as follows: Section 2 gives a brief
review and analysis of CMFB bank. Section 3 presents the general overview of CS algorithm. In Section 4, an overview of CSD is

provided. Section 5 comprises of a detailed description of the

proposed methodology for CMFB. Finally, the simulation results
obtained with the proposed method are discussed in Section 6,
followed by the conclusion in Section 7.
2. Overview of cosine modulated lter bank
Multichannel lter bank consists of a bank of band pass lters,
arranged in parallel form along with down-samplers and up samplers as shown in Fig. 1 [4,8]. It can be seen that Hl (z) and Fl (z)
represents the analysis lter bank and synthesis lter bank, respectively. Relation between input and output of CMFB shown in Fig. 1
is dened in z-domain as [4,8]:
Y (z) = T0 (z)X(z) +

M1


Ts (z)X(zej2s/M ),

(1)

s=0

where
1
Fl (z)Hl (z),
M

(2)

1
Fl (z)Hl (zej2s/M ) for s = 1, 2, . . ., M 1;
M

(3)

M1

T0 (z) =

and
M1

Ts (z) =

Here, T0 (z) denotes the distortion transfer function responsible for distortion occurred due to overall system and Ts (z) denotes
the alias transfer function, which determines how worst the input
signal is attenuated [3,4,8].
When these conditions are fullled, the reconstructed output
signal becomes mirror image of the input signal with some delay
associated with it, and can be represented as: y(n) = x(n k). This
kind of multirate system is known as perfect reconstructed (PR)
M-channel lter banks [4,9]. When these conditions are fullled
partially, then lter banks are called as nearly perfect reconstructed
(NPR) M-channel lter bank. It suffers from both aliasing and
amplitude distortions [4,810]. In design of M-channel lter banks,
modulation based lter banks are usually preferred due to ease
of implementation and low computational complexity [4,810]. In
modulation based lter bank, a prototype lter is designed to satisfy
the perfect reconstruction, and the rest of lters are generated by
modulating the response of prototype lter. For this, cosine modulation has become the preferred choice, and the designed lter
bank is known as cosine modulated lter bank (CMFB) [4,810].
If h(n) is the impulse response of a prototype lter [4,810],
H(z) =

N


h(n)z n

(4)

n=0

then impulse response of analysis and synthesis lters are given

as hl (n) and fl (n) respectively, both in PR and NPR-CM lter CMFB
[13,14,19].

 

hl (n) = 2h(n) cos l n

fl (n) = hl (N 1 n);

N1
2

+ l ,

(5)
(6)

with l = 0, 1, . . ., N and  l = ( 1)l /4

In nearly perfect reconstruction CM lter banks, phase distortion
can be eliminated by the help of linear-phase lters. Thus, the error
in amplitude response is given as [13,14]:

eam = max 1 |T0 (ej )| ,

(7)

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

H0 (z)
H1 (z)

x0(n)
x1(n)

u0(n)

v0(n)

F0 (z)

M
v1(n)

u1(n)

87

F1 (z)
y(n)

x(n)

HM-1(z)

xM-1(n)

vM-1(n)

Down sampler

uM-1(n)
M

FM-1(z)

Up-sampler
Synthesis filter banks

Analysis filter banks

Fig. 1. A schematic block diagram of M-channel lter banks [4,9]

and, the worst case aliasing distortion (ea ) is given as:

j

ea = max(Ts (e )) for [0, ], 1 s M 1;

(8)

and the total aliasing distortion is represented as:

et

alias

M1


1/2
j 2

|Ts (e )|

(9)

s=1

Various techniques such as frequency sampling method, window series design, and computer-based approaches exist for
designing of FIR lter [4,810]. Window series method is usually
preferred due to its relative simplicity and ease of use. In terms of
implementation, window technique is very simple and competent
technique for designing FIR lters. In this technique, window function is direct multiplied with ideal response of lter in time domain,
which converts innite impulse response of ideal lter into nite
impulse response
Hd () hd (n)

(10)

h(n) = hd (n) w(n) and H() = Hd () W ()

(11)

It is found that about 33% of SPT are reduced, when CSD encoding
scheme is used, but as a result, performance of the lter is degraded
due to this representation [2228]. Thus, an efcient technique is
required to optimize the CSD coefcients, and nullify this effect.
If x represents any fractional number, then in CSD space, it can
be represented as [2128]:
x=

L


Sk 2Pk ,

(12)

k=1

where Sk is {1, 0, 1} and Pk = 0, 1, . . ., L, M. Here, M represents

a word length, and L is the maximum number of non-zero digits
[2124]. Table 1 contains the three-digit CSD representation, which
shows basic conversion in CSD number system [2124].
As discussed above, performance of the lter is reduced in this
conversion as most of the information is lost in quantization and
CSD representation. Hence, an efcient optimization technique is
needed which can mitigate these effects. Detailed study on CSD
number system with look up tables can be found in [2129], and
references there in.

3. CSD encoding scheme

4. Overview of cuckoo search algorithm

In arithmetic computation, for improving speed, a concept of

signed digit number system was introduced in 1961 [2123]. When
a lter is implemented in hardware, the coefcients of respective
lter, also termed as continuous lter coefcients, are quantized
and are represented using signed power of two (SPT) terms. Quantization is needed to restrict the coefcients of lter into specied
number of bit or word length [19]. This process can be performed
with two methods: rounding and truncation [2022]. In rounding,
coefcients are rounded to its nearest value, while in truncation,
some of least signicant bits representing are truncated. Rounding is usually preferred over truncation as error introduced by the
rounding method is less in the realization of lter. These quantized
bits are represented into binary form; twos complement form,
hexadecimal and CSD form [2124]. The canonical signed digit
(CSD) number system is the signed digit number system and usually preferred as this number system contains minimum number of
SPT terms; and hence, the number of shifters and adders required
is also less [2024]. CSD number system is a ternary digit system,
where each digit can be either 1, 0, or +l [2224]. It has canonical
property that the adjacent bits in CSD digits are never non-zero;
in other words, +1 and 1 cannot be contiguous with each other
[2224]. This property implies that, for an n-bit number, at most
n/2 number of non-zero digits is there. As a result, less numbers
of nonzero digits present in CSD presentation, which reduces the
required number of adder and shifter in implementation of lter
[2124]. When compared with 2s complement method of representing coefcients into bits, probability of digit in bits, being zero
is approximately 1/3 for CSD, while 1/2 for 2s complement [2124].

Cuckoo search algorithm was initially proposed by Yang and

Deb [38]. This algorithm was inspired by cuckoo species based on
their unique breeding behavior. This approach is based on brood
parasite behavior of cuckoo species with Lvy ight behavior of
fruit ies and some other birds. This technique is also population
based random search method, which searches the global solution
in search space. Here, the search space is called as nest, which is
initialized at rst. The number of nest decides the possible solutions
for the problem [3941], and dimension is the length of individual
solution. Apart from these parameters, probability of searching (Pa )
is also dened. The Pa decides whether the elements in solution has
to be kept or modied, which is similar to cuckoo bird behavior of
realizing identity of egg in their nest. The termination of algorithm
is decided by xed maximum number of iterations or tolerance.
The nest/solution matrix is updated using Lvy ight mechanism,
which is formulated
at+1
= ati + L vy()
i

(13)

where ati is nest at tth iteration, is the step size, ( > 0) related to
the scaling of problem of interest. For large step, Lvy ight applies:
L vyu = t  ;

(1 <  3)

(14)

Then, tness function is evaluated for each solution, and solution corresponding to minimum tness value is sorted out known
as best solution [38,39]. Generate new solutions (i.e. host nest here)
by using Lvy ight, but keep the current best. Then, tness function
is evaluated for new set of solutions. Comparison is made between

88

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

Table 1
CSD representation of decimal equivalent [22,23].
Number
Canonical signed digit

3
101

2
010

1
001

old tness with latest one. If it is better than old one, then a probability of fraction (Pa ) of worse nests is abandoned, and a new nest
(solution) is generated. In this way, the best nest is kept. Above
process is repeated till stopping criterion is achieved having best
tness value corresponding to best nest [38,39].

(15)

Specify As and RF
calculate p and s

N=

2
010


,
2M

(As 7.95)
,
14.95f

(17)

= abs[MRI MRQ];

(19)

Initialize the parameter of CSA,

including N host nests (values of
c), iteration and Pa

Update nest using Eq. (13)

Values are
modified

YES

Export
optimized
values

If nest
value is out
of bound

NO
Calculate filter coefficient using
Kaiser Window technique for the
various c
Sorting of min() and
recorded in best solution
for ith iteration followed
by dissertation of worst
solution

(18)

and at 3 dB cutoff frequency

of a prototype lter (H0 (z)). This

condition is reduced to H0 (ej/2M ) = 0.707, which is the magnitude response (MRI) of prototype lter in ideal condition. In
the proposed method, multiplier-less prototype lter coefcients
are optimized such that their magnitude response (MRQ) of the
designed and quantized lter at = /2M is 0.7071; which is determined by nding optimum value of cut off frequency using cuckoo
search algorithm. In this method, cut off frequency constitutes the
population matrix known as nest in CS algorithm. Here, initially a
prototype lter is designed using adjustable window for a given
specications of stopband attenuation and channel over lapping,
then the derived lter coefcients are quantized. Their magnitude response (MRQ) at = /2M is computed and compared with
MRI. If this is comparable, then the rest of other lters of CMFB
are designed using this quantized prototype lter. Otherwise, by
employing cuckoo search algorithm, optimum cutoff frequency is
computed using an objective function constructed as:

NO

Termination
If (I == max no. of
Iteration)
Else
( < tolerance)

4
100

(16)

Initialization
of recursive
computation

YES

3
101


 

H0 (ej )2 + H0 (ej(/M) )2 = 1, for 0 < < 

In CMFB, only prototype lter is needed to design in efcient manner, and the rest of analysis/synthesis lters are derived
with cosine modulation using Eqs. (5) and (6). For this purpose,
adjustable window such Kaiser window is utilized to design a
prototype lter due to closed form expressions, and low computational complexity. The concept of roll off factor (RF) is employed
to achieve the prescribed channel overlapping that provides overlapping between different subbands. The value of RF is chosen in
the range of 1 < RF < 2 to get better performances. A detailed discussion on roll-off factor can be found in [9,14,15] and the references
there in.
For achieving desired design specications of lter bank such as
stopband attenuation (As ) and channel overlapping, some design
parameters for windowing technique such as stopband edge frequency (s ), cutoff frequency and order of lter are computed using
given specications (roll off factor and stopband attenuation) as
[9,14,15]
(1 + RF)
,
2M

p =

1
001

In Eq. (19), f = (s p )/2, As in M-channel CMFB bank

[411,14,15], perfect reconstruction (PR) can be achieved

5. Proposed methodology for design of CMFB with CSD

using adjustable window

s =

0
000

Evaluation of Fitness
function using Eq. (19)

Quantization and CSD conversion

of the filter coefficients

Fig. 2. Flow chart of proposed methodology using CS algorithm.

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

89

Table 2
Parameters of optimization algorithm.
Technique

Nest/population size

Discovery rate

Cognitive parameter, c1

Social parameter, c2

Limit

No of iteration

CSA
PSO
ABC

50
50
50

0.25

2.00

2.00

10

100
100
100

-5

10

-4

x 10

x 10

.5
4

Objective function ()

Objective function ()

.5
3
.5
2
.5
1

5
5

10

15

20

25

30

35

40

45

50

.5
10

20

30

Nest size

40
50
60
70
Number of iterations

80

90

100

Fig. 3. Selection of parameters for CS algorithm: (a) convergence of objective function with nest size and (b) convergence of objective function with iterations.

CSD coefcients for which the minimum value of objective function is obtained, that corresponding solution is recorded as best
solution. Afterward, the population is updated using Eq. (13), and
similar recursive operations are conducted. The proposed method
designs the multiplier-less cosine modulated lter bank that gives
less reconstruction error in single optimization using cuckoo search
algorithm. This procedure can be summarized into the following
steps and is described in Fig. 2.

Step 1: Specify the design specications such stop-band attenuation (As ), and roll-off factor (RF). Then, design parameters required
for windowing technique such as order of lter, s and p and window shape parameters using Eqs. (15)(17), and As respectively.
Step 2: Dene the design parameters of optimization algorithm:
number of host nest (NS), probability of fraction (Pa ), step size ()
and iterations.
Step 3: Set the parameters for optimization algorithm, initialize
nest (solution) as ai (t) and iteration. Here, nest corresponds to
different value of cut off frequency taking randomly in the range
of p and s as lower and upper limit respectively.
Step 4: Check whether generated cuckoos are in bound; if yes, then
employ Kaiser Window to calculate the coefcients of prototype
lter, convert it into quantized lter coefcients and represent into
CSD.
Step 5: Evaluate the tness function for each value of ai (t).
Step 6: Generate new solution as ai (t + 1) for cuckoo, by Lvy ight.
Calculate the tness value (ai (t + 1)) at ai (t + 1).
Step 7: Compare the tness value of new solution (ai (t + 1)) with
other possible solution corresponding to (ai (t)). If current value
is better than the previous one i.e. (ai (t + 1)) < (ai (t)), replace it
with existing solution (nests). If previous value is better than the
current one i.e. (ai (t + 1)) > (ai (t)), then abandon this solution
and built new solutions (nests) using Eq. (13).
Step 8: Check whether stopping criteria has been met or program
is reached at maximum number of iterations, If not go to Step 5 and
follow all the steps. If yes, then terminate the program, and select

a solution as best (ai (t + 1)), which corresponds to minimum value

of objective function, i.e. (ai (t + 1)). Find the optimized value of
quantized coefcient and represent it into CSD.
Similarly, ABC and PSO algorithms are exploited with the proposed scheme for designing cosine modulated lter bank.
6. Results and discussions
In this section, a MATLAB program has been written to implement the design procedure described in previous section. Several
design examples are included to demonstrate the efciency of proposed algorithm in CSD space.
Performance parameters are measured to compare and analyze
the effectiveness of proposed method such as: amplitude distortion, aliasing distortion given in Eqs. (8) and (9), respectively; while
computation time is measured as CPU time in seconds. The control
parameters used in evolutionary techniques such as PSO, ABC and
CSA are illustrated in Table 2.
In Table 2, selection of parameters has been made by taking
different value of iterations (gradual increment of 10 iterations)
for xed population size for minimization of objective function
as shown in Fig. 3. In similar way, experiment is carried out for
different population sizes (gradual increment of 5) while keeping
the iteration xed as illustrated in Fig. 4. Thus, the parameters are
selected based on the performance of algorithm; in this case, where
parameter is optimized in one dimension and lter coefcients are
calculated such that it fullls the desired tness function criterion.
6.1. Design examples
Example I: In this example, 8-channel CMFB has been designed
with N = 160, i.e. M is taken as 8, value of RF is 1.29 with
As = 80 dB similar to [9]. The passband and stopband edge frequencies computed using these design specications are 0.0625 and
0.143125, respectively. Optimized value of cutoff frequency is

90

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

50

Continuous Coefficient
Proposed CSA
CSD rounded
Proposed PSO
Proposed ABC

Magnitude in dB

-50

-100

-150

-200

0.1

0.2

0.3

0.4
0.5
0.6
Normalized Frequency

0.7

0.8

0.9

Fig. 4. Comparison of magnitude response of proposed prototype lter designed with continuous coefcients [9], CSD rounded coefcients, proposed CS algorithm, PSO and
ABC algorithm.

50

0
Magnitude in dB

Magnitude in dB

50

-50

-100

-150

0
-50
-100
-150

0.2
0.4
0.6
0.8
Frequency normalized by pi
(a)

0.2
0.4
0.6
0.8
Frequency normalized by pi
(b)

1.002
1.0015
Magnitude in dB

Magnitude in dB

1.0015
1.001
1.0005
1
0.9995
0.999

1.001
1.0005
1
0.9995

0.2
0.4
0.6
0.8
Frequency normalized by pi
(c)

0.01

0.02
0.03
0.04
Frequency normalized by pi
(d)

-4

Aliasing distortion:

1.5

x 10

0.5

0.2

0.4
0.6
Frequency normalized by pi

0.8

(e)
Fig. 5. Design results for CMFB with N = 160, RF = 1.29 and As = 80 dB using CS algorithm: (a) magnitude response of a prototype lter in CSD space, (b) magnitude responses
of analysis lters in CSD space, (c) plot of amplitude distortion, (d) zoom plot corresponds to respective amplitude distortion and (e) aliasing distortion.

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

91

1.1

Amplitude distortion

Algorithm in [15]
1.08

Proposed CSA

1.06

CSD Rounded
Proposed PSO
Proposed ABC

1.04
1.02
1
0.98
0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

Frequency normalized by pi

(a)
Amplitude distortion

Algorithm in [15]
1.08

Proposed CSA

1.06

CSD Rounded
Proposed PSO
Proposed ABC

1.04
1.02
1

0.02

0.04

0.06

0.08

0.1

0.12

0.14

0.16

Frequency normalized by pi

(b)
Fig. 6. Variations in amplitude distortion, (a) designed with continuous coefcients [9], CSD rounded coefcients, proposed CS algorithm, PSO and ABC algorithm and (b)
zoom plot corresponds to respective amplitude distortion.

0.0403125 with minimum value of objective function obtained

as 5.60391 105 . Fig. 4 compares the magnitude response of a
prototype lter designed with linear search algorithm given in [9]
with continuous coefcients, with CSD rounded coefcients, and
using proposed method with CS algorithm, PSO and ABC algorithm.
The performance parameters obtained are summarized in Table 3.
The simulation results obtained with the proposed method using
CS algorithm for FB is shown in Fig. 5.
In Fig. 6(a), variation in amplitude distortions of a prototype lter designed with linear search algorithm with continuous
coefcients given in [9], with CSD rounded coefcients, and using
proposed method with CS algorithm, PSO and ABC algorithm has
been illustrated; while in (b), zoom plot has been captured for analyzing the deviation.
Example II: In this example, 32-channel CMFB has been designed
with N = 512, i.e. M is taken as 32, value of RF is 1.61 with
As = 100 dB similar to [9]. The passband and stopband edge frequencies computed using these design specications are 0.0625
and 0.143125, respectively. Optimized value of cutoff frequency is
0.0403125 with minimum value of objective function obtained as
4.5041 105 . The simulation results for different design specications and the performance parameters obtained with the proposed

method using CS algorithm for CMFB are shown in Figs. 5 and 7 and
respective results are summarized in Table 4.
It is evident from Table 4 that the proposed CS algorithm used
for optimization in design of CMFB takes less time, approximately
22 s to converge (based on average of 10 simulations). The best
amplitude distortion obtained with this technique is 1.69 103
for N = 144 and M = 8 with As = 80. In this case, aliasing distortion is
4.118 105 . The average amplitude distortion, aliasing distortion
and computational time with the proposed method using cuckoo
search algorithm is 2.9 103 , 1.856 105 and 22.461 seconds
respectively.
In a similar fashion, PSO and ABC algorithm given in [12,3941]
have been employed with the proposed method, whereas for comparing the performance of different window functions: Kaiser,
Blackman, Cosh and Exponential are tabulated, while specications
are kept similar. The simulation results obtained are summarized
in Table 5. It can be observed that the CS algorithm using Kaiser
window with proposed method gives better performance in terms
of amplitude distortion and aliasing distortion. In term of computation time, CS algorithm requires less time in processing, while ABC
algorithm with proposed method yields worst performance among
them.

Table 3
Performance comparison of proposed algorithm with continuous coefcients, CSD rounded coefcients, proposed CS algorithm, PSO and ABC algorithm.
Parameters

Algorithm in [9]

CSD rounded

Proposed ABC

Proposed PSO

Proposed CSA

Stopband attenuation (dB)

Amplitude distortion
Reconstruction error
Aliasing distortion
CPU time (s)

80
2.1 103
1.667 103
5.8 103
0.5469

70.37
4.01 102
1.73 102
6.82 104
18.22

76.12
8.4 103
6.19 103
8.9 105
26.022

78.6
6.23 103
4.54 103
5.77 106
23.49

78.32
3.67 103
2.73 103
4.34 106
22.06

92

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

50

Magnitude in dB

Magnitude in dB

50

-50

-100

-150

-50

-100

-150
0

0.2
0.4
0.6
0.8
Frequency normalized by pi

0.2
0.4
0.6
0.8
Frequency normalized by pi

(a)

(b)

2.004

2.003
Magnitude in dB

Magnitude in dB

2.003
2.002
2.001

2.001
2

2
1.999

2.002

0.2
0.4
0.6
0.8
Frequency normalized by pi

1.999

0.01

0.02
0.03
0.04
0.05
Frequency normalized by pi

(c)

0.06

(d)

-7

Aliasing distortion:

x 10

0.2

0.4
0.6
Frequency normalized by pi

0.8

(e)
Fig. 7. Design results for CMFB with N = 448 RF = 1.83 and As = 100 dB using CS algorithm: (a) magnitude response of a prototype lter CSD space, (b) magnitude responses of
analysis lters in CSD space, (c) plot of amplitude distortion, (d) zoom plot corresponds to respective amplitude distortion and (e) aliasing distortion.

6.2. Comparison with other methodologies

The comparison of the proposed methodology with other
techniques suggested in [4,5,7,8,12,13] is shown in Table 6. For
comparing the performance, the developed method has been
exploited for designing multi-channel CMFBs with different value

of N, As and RF. It has been observed that the proposed methods

yield signicant improvement in performance of lter banks as
compared to earlier known techniques in terms of performance
parameters, i.e. amplitude and aliasing distortion represented as
eam and ea respectively, while computation time is depicted in
terms of CPU time. From Table 6, it can be observed that the

Table 4
Performance of proposed algorithm for varying order of lters with CSA.
Length

Bands

As (dB)

RF

AMD (eam )

ALD (ea )

CPU (s)

144
144
160
224
288
448
512
576

8
8
8
16
16
32
32
32

80
100
80
100
95
100
100
110

1.12
1.42
1.29
1.84
1.35
1.83
1.61
1.58

1.67 103
3.6 103
2.9 103
3.064 103
2.6 103
3.69 103
2.3 103
3.78 103

4.118 105
7.334 106
9.695 105
7.527 107
8.051 107
3.63 107
4.7 107
6.055 107

22.522
22.498
22.007
22.347
22.072
23.122
22.962
23.158

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

93

Table 5
Performance of the proposed algorithm with application of different windows.
Algorithm

As (dB)

Length

RF

Window

eam

ea

CPU (s)

Cuckoo

80
100

160
144
144

1.29
1.42
1.42
1.42

Kaiser
Kaiser
Blackman
Cosh
Exp

2.9 103
3.6 103
2.459 103
3.7 103
3.05 103

9.695 105
7.334 106
7.527 106
9.001 105
9.001 106

22.007
22.498
22.983
22.022
22.187

ABC

80
100

160
144
144

1.29
1.42
1.42
1.42

Kaiser
Kaiser
Blackman
Cosh
Exp

4.7 103
4.2 103
3.4 103
4.54 103
4.31 103

5.9 106
3.936 105
1.36 106
9.4 106
9.4 106

26.022
27.701
26.912
26.664
27.04

PSO

80
100

160
144
144

1.29
1.42
1.42
1.42

Kaiser
Kaiser
Blackman
Cosh
Exp

2.890 103
3.022 103
4.820 103
3.372 103
3.4 103

5.876 106
6.197 107
4.415 106
9.144 106
7.14 106

24.496
24.272
25.620
24.584
25.664

Table 6
Performance comparison of the proposed algorithm with other algorithms (continuous coefcients).
Type of algorithm

Taps (N + 1)

AMD (eam )
3

ALD (ea )

Algorithm in [13]
Algorithm in [4]
Algorithm in [5]
Algorithm in [7]
Algorithm in [8]
Algorithm in [12]

440
440
440
440
512
512

3.41 10
5.30 103
3.44 103
2.81 103
2.1 103
1.14 103

2.60 107
2.57 106
2.61 107
2.64 107
4.00 108
2.29 106

Proposed (ABC)
Proposed (PSO)
Proposed (CSA)

512
512
576

4.3 103
3.83 103
3.69 103

4.17 106
4.05 107
3.63 107

Table 7
Performance comparison of proposed algorithm with other algorithms (quantized coefcient).

Algorithm [34]
Proposed (CSA)
Proposed (ABC)
Proposed (PSO)

As (dB)

AMD (eam )

Reconstruction error (RE)

ALD (ea )

CPU time (s)

62
78.32
76.12
78.6

0.0084
3.67 103
8.4 103
6.23 103

2.73 103
6.19 103
4.54 103

1.18 105
4.34 106
8.9 105
5.77 106

197.22
22.06
26.022
24.49

proposed CSA scheme provides best result among previously

reported techniques as well as proposed method using PSO and ABC
method respectively having amplitude distortion as 3.69 103
while aliasing distortion as 3.63 107 for 576 taps.
In Table 7, results are summarized and compared with existing
techniques given in [34]. Here, multiplier-less CMFB is designed
based on FRM techniques, and two optimization techniques were
used with complex objective function which consumes large run
time. While in the proposed method, single optimization is performed that results in less computation time with signicant
improvement in amplitude distortion and aliasing distortion. For
this purpose, different evolutionary techniques such PSO, ABC
and CSA have been examined, and impact of each approaches is
compared in terms of amplitude distortion, reconstruction error,
aliasing distortion and run time respectively. It can be observed
from Table 7 that the proposed algorithm using CSA scheme yields
better value of amplitude distortion of 3.67 103 and improved
aliasing distortion as 4.34 106 .
The proposed swarm algorithms possess drastic reduction in
computation time as compared to other existing techniques. Thus,
the proposed adjustable window based design of multiplier-less
CMFB using swarm optimization algorithms such as CSA, PSO and
ABC can be further utilized in various applications such as: in design
of trans-multiplexers for communication system, in design of nonuniform CMFB for variable bandwidth.

7. Conclusion
In this paper, an adjustable window based design of multiplierless cosine modulated lter bank with swarm based algorithm has
been proposed. The coefcients are quantized and optimized using
different swarms based algorithms. Cuckoo search algorithm has
provided the better optimized values for quantized coefcients of
M-channel cosine modulated lter bank. Several window functions
have been examined for designing prototype lter using proposed
scheme, among which prototype lter using Kaiser Window has
been illustrated to show the signicance of proposed method. Performance of the optimal quantized coefcient M-channel cosine
modulated lter bank for different optimization algorithms are
compared respectively. Cuckoo search algorithm (CSA) algorithm
is observed to have improved performance in the multiplier-less
cosine modulated lter bank.

References
[1] Sohn SW, Lim YB, Yun JJ, Choi H, Bae HD. A lter bank and a self-tuning adaptive
lter for the harmonic and inter harmonic estimation in power signals. IEEE
Trans Instrum Meas 2012;61(1):6473.
[2] Blanco-Velasco M, Cruz-Roldn F, Moreno-Martnez E, Godino JI, Barner KE.
Embedded lter bank-based algorithm for ECG compression. Signal Process
2008;88(6):140212.

94

I. Sharma et al. / Int. J. Electron. Commun. (AE) 70 (2016) 8594

[3] Yang P, Yunhui S, Wenpeng D, Xiaoyan S, Baocai Y. Learning adaptive lter

banks for hierarchical image representation. In: Visual communications and
image processing conference, IEEE. 2014. p. 3669.
[4] Vaidyanathan PP. Multirate and lter banks. Englewood Cliffs, NJ: PrenticeHall; 1993.
[5] Creusere CD, Mitra SK. A simple method for designing high quality prototype lters for M-band pseudo QMF banks. IEEE Trans Signal Process 1995;43:
10057.
[6] Cruz-Roldan F, Lopez PA, Bascon SM, Lawson SS. An efcient and simple method
for designing prototype lters for cosine modulated pseudo QMF banks. IEEE
Signal Process Lett 2002;9(1):2931.
[7] Cruz-Roldan F, Martin-Martin P, Saez-Landete J, Blanco-Velasco M, Saramaki
T. A fast windowing based technique exploiting spline function for designing cosine modulated lter banks. IEEE Trans Circuits Syst-I 2009;56(1):
16878.
[8] Datar A, Jain A, Sharma PC. Design and performance analysis of adjustable
window functions based cosine modulated lter banks. Digit Signal Process
2013;23(1):4127.
[9] Kumar A, Singh GK, Kuldeep B. An improved and simplied approach for
designing cosine modulated lter bank using window technique. J Math Model
Algorithm 2010;10(3):21326.
[10] Kumar A, Anurag S, Singh GK. Design of nearly perfect reconstructed nonuniform lter bank by constrained equiripple FIR technique. Appl Soft Comput
2013;13(1):35360.
[11] Kalathil S, Elias E. Prototype lter design approaches for near perfect reconstruction cosine modulated lter banks a review. J Signal Process Syst
2014:113, http://dx.doi.org/10.1007/s11265-014-0929-5.
[12] Tan F, Zhang T, Gao C, Huang L. Optimal design of cosine modulated lter banks
using quantum-behaved particle swarm optimization algorithm. Image Signal
Process (CISP) 2011;5(4):22804.
[13] Zhang T, Tan F, Yi C, Zhang G, Gao C. An optimized design of non-uniform lter
banks based on memetic algorithm; 2013. p. 11949.
[14] Kumar A, Singh GK, Anand RS. An improved closed form design method for the
cosine modulated lter banks using windowing technique. Appl Soft Comput
2011;11(3):320917.
[15] Kumar A, Rani P, Singh GK. Design and performance of closed form method for
cosine modulated lter bank using different windows functions. Int J Speech
Technol 2014;17(4):42741.
[16] Painter T, Spanias A. Perceptual coding of digital audio. Proc IEEE 2000;
88(4):451513.
[17] Kalathil S, Elias E. Efcient design of non-uniform cosine modulated lter banks
for digital hearing aids. AEU Int J Electron Commun 2015;69(9):131420.
[18] Wei Y, Wang Y. Design of low complexity adjustable lter bank for personalized hearing aid solutions. IEEE/ACM Trans Audio Speech Lang Process
2015;23(5):92331.
[19] Mitola J. Software radio architecture. New York: Wiley; 2000.
[20] Bindiyan TS, Elias E. Modied metaheuristic algorithms for the optimal
design of multiplier-less non-uniform channel lters. Circ Syst Signal Process
2014;33(3):81537.
[21] Lim Y, Yang R, Li D, Song J. Signed power-of-two term allocation scheme for the
design of digital lters. Syst II Analog Digit 1999;46:57784.
[22] Hartley RT. Subexpression sharing in lters using canonic signed digit multipliers. IEEE Trans Circ Syst II Analog Digit Signal Process 1996;43:67788,
http://dx.doi.org/10.1109/82.539000.

[23] Hewlitt RM, Swartzlander ES. Canonical signed digit representation for r
digital lters. In: IEEE workshop on signal processing systems, SiPS. 2000. p.
41626.
[24] Uppalapati H, Rastgar H, Ahmadi M, Sid-Ahmed MA. Design of quadrature mirror lter banks with canonical signed digit coefcients using genetic algorithm.
In: International conference on communications, circuits and systems, vol. 2.
2005. p. 6826.
[25] Aktan M, Yurdakul A, Dndar G. An algorithm for the design of lowpower hardware-efcient FIR lters. IEEE Trans Circ Syst I Regul Pap
2008;55:153645, http://dx.doi.org/10.1109/TCSI.2008.97.
[26] Fuller A, Nowrouzian B, Ashrafzadeh F. Optimization of FIR digital lters
over the canonical signed-digit coefcient space using genetic algorithms. In:
Proceedings of midwest symposium on circuits and systems. 1998. p. 45669.
[27] Park SY, Cho NI. Design of multiplierless lattice QMF: structure and algorithm development. IEEE Trans Circ Syst II Express Briefs 2008;55:1737,
http://dx.doi.org/10.1109/TCSII.2007.910969.
[28] Yu YJ, Lim YC. A novel genetic algorithm for the design of a signed power-of two
coefcient quadrature mirror lter lattice lter bank. Circ Syst Signal Process
2002;21(3):26376.
[29] Samadi P, Ahmad M. Performance analysis of genetic algorithm for the design
of linear phase digital lter banks with CSD coefcients. In: Third international
conference on natural computation (ICNC), vol. 3. 2007. p. 1504.
[30] Manoj VJ, Elias E. Design of multiplier-less non-uniform lter bank trans multiplexer using genetic algorithm. J Signal Process 2009;89:227485.
[31] Manuel M, Elias E. Design of frequency response masking FIR lter in the
canonic signed digit space using modied articial bee colony algorithm. Eng
Appl Artif Intell 2013;26(1):6608.
[32] Bindiya TS, Elias E. Modied metaheuristic algorithms for the optimal
design of multiplier-less non-uniform channel lters. Circ Syst Signal Process
2013;33(3):81537.
[33] Kalathil S, Elias E. Non uniform cosine modulated lter banks using
meta-heuristic algorithms in CSD space. J Adv Res 2014, http://dx.doi.org/
10.1016/j.jare.2014.06.008.
[34] Kalathil S, Elias E. Design of multiplier-less cosine modulated lter banks with
sharp transition using evolutionary algorithms, vol. 68; 2013. p. 19.
[35] Elias E. Design of multiplier-less sharp transition width non-uniform lter
banks using gravitational search algorithm. Int J Electron 2015;102(1):4870.
[36] Misra D, Dhabal S, Venkateswaran P. Quadrature mirror lter bank with canonical signed digit representation using linear optimization algorithm. In: Third
international conference on computer communication control and information
technology (C3IT). 2015. p. 16.
[37] Reddy KS, Sahoo SK. An approach for FIR lters coefcient optimization using
differential evolution algorithm. Int J Electron Commun 2015;69:1018.
[38] Yang XS, Deb S. Multiobjective cuckoo search for design optimization. Comput
Oper Res 2013;40:161624, http://dx.doi.org/10.1016/j.cor.2011.09.026.
[39] Civicioglu P, Besdok E. A conceptual comparison of the cuckoo-search, particle
swarm optimization, differential evolution and articial bee colony algorithms.
Artif Intell Rev 2013;39(4):31546.
[40] Chiaradonna S, Giandomenico FD, Murru N. On enhancing efciency and accuracy of particle swarm optimization algorithms. Int J Innov Comput Inf Control
2015;11(4):116589.
[41] Ratanavilisagul C, Kruatrachue B. A modied particle swarms optimization with
mutation and reposition. Int J Innov Comput Inf Control 2014;10(6):212742.