A parallel tabu search algorithm for digital filter design

Adem Kalinli (Department of Electronics, Vocational High School, Erciyes University, Kayseri, Turkey)
Nurhan Karaboga (Department of Electronic Engineering, Faculty of Engineering, Erciyes University, Kayseri, Turkey)



The purpose of the paper is to present a novel design method for the optimal finite word length (FWL) finite impulse response (FIR) filters.


The design method is based on a parallel tabu search (TS) algorithm which uses the crossover operator of the genetic algorithm.


Three design examples have been presented to show that the proposed method can provide a good solution to the design problem of a FWL FIR filter. In order to show the validity of the proposed method, the performance of the suggested method has been compared to those of widely‐used other methods. From the comparison results, it was concluded that the proposed method can be efficiently used for the optimal FWL FIR filter design.

Research limitations/implications

The number of examples can be increased and also the performance of the proposed method might be compared to other design methods, apart from those presented in this work, developed for the design of optimal FWL FIR filters.

Practical implications

The use of this method produces optimal digital FWL FIR filters with low complexity and therefore provides advantages in the terms of speed and cost.


The originality is the application of the parallel TS algorithm described by the authors to the FWL FIR filter design. The work presented in the paper is particularly important for the researchers studying on the design methods for FWL FIR filter design and the applications of these type filters.



Kalinli, A. and Karaboga, N. (2005), "A parallel tabu search algorithm for digital filter design", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 24 No. 4, pp. 1284-1298. https://doi.org/10.1108/03321640510615616

Download as .RIS



Emerald Group Publishing Limited

Copyright © 2005, Emerald Group Publishing Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.