Ant Colony Optimization for Design of FIR Filters

with Signed-power-of-two Coefficients

Youzhi Zhang

Jiahong Sun

Department of Information
Shandong Kaiwen College of Science & Technology
Jinan, China
youzhizh@sdu.edu.cn

Shandong Province Inspection & Test Bureau of

Electronic Products
Jinan, China

AbstractA heuristic approach based on ant colony optimization

is proposed for the design of multiplierless finite impulse
response (FIR) filters with signed-power-of-two (SPT)
coefficients. The objective is to minimize non-zero SPT terms to
reduce the number of adders that are needed for filtering with
constant SPT coefficients, while meeting the required
specifications of the filter. Each SPT coefficient is placed on
several virtual paths whose length is determined by non-zero SPT
terms. Each ant searches for the shortest path according to the
residual pheromone that is dynamically calculated by measuring
the distance between current path and previous optimal path.
Simulation results show that suboptimal solutions can be
obtained within reasonable computational time.
Keywords- ant colony optimization; FIR; SPT

I.

finite impulse
response, FIR
FIR

8 8

signed-power-of-two, SPT
/[18]
SPT 101
(0.15)10 8 SPT
(0.00101010)2 = 23+2527 = (0.1484375)10
x(n)
0.15
0.15 x(n)23 x(n)+25 x(n)27 x(n) = (x(n)>>3) + (x(n)>>5)
(x(n)>>7) x(n)>>k x(n) k
2k

SPT

(0.15)10 (0.00101000)2=23+25 =(0.15625)10

/
SPT
SPT

[13]
[46][7][8][9] 20
90
ant colony
optimizationACO FIR
SPT

II.

FIR
N

y (n ) =

h x(n i + 1),

x(n) y(n)N
hi i = 1, , N
1 L
D N
N1 N

x(n)

h1

h2

x(n1)

...

hN 1

hN

+
y(n)

1 FIR

978-1-4244-9439-2/11/$26.00 2011 IEEE

3909

(1)

i =1

x(nN+1)

 1
1 N SPT

hi =

sij 2 j , sij {1, 0, 1}, i = 1, 2, ", N ,

H(ej)

hk (k = 1, 2, , N)

H (e j ) =

(2)

h e
k

jk

(6)

k =1

j =1

sij i j SPT
L 8~16 L

h = ( h1 , h 2 , ", h N )

s12
s22
#
sN 2

( , | H ( e j ) |) , [0, p ] [s , ] .

" s1L
" s2 L

% #

" s NL N L

min

(3)

ij

|.

(5)

i =1 j =1

2 0~p
f1 s~
2 p s

1 2 N
1 2
2

|H(ej)|
1+1
11

sij {1, 0, 1}, 1 i N , 1 j L .

(4)

| s

ij

| H ( e j ) | 2 , s ,

S 10+1
S
sij

min

| s

|| H (e j ) | 1 | 1 , 0 p ,

h = Sp .

sij {1,0,1}

i =1 j =1

(7)

FIR

p = ( 2 1 , 2 2 , "2 LT ,
s11
s
S = 21
#

sN1

|H(ej)|

(8)

H(ej)46
fast Fourier transformFFT H(ej)

FIR
NL/2 N
(N+1)L/2 N

III.

FIR SPT

[9]
pheromone

A.

2
0

FIR SPT

SPT S
101 3

i qi,L qi,0 L+1

3910

 3 i 3
101 qi,j
qi,j1 si j
SPT
101
SPT
h i FFT

d i ,L +1 = 0,

L j
*
d i , j (l ) = d i , j +1 + (l sij ) 2 ,
l {1, 0, 1}, i = 1, " , N , j = L, " , 1,

(9)

sij* d i , j (l ) l
d i , j +1

i (0.0100-1)2
L = 5
101

d i ,6 = 0,
d i ,5 = d i ,6 + (1 ( 1)) 2 0 = 2,
d i ,4 = d i ,5 + (0 0) 21 = 2,
d i ,3 = d i ,4 + ( 1 0) 2 2 = 2,
d i ,2 ( 1) = d i ,3 + ( 1 1) 2 3 = 18,
d i ,2 (0) = d i ,3 + (0 1) 2 3 = 10,

d i ,2 (1) = d i ,3 + (1 1) 2 3 = 2.

B.

L = 8
SPT (0.01111111)2

SPT (0.10000000)2
L
28

SPT (0.01111111)2
(0.1xxxxxxx)2 x

3911

(0.010-1)2 (0.0011)2

i qi,j qi,j1

ij (l ) =

1
, , > 0, l {1, 0, 1}.
1 + | d ij (l ) |

(10)

0
1

= 1 = 2

i j l

pij (l ) =

ij (l )
, l = 1, 0, 1 .
ij ( 1) + ij (0) + ij (1)

(11)

Matlab

SPT

IV.

20

h 0 = h 27 = 2 ,
h 2 = h 25 = 2

h1 = h 26 = 0,
9

h 4 = h 23 = 2 7 + 2 11,
h 6 = h 21 = 0,

h 5 = h 22 = 2 6 2 10 ,
h 9 = h18 = 2 5 2 9 2 12 ,

h10 = h17 = 2 4 2 6 + 2 11 ,

[4]

h13 = h14 = 2 2 + 2 3 2 11
4
[5] [6] SPT
56
68[1]66[4]62[6]58[5]

[5]

[6]

[7]

FIR
SPT
/

3912

0.2

0.4
0.6
Frequency ( rad)

0.8

REFERENCES

[3]

h11 = h16 = 0,

h12 = h15 = 2 2 2 4 + 2 7 + 2 9 + 2 11 ,

V.

60

4 SPT

[2]

h 7 = h 20 = 2 5 2 11 ,

h8 = h19 = 2 5 2 8 2 9 ,

40

100

[1]

h 3 = h 24 = 2 8 + 2 9 ,

+2 ,

20

80

FIR
0.3 0.5
50dB 12 bits 28
14 Matlab
SPT 80 Pentium
III 1.2 GHz PC 2.7

Prototype
Chens [5]
Xus [6]
Proposed

Magnitude (dB)

C.

[8]

[9]

Y. C. Lim and S. R. Parker, FIR filter design over a discrete powers-oftwo coefficient space, IEEE Trans. Acoust., Speech, Signal Process.,
vol. ASSP-31, no. 3, pp. 583591, Jun. 1983.
O. Gustafsson, H. Johansson, and L.Wanhammar, An MILP approach
for the design of linear-phase FIR filters with minimum number of
signed-power-of-two terms, in Proc. Eur. Conf. Circuit Theory Design,
Espoo, Finland, vol. 2, pp. 217220, Aug. 2001.
M. Aktan, A. Yurdakul, and G. Dundar, An algorithm for the design of
low-power hardware-efficient FIR filters, IEEE Trans. Circuits Syst. I,
vol. 55, no. 6, pp. 15361545, Jul. 2008.
H. Samueli, An improved search algorithm for the design of
multiplierless FIR filters with powers-of-two coefficients, IEEE Trans.
Circuits Syst., vol. 36, no. 7, pp. 10441047, Jul. 1989.
C. L. Chen and A. N. Willson Jr., A trellis search algorithm for the
design of FIR filters with signed-powers-of-two coefficients, IEEE
Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 46, no. 1, pp.
2939, Jan. 1999.
F. Xu, C. H. Chang, and C. C. Jong, Design of Low-Complexity FIR
Filters Based on Signed-Powers-of-Two Coefficients With Reusable
Common Subexpressions, IEEE Trans. Computer-Aided Design of
Integrated Circuits and Syst., vol. 26, no. 10, pp. 18981907, Oct. 2007.
N. Benvenuto, M. Marchesi, and A. Uncini, Applications of simulated
annealing for the design of special digital filters, IEEE Trans. Signal
Process., vol. 40, no.2, pp. 323332, Feb. 1992.
R. Cemes, D. Ait-Boudaoud, Genetic approach to design of
multiplierless FIR filters, Electron. Letter., vol. 29, no. 24, pp. 2090
2091, Nov. 1993.
M. Dorigo, Optimization, learning and natural algorithms, Ph.D.
dissertation, Dept. Electron., Politecnico di, Milano, Italy, 1992.