This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization of Exclusive or and Logical Equivalence Switching Circuits
February 1970 (vol. 19 no. 2)
pp. 132-140
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In particular, algorithms are presented for obtaining minimal modulo 2 or complement modulo 2 sum-of- products (or sums) expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables.
Index Terms:
APL, cellular logic arrays, maximal cliques of a graph, miniimization algorithms, modulo 2 sum-of- products (or sums), Reed-Muller canonic forms.
Citation:
A. Mukhopadhyay, G. Schmitz, "Minimization of Exclusive or and Logical Equivalence Switching Circuits," IEEE Transactions on Computers, vol. 19, no. 2, pp. 132-140, Feb. 1970, doi:10.1109/T-C.1970.222878
Usage of this product signifies your acceptance of the Terms of Use.