Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 2)
The Espresso-II Minimization Loop and Algorithms
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.
KeywordsBoolean Function Minimum Cover Small Cube Unate Cover Recursion Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Kluwer Academic Publishers 1984