Functional approaches to generating orderings for efficient symbolic representations
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Ordered binary decision diagrams and circuit structurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic verification using binary decision diagrams in a logic synthesis environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Minimization of binary decision diagrams based on exchanges of variablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On variable ordering of binary decision diagrams for the application of multi-level logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast functional evaluation of candidate OBDD variable orderingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient implementation of a BDD packagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Shared binary decision diagram with attributed edges for efficient Boolean function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagramsPublished by Association for Computing Machinery (ACM) ,1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986