On variable ordering and decomposition type choice in OKFDDs

Author

Drechsler, Rolf ; Becker, Bernd ; Jahnke, Andrea

Author_Institution

Dept. of Comput. Sci., Frankfurt Univ., Germany

fYear

1995

fDate

29 Aug-1 Sep 1995

Firstpage

805

Lastpage

810

Abstract

We present methods for the construction of small ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a generalization of ordered binary decision diagrams (OBDDs) and ordered functional decision diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree like circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing two level and multi level circuits, respectively. Experimental results are presented to show the efficiency of our approaches

Keywords

circuit CAD; decision theory; diagrams; directed graphs; network synthesis; OBDDs; OKFDDs; decomposition type choice; decomposition types; multi level circuits; ordered binary decision diagrams; ordered functional decision diagrams; small ordered Kronecker functional decision diagrams; tree like circuit; variable ordering; Boolean functions; Circuits; Computer science; Data structures; Interleaved codes; Logic; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 1995. Proceedings of the ASP-DAC '95/CHDL '95/VLSI '95., IFIP International Conference on Hardware Description Languages. IFIP International Conference on Very Large Scal

Conference_Location

Chiba

Print_ISBN

4-930813-67-0

Type

conf

DOI

10.1109/ASPDAC.1995.486406

Filename

486406