Anzeige
Erschienen in:
1984 | OriginalPaper | Buchkapitel
The Espresso-II Minimization Loop and Algorithms
verfasst von : Robert K. Brayton, Gary D. Hachtel, Curtis T. McMullen, Alberto L. Sangiovanni-Vincentelli
Erschienen in: Logic Minimization Algorithms for VLSI Synthesis
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
ESPRESSO-II receives as its inputs J and D, cube covers of the on-set and the don’t-care set of an incompletely specified Boolean function ff. Optionally, it can accept input J and Rx, cube covers of the on- and off-sets. It returns as its output a “minimized” cover. As discussed in Chapter 1, the objectives of ESPRESSO-II are to minimize: NPT: the number of product terms in the cover;NLI: the number of literals (non-2’s) in the input parts of the cover;NLO: the number of literals in the output parts.