Generating prime and irredundant covers for binary decision diagrams

Abstract

The paper presents algorithms for two-level logic minimization of Boolean functions represented by Modified Binary Decision Diagrams (MBDs). MBDs allow the representation of the don't care set in the same graph. The main goal is to produce prime and irredundant covers for these MBDs. A new kind of mixed two-level representation is adopted, where each cube is itself a MBD. Results obtained are comparable to those from ESPRESSO.<>