A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon Decomposition

In this paper, we describe a new verification method to accelerate the input negation and/or input permutation and/or output negation (NPN) Boolean matching for a single-output completely specified Boolean function. Through research on the Boolean Shannon decomposition binary tree, we prove that the...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 10; pp. 120369 - 120382
Main Authors:	Zhang, Juling, Guo, Wenqiang, Yang, Guowu, Zhu, Yixin, Lv, Xiaoyi
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Benchmarks Binary trees Boolean Boolean functions Boolean matching Circuits Cyberspace Decomposition Finance Impedance matching Independent variables Information theory Iterative methods Matching Nodes NPN equivalence Permutations Runtime Shannon decomposition binary tree Shannon expansion signature vector Transformations (mathematics) Verification
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!