Name
Abstract | ||
|---|---|---|
In this paper we take a fresh look at the notion of symmetries in Boolean functions. Our studies are motivated by the fact that the classical characterization of symmetries based on invariance under variable swaps is a special case of a more general invariance based on unrestricted variable permutations. We propose a generalization of classical symmetry that allows for the simultaneous swap of ordered and unordered groups of variables, and show that it captures more of a function's invariant permutations without undue computational requirements. We apply the new symmetry definition to analyze a large set of benchmark circuits and provide extensive data showing the existence of substantial symmetries in those circuits. Specific case studies of several of these benchmarks reveal additional insights about their functional structure and how it might be related to their circuit structure. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/ICCAD.2000.896526 | San Jose, CA, USA |
Keywords | Field | DocType |
Boolean functions,logic CAD,Boolean functions,benchmark circuits,classical characterization,generalized symmetries,invariance | Boolean network,Boolean function,Discrete mathematics,Boolean circuit,Computer science,Parity function,Electronic engineering,Product term,Boolean expression,Complete Boolean algebra,Two-element Boolean algebra | Conference |
ISSN | ISBN | Citations |
1092-3152 | 0-7803-6445-7 | 18 |
PageRank | References | Authors |
0.88 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Victor N. Kravets | 1 | 124 | 11.78 |
| Karem A. Sakallah | 2 | 3314 | 287.44 |