Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient Boolean function matching
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Boolean matching in logic synthesis
EURO-DAC '92 Proceedings of the conference on European design automation
Boolean matching for incompletely specified functions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
A survey of Boolean matching techniques for library binding
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Boolean matching for large libraries
DAC '98 Proceedings of the 35th annual Design Automation Conference
Efficent Boolean Matching Algorithm for Cell Libraries
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Technology mapping using boolean matching and don't care sets
EURO-DAC '90 Proceedings of the conference on European design automation
Efficient computation of canonical form for Boolean matching in large libraries
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A new canonical form for fast boolean matching in logic synthesis and verification
Proceedings of the 42nd annual Design Automation Conference
Fast Boolean Matching with Don't Cares
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Simulation and SAT-based Boolean matching for large Boolean networks
Proceedings of the 46th Annual Design Automation Conference
BooM: a decision procedure for boolean matching with abstraction and dynamic learning
Proceedings of the 47th Design Automation Conference
Proceedings of the Conference on Design, Automation and Test in Europe
Boolean matching of function vectors with strengthened learning
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
Boolean matching is to determine whether two functions are equivalent under input permutation and input/output phase assignment. This paper will address the Boolean Matching problem for incompletely specified functions. Signatures have previously been used for Boolean matching of completely specified functions. In this paper for the first time we use signatures to determine the equivalency of incompletely specified functions.