Sciweavers

Share
ISCAS
2007
IEEE

A Greedy Common Subexpression Elimination Algorithm for Implementing FIR Filters

9 years 5 months ago
A Greedy Common Subexpression Elimination Algorithm for Implementing FIR Filters
— 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 lookahead 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.
S. Vijay, A. Prasad Vinod, Edmund Ming-Kit Lai
Added 04 Jun 2010
Updated 04 Jun 2010
Type Conference
Year 2007
Where ISCAS
Authors S. Vijay, A. Prasad Vinod, Edmund Ming-Kit Lai
Comments (0)
books