The search functionality is under construction.
The search functionality is under construction.

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

Yuen-Hong Alvin HO, Chi-Un LEI, Hing-Kit KWAN, Ngai WONG

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.12 pp.3568-3575
Publication Date
2008/12/01
Publicized
Online ISSN
1745-1337
DOI
10.1093/ietfec/e91-a.12.3568
Type of Manuscript
Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Category
High-Level Synthesis and System-Level Design

Authors

Keyword