Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Boolean matching using generalized Reed-Muller forms
DAC '94 Proceedings of the 31st annual Design Automation Conference
Generalized Reed-Muller Forms as a Tool to Detect Symmetries
IEEE Transactions on Computers
Constructive library-aware synthesis using symmetries
DATE '00 Proceedings of the conference on Design, automation and test in Europe
In-place delay constrained power optimization using functional symmetries
Proceedings of the conference on Design, automation and test in Europe
Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
BDD minimization using symmetries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis of symmetric functions for path-delay fault testability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast computation of symmetries in Boolean functions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
High level equivalence symmetric input identification
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific 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
Incremental learning approach and SAT model for Boolean matching with don't cares
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
In this paper, we formulate symmetry detection for incompletely specified functions as an equation without using cofactor computation and equivalence checking. Based on this equation, a symmetry detection algorithm is proposed. This algorithm can simultaneously find non-equivalence and equivalence symmetries. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving symmetry detection problem for incompletely specified functions.