Efficient Boolean function matching
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
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)
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
Building a better Boolean matcher and symmetry detector
Proceedings of the conference on Design, automation and test in Europe: Proceedings
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
On the decreasing significance of large standard cells in technology mapping
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Simulation and SAT-based Boolean matching for large Boolean networks
Proceedings of the 46th Annual Design Automation Conference
A transform-parametric approach to Boolean matching
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the Conference on Design, Automation and Test in Europe
Generalized Boolean symmetries through nested partition refinement
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the 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, our approach is five times faster than the main competitor on 20-variables input functions, and scales better, allowing to match even larger components.