Synthesis of multiplier-less FIR filters with minimum number of additions
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636757,p. 668-671
- https://doi.org/10.1109/iccad.1995.480201
Abstract
In this paper we present optimizing transformations to minimize the number of additions+subtractions in both the direct form (/spl Sigma/ A/sub i/X/sub n-i/ based) and its transposed form (Multiple Constant Multiplication based) implementation of FIR filters. These transformations are based on the iterative elimination of 2-bit common subexpressions in the coefficients binary representations. We give detailed description of the algorithms and present results for eight low pass FIR filters with the number of coefficients ranging from 16 to 128. The results show upto 35% reduction in the number of additions+subtractions to implement /spl Sigma/ A/sub i/X/sub n-i/ based FIR filter structures and upto 38% reduction to implement MCM based structures.Keywords
This publication has 5 references indexed in Scilit:
- Efficient CAD tools for the coefficient optimisation of arbitrary integrated digital filtersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Techniques for low power realization for FIR filtersPublished by Association for Computing Machinery (ACM) ,1995
- Greedy hardware optimization for linear digital circuits using number splitting and refactorizationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1993
- An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficientsIEEE Transactions on Circuits and Systems, 1989
- Applications of distributed arithmetic to digital signal processing: a tutorial reviewIEEE ASSP Magazine, 1989