The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
No contexto do projeto de multiplicação constante múltipla (MCM), propomos um novo algoritmo de eliminação de subexpressão comum (CSE) que modela a síntese ideal de coeficientes em um problema de programação linear inteira mista (MILP) 0-1 com um usuário- restrição de profundidade lógica genérica definida. Também propomos um espaço de soluções eficiente, que combina todas as representações de dígitos mínimos assinados (MSD) e a soma deslocada (diferença) dos coeficientes. Nos exemplos que demonstramos, a combinação do algoritmo proposto e do espaço de solução fornece uma solução melhor em comparação com os algoritmos existentes.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yuen-Hong Alvin HO, Chi-Un LEI, Hing-Kit KWAN, Ngai WONG, "Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 12, pp. 3568-3575, December 2008, doi: 10.1093/ietfec/e91-a.12.3568.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.12.3568/_p
Copiar
@ARTICLE{e91-a_12_3568,
author={Yuen-Hong Alvin HO, Chi-Un LEI, Hing-Kit KWAN, Ngai WONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint},
year={2008},
volume={E91-A},
number={12},
pages={3568-3575},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e91-a.12.3568},
ISSN={1745-1337},
month={December},}
Copiar
TY - JOUR
TI - Optimal Common Sub-Expression Elimination Algorithm of Multiple Constant Multiplications with a Logic Depth Constraint
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3568
EP - 3575
AU - Yuen-Hong Alvin HO
AU - Chi-Un LEI
AU - Hing-Kit KWAN
AU - Ngai WONG
PY - 2008
DO - 10.1093/ietfec/e91-a.12.3568
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2008
AB - 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.
ER -