BDD Variable Ordering by Scatter Search

Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. The variable ordering largely influences the size of the BDD, varying from linear to exponential. In this paper we study BDD minimization problem based on scatter search optimization. The results we obtained are very encouraging in comparison with other heuristics (genetic and simulated annealing). This work is the first successful experience of using scatter search approach in design automation area. The approach can be applied to many design automation applications.

• Type: Conference
• Year: 2001
• Where: ICCD
• Authors: William N. N. Hung, Xiaoyu Song
• Keywords: BDD Minimization Problem, Hardware, ICCD 2001, Scatter Search Approach, VLSI Design Automation