Journal Article10.1109/43.541444
Exploiting communication complexity for Boolean matching
TL;DR: Two signatures, cofactor and equivalence signatures are proposed, which are general forms of many existing signatures that are used to develop an efficient Boolean matching algorithm which is based on checking structural equivalence of OBDD's.
read more
Abstract: Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. A straightforward implementation takes time complexity O(n!2/sup n/2), where n is the number of variables. Various signatures of variables were used to prune impossible permutations by many researchers. In this paper, based on communication complexity, we also propose two signatures, cofactor and equivalence signatures, which are general forms of many existing signatures. These signatures are used to develop an efficient Boolean matching algorithm which is based on checking structural equivalence of OBDD's. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving Boolean matching problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of Boolean matching techniques for library binding
Luca Benini,Giovanni De Micheli +1 more
TL;DR: A general formulation of Boolean matching supporting multiple-output logic cells and its generalization to cases involving don't care conditions and its restriction to specific libraries such as those typical of anti-fuse based FPGAs are presented.
116
Efficient computation of canonical form for Boolean matching in large libraries
Debatosh Debnath,Tsutomu Sasao +1 more
- 27 Jan 2004
TL;DR: An efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large, and is more than two orders of magnitude faster than the Hinsberger-Kolla algorithm---the fastest Boolean matching algorithm for large libraries.
33
Fast Boolean matching under permutation using representative
Debatosh Debnath,T. Sasao +1 more
- 18 Jan 1999
TL;DR: This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables, and develops a breadth-first search technique to quickly compute the P-representative.
Application of BDDs in Boolean matching techniques for formal logic combinational verification
TL;DR: This paper reviews the main approaches to this isomorphism problem and shows how to apply OBDDs in order to obtain efficient methods.
19
PAPER Special Section on VLSI Design and CAD Algorithms Fast Boolean Matching under Permutation by Efficient Computation of Canonical Form
Debatosh Debnath,Tsutomu Sasao +1 more
- 01 Jan 2004
TL;DR: This paper presents an efficient breadth-first search technique for computing a canonical form-namely P-representative-of Boolean functions under permutation of the variables that requires several microseconds to check the Boolean matching of functions with up to eight variables against a library with tens of thousands of cells.
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Technology mapping using Boolean matching and don't care sets
Frederic Mailhot,G. De Micheli +1 more
- 12 Mar 1990
TL;DR: The authors describe a new approach to technology mapping where matchings are recognized by means of Boolean operations and show how to use the symmetry and unateness properties to speed up the Boolean matching algorithm.
106
Boolean matching using binary decision diagrams with applications to logic synthesis and verification
Yung-Te Lai,S. Sastry,M. Pedram +2 more
- 11 Oct 1992
TL;DR: An algorithm for Boolean matching based on binary decision diagrams using a level-first search strategy is presented and it is shown how the matching algorithm and the filters can be extended to Boolean functions with don't cares.
77
Permutation and phase independent Boolean comparison
Janett Mohnke,Sharad Malik +1 more
- 22 Feb 1993
TL;DR: The problem of checking the equivalence of two Boolean functions under arbitrary input permutations and/or input plane assignments is considered and a signature is computed for each variable or phase of a variable to help establish correspondence of variables or phases of variables.
68