Exact minimization of binary decision diagrams using implicit techniques

doi:10.1109/12.736442

1998-01-01

PRE

Arlindo L. Oliveira *

Luca P. Carloni

Tiziano Villa

Sangiovanni-Vincentelli, AL

DOI：10.1109/12.736442

原文链接

原文求助

摘要

En 中文

This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don't care sets. Specifically, given an incompletely specified function g and a fixed ordering of the variables, we propose an exact algorithm for selecting f such that f is a cover for g and the binary decision diagram for f is of minimum size. The approach described is the only known exact algorithm for this problem not based on the enumeration of the assignments to the points in the don't care set. We show also that our problem is NP-complete. We show that the BDD minimization problem can be formulated as a binate covering problem and solved using implicit enumeration techniques. In particular, we show that the minimum-sized binary decision diagram compatible with the specification can be found by solving a problem that is very similar to the problem of reducing incompletely specified finite state machines. We report experiments of an implicit implementation of our algorithm, by means of which a class of interesting examples was solved exactly. We compare it with existing heuristic algorithms to measure the quality of the latter.

Keyword:

binary decision diagrams

incompletely specified functions

minimization of logic functions

incompletely specified finite state machines

state minimization

implicit logic computations