Paper Info
Title
A Greedy Common Subexpression Elimination Algorithm for Implementing FIR Filters
Abstract
The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexpression Elimination (CSE) algorithm with a look-ahead method based on the Canonic Signed Digit (CSD) representation of filter coefficients for implementing low complexity FIR filters is proposed in this paper. Our look- ahead algorithm chooses the maximum number of frequently occurring common subexpressions and hence reduces the number of adders required to implement the filter. This adder reduction is achieved without any increase in critical path length. Design examples of FIR filters show that the proposed method offers an average adder reduction of about 20% over the best known CSE method.
Year
DOI
Venue
2007
10.1109/ISCAS.2007.378369
ISCAS
Keywords
Field
DocType
FIR filters,greedy algorithms,optimisation,FIR filters,canonic signed digit representation,coefficient multipliers,filter coefficients,finite impulse response filters,greedy common subexpression elimination algorithm,look-ahead method
Common subexpression elimination,Digital filter,Adder,Computer science,Arithmetic,Algorithm,Greedy algorithm,Electronic engineering,Critical path method,Finite impulse response,Filter design
Conference
ISSN
Citations 
PageRank 
0271-4302
2
0.49
References 
Authors
4
3
Name
Order
Citations
PageRank
S. Vijay130.87
A. Prasad Vinod232850.06
Edmund Ming-Kit Lai312058.89