Search results

1 – 1 of 1
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 1 December 2005

Adem Kalinli and Nurhan Karaboga

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

447

Abstract

Purpose

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

Design/methodology/approach

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

Findings

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.

Originality/value

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.

Details

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, vol. 24 no. 4
Type: Research Article
ISSN: 0332-1649

Keywords

1 – 1 of 1
Per page
102050