Multiplier-less FIR filter design using a genetic algorithm

A new synthesis technique is described for multiplier-less FIR digital filters consisting of a cascade of primitive linear phase sections. For medium-order filters the search space for an optimal cascade is typically of the order of 10³⁰ and this can be examined in a computation efficient way using the parallel-search capability of a genetic algorithm (GA). A particular form of GA based upon multilevel or structured chromosomes has been developed for the primitive cascade problem. Initial results suggest that, for the cost of increased filter delay, a typical 2:1 advantage can be achieved in both VLSI chip area and clock rate compared to filters designed using the usual equiripple method