General Synthesis of Tributary Switching Networks
- 1 October 1963
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-12 (5) , 464-469
- https://doi.org/10.1109/pgec.1963.263627
Abstract
A synthesis procedure is described which generates all tributary networks (TRIBs) realizing a given truth function when no a priori assignment of the variables to input terminals is specified. If the truth function is not known to be realizable by a TRIB structure, the synthesis procedure provides a convenient test for TRIB realizability. If the variables are preassigned to input terminals, the synthesis and test are still applicable and correspondingly shorter. A major tool of the procedure is the matrix of binary representations of the minterms of the truth function-the so called ``minterm matrix.'' The procedure is illustrated by a numerical example.Keywords
This publication has 6 references indexed in Scilit:
- Cascaded Switching Networks of Two-Input Flexible CellsIEEE Transactions on Electronic Computers, 1962
- Logic Matrices and the Truth Function ProblemJournal of the ACM, 1959
- Analysis of Bilateral Iterative NetworksIRE Transactions on Circuit Theory, 1959
- The Detection and Identification of Symmetric Switching Functions with the Use of Tables of CombinationsIEEE Transactions on Electronic Computers, 1956
- Detection of Group Invariance or Total Symmetry of a Boolean Function*Bell System Technical Journal, 1956
- On The Number of Symmetry Types of Boolean Functions of n VariablesCanadian Journal of Mathematics, 1953