About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICCAD 1984
Conference paper
SYMBOLIC MINIMIZATION OF LOGIC FUNCTIONS.
Abstract
Symbolic minimization consists of determining a two-level sum-of-products representation of a switching function in a minimal number of product terms, independently of the Boolean encoding of all (or part of) the inputs and outputs. When the objective is to determine a binary-valued description, the minimal symbolic representation determines a set of constraints for the encoding of the input and outputs into Boolean variables. Symbolic minimization is related, but not equivalent, to multiple-valued logic minimization. It represents a new concept in switching theory. Formal definitions and properties of a symbolic representation of a switching function are presented. An algorithm for symbolic minimization is described. The algorithm is implemented in a computer program called CAPPUCCINO, which is built on top of a modified version of the heuristic logic minimizer ESPRESSO-II.