This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
Index Terms?Combinational logic, completely symmetric switching functions, switching theory, synthesis of switching functions, transformation of switching functions, use of partial symmetry information.
Citation:
R.C. Born, A.K. Scidmore, "Transformation of Switching Functions to Completely Symmetric Switching Functions," IEEE Transactions on Computers, vol. 17, no. 6, pp. 596-599, June 1968, doi:10.1109/TC.1968.226926
Usage of this product signifies your acceptance of the Terms of Use.