Permutation and phase independent Boolean comparison
Integration, the VLSI Journal
Limits of using signatures for permutation independent Boolean comparison
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
Boolean matching for large libraries
DAC '98 Proceedings of the 35th annual Design Automation Conference
Generalized symmetries in boolean functions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Technology mapping using boolean matching and don't care sets
EURO-DAC '90 Proceedings of the conference on European design automation
A new canonical form for fast boolean matching in logic synthesis and verification
Proceedings of the 42nd annual Design Automation Conference
K-disjointness paradigm with application to symmetry detection for incompletely specified functions
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Efficient canonical form for Boolean matching of complex functions in large libraries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A transform-parametric approach to Boolean matching
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this paper, we present the concept of k-distance signature which is a general case of many existing signatures. By exploiting k-distance signature, we propose an Algorithm for Input Differentiation AID) which is very powerful to distinguish inputs of Boolean functions. Moreover, based on AID, we propose a heuristic method to detect gsym~of Boolean functions and a Boolean matching algorithm. The experimental results show that our methods are not only effective but also very efficient for Boolean matching and gsym~detection.