Synthesis of Multiple-Valued Logic Networks Based on Tree-Type Universal Logic Module
- 1 December 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (12) , 1297-1302
- https://doi.org/10.1109/tc.1977.1674797
Abstract
This correspondence presents a theoretical study on the synthesis of multiple-valued logic networks based on tree-type universal logic modules (T-ULM's). The mathematical notation of T-ULM is introduced. On the basis of the mathematical properties, an algorithm for synthesizing an arbitrary logic function of n variables with a smaller number of modules is presented. In this algorithm, only true and constant inputs are allowed at input terminals. The algorithm consists of two parts. The first one is a functional decomposition, and the other one is the proper order of the expansion which is the problem of zinding the most incomplete tree structure. Thus it is established that the systematic and nonexhaustive procedure of the algorithm gives a suboptimal solution for the reduction of the number of T-ULM's.Keywords
This publication has 13 references indexed in Scilit:
- Synthesis of Multiple-Valued Logic Networks Based on Tree-Type Universal Logic ModuleIEEE Transactions on Computers, 1977
- Second order and higher order universal decision elements in $m$-valued logic.Notre Dame Journal of Formal Logic, 1977
- Universal Decision Elements in m‐Valued LogicMathematical Logic Quarterly, 1972
- Generation of near-optimal universal Boolean functionsJournal of Computer and System Sciences, 1970
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Note on the synthesis of ternary combinatorial networks using T gate operatorsElectronics Letters, 1967
- Functional Decomposition and Switching Circuit DesignJournal of the Society for Industrial and Applied Mathematics, 1963
- Synthesis of N-Valued Switching CircuitsIEEE Transactions on Electronic Computers, 1958
- Several-valued combinational switching circuitsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1956
- Conditioned Disjunction as a primitive connective for them-valued Propositional CalculusMathematische Annalen, 1951