Representations of logic functions using QRMDDs
Representations of logic functions using QRMDDs
复制标题
使用 QRMDD 表示逻辑函数
DOI：
10.1109/ismvl.2002.1011097
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
M. Matsuura
中科院分区：
文献类型：
--
作者：
Shinobu Nagayama;Tsutomu Sasao;Y. Iguchi;M. Matsuura
本文考虑用k位拟约化多值判定图（QRMDD（k）s）表示二值逻辑函数。它显示了QRMDD（k）s中的节点数与基准函数的k值之间的关系; QRMDD（k）中节点数的上限;随机函数的上限与QRMDD（k）s中节点数之间的差异;以及QRMDD（k）s的总内存量，评估时间和面积时间复杂度。使用标准基准测试函数的实验结果表明，当k在3和6之间时，面积时间复杂度最小。
This paper considers quasi-reduced multi-valued decision diagrams with k bits (QRMDD(k)s) to represent two-valued logic functions. It shows relations between the numbers of nodes in QRMDD(k)s and values of k for benchmark functions; an upper bound on the number of nodes in the QRMDD(k); difference between the upper bound and the number of nodes in the QRMDD(k)s for random functions; and the amount of total memory, evaluation time, and area-time complexity for QRMDD(k)s. Experimental results using standard benchmark functions show that the area-time complexity takes its minimum when k is between 3 and 6.