Design of discrete coefficient FIR filters by a fast entropy-directed deterministic annealing algorithm

Document type:	Journal Articles
Article type:	Original article
Peer reviewed:	Yes
Author(s):	Per Persson, Sven Nordebo, Ingvar Claesson
Title:	Design of discrete coefficient FIR filters by a fast entropy-directed deterministic annealing algorithm
Journal:	IEEE Transactions on Signal Processing
Year:	2005
Volume:	52
Issue:	3
Pagination:	1006-1014
ISSN:	1053-587X
Publisher:	IEEE
URI/DOI:	10.1109/TSP.2004.8422178
ISI number:	000227056400013
Organization:	Blekinge Institute of Technology
Department:	Department of Telecommunications and Signal Processing (Institutionen för telekommunikation och signalbehandling) Department of Telecommunications and Signal Processing S-372 25 Ronneby +46 455 38 50 00
Language:	English
Abstract:	In this paper, we present an entropy-directed deterministic annealing optimization algorithm and show its applicability to the problem of designing digital filters with discrete coefficients, each implemented as a sum of signed power-of-two terms and additional general hardware constraints. The algorithm is based on analogies from statistical mechanics and is related to the well-known mean field annealing algorithm. It utilizes estimates of conditional entropy to prune the problem during the optimization, thereby reducing the computational time by 30 to 50%. In conjunction with a scheme to compute the value of the objective function as a sequence of updates, this approach leads to a very fast algorithm. As an application example demonstrating the potential of the new method, we consider the design of digital filters with discrete coefficients consisting of a minimum number of signed power-of-two terms. © 2005 IEEE.
Subject:	Signal Processing\Filter Design
Keywords:	Hardware constraints, annealing, entropy, FIR

Sherpa Tutorial

Self Archive at BTH video

Faculty Board "ISI-Fund" video