Quaternary-vector-list for totally computational treating of switching algebraic tasks

Abstract

In this paper an advanced form of vector-list called quaternary-vector-list QVL is introduced. QVL is the computational representation of Boolean function or switching function respectively and enables the total computational treatment of switching algebraic tasks. It has advantages in terms of memory usage, simplicity, clarity and also in computation time. Furthermore, important operations as complement, intersection and union are demonstrated for the advanced QVL-arithmetic. By the use of QVL the computational utilization of the extended basis function forms of switching function will be granted. By QVL the already available ternary-vector-list TVL is supplemented and substituted.