This Article 
 Bibliographic References 
 Add to: 
Vector Boolean Algebra and Calculus
September 1976 (vol. 25 no. 9)
pp. 865-874
S.C. Lee, School of Electrical Engineering, University of Oklahoma
In this paper, binary-vector Boolean algebra, a generalization of ordinary Boolean algebra [6], is introduced. In this algebra, every element is represented by a binary vector and in addition to ordinary AND, OR, and NOT operations, a new operation called the rotation operation which rotates (rightward or leftward) the components of a binary vector is introduced. Moreover, the NOT or COMPLEMENTATION operation is extended to a more general operation called the generalized complement which includes the total complement (ordinary complement), the null complement (no complement), and newly introduced partial complements. Because of this generalization, all axioms and theorems of ordinary Boolean algebra are generalized. In particular, it is shown that DeMorgan's theorem, Shannon's theorem, and the expansion theorem are generalized into more general forms which include their corresponding ordinary version as a special case. It is also shown that any multivalued logic truth table can be represented by a vector Boolean function. Three compact canonical (sum-of-products and product-of-sums) forms of this function are presented.
Index Terms:
Canonical form, fault detection, logic design, multibus digital systems, multivalued algebra.
S.C. Lee, "Vector Boolean Algebra and Calculus," IEEE Transactions on Computers, vol. 25, no. 9, pp. 865-874, Sept. 1976, doi:10.1109/TC.1976.1674711
Usage of this product signifies your acceptance of the Terms of Use.