TABULAR TECHNIQUES FOR OR-COINCIDENCE LOGIC

摘要

The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities. The Fast Tabular Technique (FTT) for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed. The simulative result shows this FTT is faster than others in references because of its inherent parallelism.