Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the exact ordered binary decision diagram size of totally symmetric functions
Journal of Electronic Testing: Theory and Applications
Permutation and phase independent Boolean comparison
Integration, the VLSI Journal
Symmetry detection and dynamic variable ordering of decision diagrams
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Who are the variables in your neighborhood
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference 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
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
ACM Computing Surveys (CSUR)
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Formal Equivalence Checking and Design DeBugging
Formal Equivalence Checking and Design DeBugging
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Least Upper Bounds on OBDD Sizes
IEEE Transactions on Computers
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Speeding up variable reordering of OBDDs
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Least Upper Bounds on the Sizes of Symmetric Variable Order based OBDDs
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Technology mapping using boolean matching and don't care sets
EURO-DAC '90 Proceedings of the conference on European design automation
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
EURO-DAC '91 Proceedings of the conference on European design automation
BDD minimization using symmetries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
De Bruijn sequences and complexity of symmetric functions
Cryptography and Communications
| Hi-index | 14.98 |
This paper investigates reduced ordered binary decision diagrams (OBDD) of partially symmetric Boolean functions when using variable orders where symmetric variables are adjacent. We prove upper bounds for the size of such symmetry ordered OBDDs (SymOBDD). They generalize the upper bounds for the size of OBDDs of totally symmetric Boolean functions and nonsymmetric Boolean functions proven by Heap and Mercer [14], [15] and Wegener [37]. Experimental results based on these upper bounds show that the nontrivial symmetry sets of a Boolean function should be located either right up at the beginning or right up at the end of the variable order in order to obtain best upper bounds.