A new algorithm for elimination of common subexpressions
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 18 (1) , 58-68
- https://doi.org/10.1109/43.739059
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Synthesis of multiplier-less FIR filters with minimum number of additionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Subexpression sharing in filters using canonic signed digit multipliersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1996
- Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression eliminationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Use of minimum-adder multiplier blocks in FIR digital filtersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1995
- Primitive operator digital filtersIEE Proceedings G Circuits, Devices and Systems, 1991
- An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficientsIEEE Transactions on Circuits and Systems, 1989