Abstract
Optimizing adder cost for the implementation of 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
