scispace - formally typeset
Journal ArticleDOI

Single-Stage and Cascade Design of High Order Multiplierless Linear Phase FIR Filters Using Genetic Algorithm

Wenbin Ye, +1 more
- 20 Sep 2013 - 
- Vol. 60, Iss: 11, pp 2987-2997
Reads0
Chats0
TLDR
In this work, a novel genetic algorithm (GA) is proposed for the design of multiplierless linear phase finite impulse response (FIR) filters, and significantly outperforms existing algorithms dealing with the similar problems in terms of design time and hardware cost.
Abstract
In this work, a novel genetic algorithm (GA) is proposed for the design of multiplierless linear phase finite impulse response (FIR) filters. The filters under consideration are of high order and wide coefficient wordlength. Both the single-stage and cascade form are considered. In a practical filter design problem, when the filter specification is stringent, requiring high filter order and wide coefficient wordlength, GAs often fail to find feasible solutions, because the discrete search space thus constructed is huge and the majority of the solution candidates therein can not meet the specification. In the proposed GA, the discrete search space is partitioned into smaller ones. Each small space is constructed surrounding a base discrete coefficient set which is obtained by a proposed greedy algorithm. The partition of the search space increases the chances for the GA to find feasible solutions, but does not sacrifice the coverage of the search. The proposed GA applies to the design of single-stage filters. When a cascade form filter is designed, for each single-stage filter meeting the filter specification generated during the course of GA, an integer polynomial factorization is applied. Design examples show that the proposed GA significantly outperforms existing algorithms dealing with the similar problems in terms of design time, and the hardware cost is saved in most cases.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Design of hardware efficient FIR filter: A review of the state-of-the-art approaches

TL;DR: This paper presents a detailed review of the basic design approaches applicable for the synthesis of hardware efficient finite duration impulse response (FIR) filter and the traditional and heuristic search algorithms have been incorporated and properly arranged.
Journal ArticleDOI

Generalized Dissipativity Analysis of Digital Filters With Finite-Wordlength Arithmetic

TL;DR: A new sufficient condition is proposed to guarantee the generalized dissipativity of single digital filters with finite-wordlength arithmetic and criteria for H∞ performance, l2 - l∞performance, passivity, and (Q, S, R)-α-dissipativity in a unified framework are presented.
Journal ArticleDOI

Optimal Factoring of FIR Filters

TL;DR: An algorithm to find, scale and sequence optimally factored FIR filters that can be created by using a scaled sequence of stages, each representing a factor of the filter's transfer function.
Journal ArticleDOI

Closed-Form FIR Filter Design Based on Convolution Window Spectrum Interpolation

TL;DR: A closed-form linear phase FIR filter design concurrently possessing high efficiency and excellent transfer characteristic, derived from conventional frequency sampling method through replacing its frequency-domain interpolation function with the Fourier spectrum of a convolution window.
Journal ArticleDOI

Two-Step Optimization Approach for the Design of Multiplierless Linear-Phase FIR Filters

TL;DR: A two-step tree search algorithm that maximally utilizes the limited computational resources and can achieve lower hardware cost design in a shorter design time, compared with existing algorithms is proposed.
References
More filters
Book

Adaptation in natural and artificial systems

TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Journal ArticleDOI

Use of minimum-adder multiplier blocks in FIR digital filters

TL;DR: Three new algorithms for the design of multiplier blocks are described: an efficient modification to an existing algorithm, a new algorithm giving better results, and a hybrid of these two which trades off performance against computation time.
Journal ArticleDOI

Subexpression sharing in filters using canonic signed digit multipliers

TL;DR: This paper examines methods for optimizing the design of CSD multipliers, and in particular the gains that can be made by sharing subexpressions, and it is shown that sharing the two most common sub expressions can be expected to lead to a 33% saving of the number of additions.
Journal ArticleDOI

Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

TL;DR: The problem formulation for solving the multiple constant multiplication (MCM) problem is introduced where first the minimum number of shifts that are needed is computed, and then the number of additions is minimized using common subexpression elimination.
Journal ArticleDOI

Primitive operator digital filters

TL;DR: Vertex rearrangement, retiming and edge elimination techniques are presented which facilitate the generation of a logical graph with an efficient allocation of pipeline registers.
Related Papers (5)