MV-SOP Minimizers
For each i-set (MV-input, binary output)
nTwo-level: Espresso-MV
wminimize an i-set with a don’t care.
wa don’t care is an input for which the output can be any value.
nTwo-Level: ISOP (Minato)
wFast method to build a cover of cubes of an i-set from MDD of function and MDD of don’t cares (method of Minato extended to MV).
All i-sets at once
n Quine-McCluskey type ND
minimization
wGiven a ND relation, generate a cover of all i-sets such that the total number of cubes is minimum.
100 11 011 101 0
101 10 111 011 0
110 10 110 110 0
100 11 111 101 1
111 01 100 111 1
100 11 110 110 1
<default> 2
a b
c d z
101 01 100 001 -
010 01 001 101 -
DC