Optimizing adder cost for the implementationof finite-impulse response (FIR) filter has been an area of active research. The prevailing algorithms for the design of fixed point FIR filters have decoupled the filter coefficient synthesis from common subexpression elimination. This paper presents a new algorithm for the design of low-complexity FIR filters with resource sharing to reduce the adder cost directly during the coefficient synthesis process. The original problem statement based on the minimization of Signed-Power-of-Two (SPT) terms is recast to account for the physical adder cost oriented Common Signed-Power-of-Two (CSPT) terms. Experimental results demonstrate that our algorithm is capable of synthesizing FIR filters with the least CSPT terms compared with existing filter synthesis algorithms.
展开▼
