On Identification of Redundancy and Symmetry of Switching Functions
- 1 December 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (12) , 1609-1613
- https://doi.org/10.1109/t-c.1971.223183
Abstract
An algorithm for identifying all redundant variables of switching functions and an algorithm for identifying their symmetries (total or partial) are presented. Both algorithms are straightforward and very efficient. These algorithms are based on manipulating the binary and decimal number representations of the minterms of the switching function under testing.Keywords
This publication has 7 references indexed in Scilit:
- On Detecting Total or Partial Symmetry of Switching FunctionsIEEE Transactions on Computers, 1971
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Detection of Totally Symmetric Boolean FunctionsIEEE Transactions on Electronic Computers, 1965
- 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