首页> 外文期刊>Journal of multiple-valued logic and soft computing >Arithmetic Transform Ternary Decision Diagrams for Exact Minimization of Fixed-Polarity Arithmetic Expressions
【24h】

Arithmetic Transform Ternary Decision Diagrams for Exact Minimization of Fixed-Polarity Arithmetic Expressions

机译:精确最小化定极性算术表达式的算术变换三元决策图

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we define Arithmetic Transform TDDs (AC-TDDs) as a word-level counterpart of EXOR-TDDs. We discuss relationships and differences with the Arithmetic TDDs (Arith-TDDs). Then, we pointed out that from AC-TDDs we can read all the arithmetic polynomial expressions for switching functions. We show that, unlike other TDDs, single root AC-TDDs can be used to represent multi-output functions. We also show that AC-TDDs can be used for exact minimization of Fixed-polarity Arithmetic expressions in the same way as EXOR-TDDs can be used for minimization of Fixed-polarity Reed-Muller expressions.
机译:在本文中,我们将算术变换TDD(AC-TDD)定义为EXOR-TDD的字级对应。我们讨论了算术TDD(Arith-TDD)的关系和差异。然后,我们指出,从AC-TDD中,我们可以读取切换函数的所有算术多项式表达式。我们表明,与其他TDD不同,单根AC-TDD可用于表示多输出功能。我们还展示了AC-TDD可以用于固定极性算术表达式的精确最小化,就像EXOR-TDD可以用于固定极性Reed-Muller表达式的最小化一样。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号