ILP-Based Bitwidth-Aware Subexpression Sharing for Area Minimization in Multiple Constant Multiplication

[1]  R. M. Hewlitt,et al.  Canonical signed digit representation for FIR digital filters , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[2]  P. Flores,et al.  An Exact Breadth-First Search Algorithm for the Multiple Constant Multiplications Problem , 2008, 2008 NORCHIP.

[3]  J. McClellan,et al.  Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase , 1972 .

[4]  Markus Püschel,et al.  Multiplierless multiple constant multiplication , 2007, TALG.

[5]  Peter Y. K. Cheung,et al.  A heuristic approach for multiple restricted multiplication , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[6]  Ngai Wong,et al.  Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[7]  In-Cheol Park,et al.  FIR filter synthesis algorithms for minimizing the delay and the number of adders , 2001 .

[8]  A. Prasad Vinod,et al.  New Reconfigurable Architectures for Implementing FIR Filters With Low Complexity , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Nicola Nicolici,et al.  Combined optimal and heuristic approaches for multiple constant multiplication , 2010, 2010 IEEE International Conference on Computer Design.

[10]  Kaushik Roy,et al.  CSDC: a new complexity reduction technique for multiplierless implementation of digital FIR filters , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  David Bull,et al.  Primitive operator digital filters , 1991 .

[12]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[13]  Chiang-Ju Chien,et al.  A novel common-subexpression-elimination method for synthesizing fixed-point FIR filters , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Nicola Nicolici,et al.  An Optimal and Practical Approach to Single Constant Multiplication , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Oscar Gustafsson,et al.  Lower Bounds for Constant Multiplication Problems , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[18]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[19]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[20]  Lars Wanhammar,et al.  ILP modelling of the common subexpression sharing problem , 2002, 9th International Conference on Electronics, Circuits and Systems.

[21]  Ngai Wong,et al.  Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications , 2008, 2008 Asia and South Pacific Design Automation Conference.

[22]  In-Cheol Park,et al.  Digital filter synthesis based on minimal signed digit representation , 2001, DAC '01.

[23]  Levent Aksoy,et al.  Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  K. Steiglitz,et al.  Some complexity issues in digital signal processing , 1984 .