Dynamic minimization of OKFDDs

Author

Drechsler, Rolf ; Becker, Bernd

Author_Institution

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

fYear

1995

fDate

2-4 Oct 1995

Firstpage

602

Lastpage

607

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. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We briefly discuss the implementation of PUMA, our OKFDD package. The quality of our methods in comparison with sifting and interleaving for OBDDs is demonstrated based on experiments performed with PUMA

Keywords

Boolean functions; decision theory; diagrams; directed graphs; logic design; minimisation; OKFDD package; OKFDDs; Ordered Binary Decision Diagrams; Ordered Functional Decision Diagrams; PUMA; decomposition type choice; dynamic minimization; dynamic variable ordering; small Ordered Kronecker Functional Decision Diagrams; Boolean functions; Circuit synthesis; Computer science; Data structures; Field programmable gate arrays; Interleaved codes; Logic; Minimization; Packaging; Runtime;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 1995. ICCD '95. Proceedings., 1995 IEEE International Conference on

Conference_Location

Austin, TX

ISSN

1063-6404

Print_ISBN

0-8186-7165-3

Type

conf

DOI

10.1109/ICCD.1995.528930

Filename

528930