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
Detection of symmetry of Boolean functions represented by ROBDDs
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Boolean Functions Classification via Fixed Polarity Reed-Muller Forms
IEEE Transactions on Computers
ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
On a New Boolean Function with Applications
IEEE Transactions on Computers
Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Generalized symmetries in boolean functions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries
EDTC '97 Proceedings of the 1997 European conference on Design and Test
A Comment on "Generalized Reed-Muller Forms as a Tool to Detect Symmetries"
IEEE Transactions on Computers
Symmetry detection for incompletely specified functions
Proceedings of the 41st annual Design Automation Conference
An anytime symmetry detection algorithm for ROBDDs
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
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
Proceedings of the 43rd annual Design Automation Conference
Formal Methods in System Design
Extending symmetric variable-pair transitivities using state-space transformations
Proceedings of the great lakes symposium on VLSI
| Hi-index | 14.99 |
In this paper, we present a new method for detecting groups of symmetric variables of completely specified Boolean functions. The canonical Generalized Reed-Muller (GRM) forms are used as a powerful analysis tool. To reduce the search space we have developed a set of signatures that allow us to identify quickly sets of potentially symmetric variables. Our approach allows for detecting symmetries of any number of inputs simultaneously. Totally symmetric functions can be detected very quickly. The traditional definitions of symmetry have also been extended to include more types. This extension has the advantage of grouping input variables into more classes. Experiments have been performed on MCNC benchmark cases and the results verify the efficiency of our method