A New Algorithm for the Elimination of Common Subexpressions in Hardware Implementation of Digital Filters by Using Genetic Programming

H. Safiri; M. Ahmadi; G. A. Jullien; W. C. Miller

doi:10.1109/ASAP.2000.862402

Previous
Next
Table of Contents

Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors

A New Algorithm for the Elimination of Common Subexpressions in Hardware Implementation of Digital Filters by Using Genetic Programming

Year: 2000, Pages: 319

DOI Bookmark: 10.1109/ASAP.2000.862402

Authors

H. Safiri, University of Windsor
M. Ahmadi, University of Windsor
G. A. Jullien, University of Windsor
W. C. Miller, University of Windsor

Abstract

A new algorithm based on Genetic Programming (GP) for the problem of optimization of Multiple Constant Multiplication (MCM) by Common Subexpression Elimination (CSE) is developed. This method is used for hardware optimization for DSP systems. A solution based on Genetic Programming is shown in this paper. The performance of the technique is demonstrated in one- and multi-dimensional digital filters with constant coefficients.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!