BDD variable ordering by scatter search

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn , Issue , 2001, Pages 368-373

  Hung, William N N ^a   Song, Xiaoyu ^b  

^a INTEL CORPORATION   (United States)

^b PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; INTEGER PROGRAMMING; OPTIMIZATION;

BINARY DECISION DIAGRAMS (BDD);

VLSI CIRCUITS;

EID: 0035189556     PISSN: 10636404     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCD.2001.955053     Document Type: Article

References (27)

1. Simulated annealing to improve variable orderings for OBDDs
2. Graph-based algorithms for boolean function manipulation
3. Advanced ordering and manipulation techniques for binary decision diagrams
4. Scatter search for the linear ordering problem
5. A genetic algorithm for variable ordering of OBDDs
6. Fast exact minimization of BDD's
7. Dynamic variable reordering for BDD minimization
8. An efficient heuristic for state encoding minimizing the BDD representations of the transition relations of finite state machines
9. Finding the optimal variable ordering for binary decision diagrams
10. Variable ordering algorithms for ordered binary decision diagrams and their evaluation
11. On variable ordering of binary decision diagrams for the application of multi-level synthesis
12. A template for scatter search and path relinking
13. Scatter search
14. Heuristic symmetry reduction for invariant verification
15. Minimization of binary decision diagrams based on exchanges of variables
16. An efficient method for optimal BDD ordering computation
17. Scatter search
18. Logic verification using binary decision diagrams in a logic synthesis environment
19. Exact minimization of binary decision diagrams using implicit techniques
20. Who are the variables in your neighbourhood
21. Symmetry detection and dynamic variable ordering of decision diagrams
22. Dynamic variable ordering for ordered binary decision diagrams
23. BDD minimization using symmetries
24. Heuristic minimization of BDDs using don't cares