4 search results - page 1 / 1 » A Greedy Common Subexpression Elimination Algorithm for Impl... |
ISCAS
2007
IEEE
13 years 11 months ago
2007
IEEE
— 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 Subexp...
ISSS
1997
IEEE
13 years 8 months ago
1997
IEEE
- An approach for broadband modem FIR filter design optimization is presented. It addresses the minimization of the number of addersubtractors used in the hardware implementation o...
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— In this paper, we propose a novel common subexpresson elimination (CSE) method to be used for VLSI design of multiplierless finite impulse response (FIR) filter with ...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...