Limits of Using Signatures for Permutation Independent Boolean Comparison

Authors:
Janett Mohnke;Paul Molitor;Sharad Malik
Affiliations:
DResearch Digital Media Systems GmbH, Otto-Schmirgal-Strasse 3, 10319, Berlin, Germany. mohnke@dresearch.de;Institute of Computer Science, Martin-Luther-University, 06009 Halle an der Saale, Germany. molitor@informatik.uni-halle.de;Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA. malik@ee.princeton.edu
Venue:
Formal Methods in System Design
Year:
2002

Citing 9
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The complexity of Boolean functions

The complexity of Boolean functions
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Spectral transforms for large boolean functions with applications to technology mapping

DAC '93 Proceedings of the 30th international Design Automation Conference
Permutation and phase independent Boolean comparison

Integration, the VLSI Journal
On diagnosis and correction of design errors

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Detection of symmetry of Boolean functions represented by ROBDDs

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Efficient Boolean function matching

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Boolean Matching Using Binary Decision Diagrams with Applications to Logic Synthesis and Verification

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Fast Boolean Matching with Don't Cares

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Proceedings of the 43rd annual Design Automation Conference
Conjugate symmetry

Formal Methods in System Design
Extending symmetric variable-pair transitivities using state-space transformations

Proceedings of the great lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses problems that arise while checking the equivalence of two Boolean functions under arbitrary input permutations. The permutation problem has several applications in the synthesis and verification of combinational logic: it arises in the technology mapping stage of logic synthesis and in logic verification. A popular method to solve it is to compute a signature for each variable that helps to establish a correspondence between the variables. Several researchers have suggested a wide range of signatures that have been used for this purpose. However, for each choice of signature, there remain variables that cannot be uniquely identified. Our research has shown that, for a given example, this set of problematic variables tends to be the same–regardless of the choice of signatures. The paper investigates this problem.