ILP modelling of the common subexpression sharing problem

Subexpression sharing is an important implementation issue when one data is multiplied with many constants or a sum of products is computed. By modelling the subexpression sharing problem using integer linear programming (ILP) an optimal solution can be found. Further, the model can be directly incorporated with the design of algorithms that have linear design constraints, e.g., linear-phase FIR filters. The proposed method is compared with previously reported algorithms. It produces better results than other subexpression sharing methods, even though it is still not comparable with the optimal method based on graph representation. However, the possibility to expand the ILP model beyond subexpression sharing is discussed. This would then produce identical results to the optimal adder graph method.

[1]  A. Dempster,et al.  Multiplication by an integer using minimum adders , 1994 .

[2]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  A. Dempster,et al.  Constant integer multiplication using minimum adders , 1994 .

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

[5]  Y. Lim,et al.  Discrete coefficient FIR digital filter design based upon an LMS criteria , 1983 .

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

[7]  D. Ross.  Computer-aided design , 1961, CACM.

[8]  Lars Wanhammar,et al.  An MILP Approach for the Design of Linear-Phase FIR Filters with Minimum Number of Signed-Power-of-Two Terms , 2001 .

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

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

[11]  Andrew G. Dempster,et al.  Designing multiplier blocks with low logic depth , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[12]  Arda Yurdakul,et al.  Multiplierless Realization of Linear DSP Transforms by Using Common Two-Term Expressions , 1999, J. VLSI Signal Process..

[13]  G. Venkatesh,et al.  Synthesis of multiplier-less FIR filters with minimum number of additions , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[14]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[15]  Andrew G. Dempster,et al.  Extended results for minimum-adder constant integer multipliers , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).