The Espresso-II Minimization Loop and Algorithms

  • Robert K. Brayton
  • Gary D. Hachtel
  • Curtis T. McMullen
  • Alberto L. Sangiovanni-Vincentelli
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 2)

Abstract

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.

Keywords

Assure Vanilla 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1984

Authors and Affiliations

  • Robert K. Brayton
  • Gary D. Hachtel
  • Curtis T. McMullen
  • Alberto L. Sangiovanni-Vincentelli

There are no affiliations available

Personalised recommendations