Publisher Summary Two-valued algebras, their implementations, and their applications have been investigated. The properties that contributed to this interest are: simple canonical expressions, easily manipulated expressions, and fast economical realizations of the mathematical operations. For serious consideration to be given to the use of multiple-valued algebras by logic designers, these properties must be present. The realizations of such algebras are significant in determining their use in logic design is the reason they are termed implementation oriented algebras. Two implementation algebras have been formulated. The map representation of a multiple-valued switching function is a rearrangement of its table of combinations. In view of the circuit complexity of the realization of a literal as compared to those of the min and max operations a minimization criterion that weighs distinct literals heavier than min and max appears reasonable.
[1]
Donald D. Givone,et al.
A Method of Solution for Multiple-Valued Logic Expressions
,
1971,
IEEE Transactions on Computers.
[2]
Donald D. Givone,et al.
A Minimization Technique for Multiple-Valued Logic Systems
,
1968,
IEEE Transactions on Computers.
[3]
Emil L. Post.
Introduction to a General Theory of Elementary Propositions
,
1921
.
[4]
Stephen Y. H. Su,et al.
Computer Minimization of Multivalued Switching Functions
,
1972,
IEEE Transactions on Computers.
[5]
Zvonko G. Vranesic,et al.
A Many-Valued Algebra for Switching Systems
,
1970,
IEEE Transactions on Computers.