An efficient local search method guided by gradient information for discrete coefficient FIR filter design

Authors:
Tolga Çiloglu
Affiliations:
Department of Electrical and Electronics Engineering, Middle East Technical University, 06531 Ankara, Turkey
Venue:
Signal Processing
Year:
2002

Citing 4
Cited 2

Discrete-time signal processing

Discrete-time signal processing
Digital Signal Processing: A Computer Based Approach

Digital Signal Processing: A Computer Based Approach
Efficient genetic algorithm design for power-of-two FIR filters

ICASSP '95 Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02
Optimal design of finite precision FIR filters using linearprogramming with reduced constraints

IEEE Transactions on Signal Processing

Optimal linear phase FIR filter design using particle swarm optimization with constriction factor and inertia weight approach with wavelet mutation

International Journal of Hybrid Intelligent Systems
Improved Particle Swarm Optimization with wavelet mutation: Application to linear phase FIR filter design

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.08

Visualization

Abstract

A new local search method for the design of linear phase FIR filters with discrete valued coefficients is introduced in this paper. Conventional minimax criterion and normalized peak ripple magnitude (NPRM) are taken as objective functions. The principle is to search along low gradient routes with priority and to direct the search toward steeper sides as improved solutions cease to appear. The characteristics of the objective functions have been explained and used to devise the method. The method is novel in the way it generates the gradient information and makes use of it. At each step, a number of filter coefficients are picked according to the gradient information and perturbed to look for improved solutions. A specific neighborhood definition is proposed and used in perturbing the coefficients. The method has very low computational demand and is suitable for the design of long filters. The results of design examples demonstrate that the performance of the method can compete with those of optimal methods. Along the way, a closed form expression for the "filter gain" that minimizes NPRM is also given. Furthermore, it is shown that a previously proposed local search method unintentionally implements the ideas of this paper in an opposite order.