A new exact logic minimization algorithm based on a combinational algorithm for sharp-products

Abstract

The authors provide a new combinational algorithm for the sharp-product (SP) operation. For the SP of a cube w.r.t. a set of cubes, they introduce a row incidence matrix such that each prime cube of the SP corresponds to a minimal cover of the maximal effective column combinations of the matrix. Using this result, a new efficient exact logic minimization algorithm for multiple-values functions is given.<>