A Tabular Minimization Procedure for Ternary Switching Functions
- 1 August 1966
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-15 (4) , 578-585
- https://doi.org/10.1109/pgec.1966.264380
Abstract
A tabular minimization procedure for ternary switching functions is developed. The theory is analogous to that used in the McCluskey simplification method for Boolean functions. Using the ternary function truth table, the procedure provides a systematic method of applying a limited set of reduction rules in a converging process for obtaining a minimal irredundant form of the function. It is shown how the procedure can be used to derive simplified expressions for arbitrary ternary functions in terms of a particularly attractive system of threshold gating functions. The procedure has more general applications in providing a simple method of finding, for any given function, all binary variables of the function and all variables of which the function is independent.Keywords
This publication has 10 references indexed in Scilit:
- Threshold Synthesis of Ternary Digital SystemsIEEE Transactions on Electronic Computers, 1966
- Hazard Detection in Combinational and Sequential Switching CircuitsIBM Journal of Research and Development, 1965
- Logical Design of Ternary Switching CircuitsIEEE Transactions on Electronic Computers, 1965
- Ternary logic in digital computersPublished by Association for Computing Machinery (ACM) ,1965
- Some Properties of Ternary Threshold LogicIEEE Transactions on Electronic Computers, 1964
- Application of Ternary Algebra to the Study of Static HazardsJournal of the ACM, 1964
- On the analysis and synthesis of three-valued digital systemsPublished by Association for Computing Machinery (ACM) ,1964
- Ternary Threshold LogicIEEE Transactions on Electronic Computers, 1963
- The order code and an interpretative system for the Setun' computerUSSR Computational Mathematics and Mathematical Physics, 1962
- Minimization of Boolean Functions*Bell System Technical Journal, 1956