Permutation group algorithms based on partitions, I: Theory and algorithms
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Efficient Boolean function matching
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
Limits of using signatures for permutation independent Boolean comparison
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific 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
Generalized symmetries in boolean functions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
A spectral method for Boolean function matching
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Efficient computation of canonical form for Boolean matching in large libraries
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Building a better Boolean matcher and symmetry detector
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Exploiting K-Distance Signature for Boolean Matching and G-Symmetry Detection
Proceedings of the 43rd annual Design Automation Conference
A unified approach to canonical form-based Boolean matching
Proceedings of the 44th annual Design Automation Conference
A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods
IEEE Transactions on Computers
Efficient canonical form for Boolean matching of complex functions in large libraries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
BooM: a decision procedure for boolean matching with abstraction and dynamic learning
Proceedings of the 47th Design Automation Conference
Boolean matching of function vectors with strengthened learning
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.03 |
In this paper, we address the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the spectral- and canonical-form-based approaches to the problem. As a first major contribution, we show how these approaches are particular cases of a single generic algorithm, parametric with respect to a given linear transformation of the input function. As a second major contribution, we identify a linear transformation that can be used to significantly speed up Boolean matching with respect to the state of the art. Experimental results show that, on average, over a large set of randomly generated Boolean functions, our approach is up to five times faster than the main competitor on 20-variable input and scales better, allowing to match even larger components. Finally, as a representative set of Boolean functions that arise in practice, we considered multiplexers with three, four, and five selectors and functions extracted from the ISCAS85 benchmarks suite with a number of input variables up to 20. The reported performance results show that our approach allows us to halve the canonizing computation time.