Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint

スポンサーリンク

概要

• 論文の詳細を見る

• In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem with a user-defined generic logic depth constraint. We also propose an efficient solution space, which combines all minimal signed digit (MSD) representations and the shifted sum (difference) of coefficients. In the examples we demonstrate, the combination of the proposed algorithm and solution space gives a better solution comparing to existing algorithms.

• 2008-12-01

著者

• Kwan Hing-kit

  Department Of Electrical And Electronic Engineering The University Of Hong Kong

• Ho Yuen-hong

  Department Of Electrical And Electronic Engineering The University Of Hong Kong

• Wong Ngai

  Department Of Electrical And Electronic Engineering The University Of Hong Kong

• LEI Chi-Un

  Department of Electrical and Electronic Engineering, The University of Hong Kong

• Lei Chi-un

  Department Of Electrical And Electronic Engineering The University Of Hong Kong

関連論文

• Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint

スポンサーリンク