An optimization technique for ordered (binary) decision diagrams

Author

Dvorak, Vaclav

Author_Institution

Tech. Univ. of Brno, Czechoslovakia

fYear

1992

fDate

4-8 May 1992

Firstpage

1

Lastpage

4

Abstract

The minimum-cost ordered (binary) decision diagram (OBDD) (also a reduced OBDD or ROBDD) is a canonical representation for a logic function, given an ordering on its variables (R. Bryant, 1986). A new optimization technique is presented for suboptimal synthesis of ODDs of complete as well as partial multiple-output Boolean functions. The method is based on iterative decomposition. The central notion in this process is that of subfunctions, whereas in ODDs there are decision nodes. There is, however, 1:1 mapping between them: a level of decision nodes in the ODD corresponds to a set of subfunctions recognized in a corresponding decomposition step. The technique is computationally effective and deals with incomplete functions frequently used in practice. A small synthesis example is given to introduce a new technique for ROBDDs. The results and some experience with the optimization program are described.<>

Keywords

Boolean functions; decision theory; logic design; optimisation; ODDs; ROBDD; canonical representation; computationally effective; decomposition step; incomplete functions; iterative decomposition; logic function; optimization program; optimization technique; ordering; partial multiple-output Boolean functions; reduced OBDD; subfunctions; suboptimal synthesis; synthesis example; Binary decision diagrams; Boolean functions; Circuit testing; Computational efficiency; Cost function; Data structures; Digital systems; Iterative methods; Network synthesis; Sequential circuits;

fLanguage

English

Publisher

ieee

Conference_Titel

CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.

Conference_Location

The Hague, Netherlands

Print_ISBN

0-8186-2760-3

Type

conf

DOI

10.1109/CMPEUR.1992.218496

Filename

218496