BDD minimization by scatter search

Author

Hung, William N N ; Song, Xiaoyu ; Aboulhamid, El Mostapha ; Driscoll, Michael A.

Author_Institution

Intel Archit. Group, Intel Corp., Hillsboro, OR, USA

Volume

21

Issue

8

fYear

2002

fDate

8/1/2002 12:00:00 AM

Firstpage

974

Lastpage

979

Abstract

Reduced-ordered binary decision diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions. The variable ordering largely influences the size of the BDD, varying from linear to exponential. In this paper, the authors study the BDD minimization problem based on scatter search optimization. Scatter search offers a reasonable compromise between quality (BDD reduction) and time. On smaller benchmarks it delivers almost optimal BDD size with less time than the exact algorithm. For larger benchmarks it delivers smaller BDD sizes than genetic algorithm or simulated annealing at the expense of longer runtime.

Keywords

Boolean functions; binary decision diagrams; data structures; logic CAD; minimisation of switching nets; BDD minimization; Boolean functions; benchmarks; data structure; logic design; logic synthesis; manipulation; reduced-ordered binary decision diagrams; representation; runtime; scatter search; variable ordering; Benchmark testing; Binary decision diagrams; Boolean functions; Data structures; Genetic algorithms; Logic design; Logic testing; Minimization; Scattering; Simulated annealing;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/TCAD.2002.800452

Filename

1020354