Transformation of Switching Functions to Completely Symmetric Switching Functions
- 1 June 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-17 (6) , 596-599
- https://doi.org/10.1109/tc.1968.226926
Abstract
Abstract—A number of techniques exist for realizing completely symmetric switching functions.1 Completely symmetric switching functions are particularly simple and economical to realize using contact-type gating elements. This paper shows that any switching function can be transformed to a completely symmetric switching function in which some of the arguments are redundant. (Obviously, if a given function is already completely symmetric no transformation is necessary.) The partial symmetry information inherent in a given function plays an important role in the transformation. Efficient machine-oriented methods exist for detecting the partial symmetries present in a switching function.Keywords
This publication has 5 references indexed in Scilit:
- A Graphical Interpretation of Realization of Symmetric Boolean Functions with Threshold Logic ElementsIEEE Transactions on Electronic Computers, 1965
- Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition ChartsIEEE Transactions on Electronic Computers, 1963
- The Realization of Symmetric Switching Functions with Linear-Input Logical ElementsIEEE Transactions on Electronic Computers, 1961
- Synthesis of Electronic Circuits for Symmetric FunctionsIEEE Transactions on Electronic Computers, 1958
- A symbolic analysis of relay and switching circuitsTransactions of the American Institute of Electrical Engineers, 1938