Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors

Abstract

In this paper, a method called "Boolean subtraction" which enables the subtraction of two minterms and of two functions of the disjunctive normal form respectively of two ternary-vectors and of two ternary-vector-lists is presented. The advantage of "Boolean subtraction" is that the calculated results are already presented in an orthogonal form, which has a significant advantage for further calculations. It replaces two procedures, once building the difference and then the subsequent orthogonalizing and has faster computing time in comparison. Furthermore, another equation is developed from the property of this new method providing orthogonal results in order to orthogonalize functions of the disjunctive normal form.

New orthogonalizing Boolean equation using in the calculation of test patterns for combinatorial circuits

“…The method, "the orthogonalizing OR-ing ∨ g " , is based on the orthogonalizing difference-building [6], [5], which is the basis for setting up an equation (Eq. (3)) in the following.…”