.png){kind=icon}
返回
A Canonical-Based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2778338.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new compact canonical-based algorithm to solve the problem of single-output completely specified input negation and/or input permutation and/or output negation Boolean matching. We propose a new signature vector Boolean difference and cofactor signature vector. Our algorithm utilizes the Boolean difference, cofactor signature, and symmetry properties to search for canonical transformations. The use of symmetry and Boolean difference notably reduces the search space and speeds up the Boolean matching process compared with the algorithm proposed by Adbollahi and Pedram. We tested our algorithm on a large number of circuits. The experimental results showed that the average runtime of our algorithm 37% higher and its average search space 67% smaller compared with Adbollahi and Pedram, when tested on general circuits.
Keyword:
Boolean difference
boolean matching
NPN equivalent
symmetry
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Chronic treatment with cinnamaldehyde prevents spontaneous atherosclerotic plaque development in ovariectomized LDLr-/- female mice肉桂醛的慢性治疗可预防卵巢切除的LDLr-/-雌性小鼠自发性动脉粥样硬化斑块的形成。
PREAI
分享收藏Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism用群同构计算布尔函数的仿射等价课程
PREAI
分享收藏
分享收藏
查看更多内容