Determining optimum variable orders for bdds using pair-wise variable grouping

作者: Jawahar Jain , Stergios Stergiou

DOI:

关键词:

摘要: One embodiment accesses a binary decision diagram (BDD) representing function having n variables, where n≧2, wherein the BDD comprises layers corresponding to respectively; separates variables into ! 2 ⌊ / ⌋ groups, each group comprises ⌈ ⌉ ordered sets, and set in 1 or variables; for of the determines locally optimum variable order that yields smallest size among └n/2┘ different orders obtained within group; selects from locally groups an orders.

参考文章(33)
Jamie Robert Snape, Loopless Functional Algorithms ,(2005)
Viresh Paruthi, Jason Baumgartner, Robert Kanzelman, Geert Janssen, Optimizing a netlist circuit representation by leveraging binary decision diagrams to perform rewriting ,(2008)
Kim Milvang-Jensen, Alan J. Hu, BDDNOW: A Parallel BDD Package formal methods in computer aided design. pp. 501- 507 ,(1998) , 10.1007/3-540-49519-3_32
Fabio Somenzi, Hiroyuki Higuchi, Lazy group sifting for efficient symbolic state traversal of FSMs international conference on computer aided design. pp. 45- 49 ,(1999) , 10.5555/339492.339567
A. Hett, R. Drechsler, B. Becker, MORE: an alternative implementation of BDD packages by multi-operand synthesis european design automation conference. pp. 164- 169 ,(1996) , 10.5555/252471.252504
Stergios Stergiou, Jawahar Jain, Dynamically resizable binary decision diagrams great lakes symposium on vlsi. pp. 185- 190 ,(2010) , 10.1145/1785481.1785528
Octav Brudaru, Ru Ebendt, Iulian Furdu, Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm symbolic and numeric algorithms for scientific computing. pp. 167- 173 ,(2010) , 10.1109/SYNASC.2010.33