Hybrid Genetic Algorithm for the Design of Modified Frequency-Response Masking Filters in a Discrete Space

Abstract

This paper presents the design of high-speed, arbitrary bandwidth sharp finite impulse response filters with signed powers-of-two coefficients based on a modified frequency-response masking (FRM) structure. A novel hybrid genetic algorithm (HGA) is proposed to jointly optimize all subfilters in a discrete space. The proposed HGA introduces the simulated annealing technique into the genetic algorithm (GA) optimization process and effectively prevents the GA from prematurely converging. It is shown, by means of examples, that FRM filters designed by the HGA achieve a significant reduction in the number of bits.

Design Equations for Jointly Optimized Frequency-Response Masking Filters

“…where k 3 and c 3 are constants yet to be found. Equations (8), (9), and (10) confirm that (7) is valid.…”

“…The frequency-response masking (FRM) approach is one of the most computationally efficient techniques for the design of linear-phase arbitrary bandwidth sharp FIR digital filters [1], [3]- [10], [12]- [29], [31]- [38]. A basic FRM filter contains four subfilters, i.e., a pair of complementary bandedge shaping filters H a (z) and H c (z) and two masking filters H Ma (z) and H Mc [20], [21].…”

Particle Swarm Optimization of Highly Selective Digital Filters over the Finite-Precision Multiplier Coefficient Space

“…Simulated annealing (SA) and genetic algorithms (GAs) were widely used in the design and optimization of digital filters [10][11][12]. Particle swarm optimization (PSO) and seeker optimization algorithm (SOA) are two newly developed algorithms suitable for the optimization of various digital filters due to their few number of implementation parameters and high speed of convergence [13,14].…”

Design of frequency-response-masking FIR filters using SOCP with coefficient sensitivity constraint

“…references [2]- [21] for the subsequent development in analysis and design of various types of FRM filters. The finite word-length (FWL) performance of FRM filters, which seems to have been overlooked in the past, has been examined recently in [22], [23].…”