Boolean Orthogonalizing Combination Methods

Can, Yavuz; Fischer, Georg

doi:10.5121/csit.2015.51102

Cited by 4 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: Sum Of Blocksmentioning

confidence: 99%

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

Can

Fischer

2015

2015 9th International Conference on Electrical and Electronics Engineering (ELECO)

Self Cite

View full text Add to dashboard Cite

In this paper a new Boolean equation for the orthogonalization of Boolean functions respectively of Ternary-Vector-Lists of disjunctive normal form is presented. It provides the mathematical solution of orthogonalization. The new equation is based on the new method of orthogonalizing OR-ing ∨ g which enables the building the union of two product terms respectively of two Ternary-Vectors whereby the result is orthogonal. The algorithm based on the new equation has a faster computation time in contrast to other methods. Further advantage is the smaller number of the product terms respectively of the Ternary-Vectors in the orthogonalized result which reduces the number of further calculation steps. Furthermore, the new equation can be used as a part in the calculation procedure of getting suitable test patterns for combinatorial circuits for verifying feasible logical faults.

show abstract

“…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.…”

Section: Sum Of Blocksmentioning

confidence: 99%