This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Mod-2 Sums of Products
October 1969 (vol. 18 no. 10)
pp. 957
M.S. Schmookler, Systems Develop. Div. Lab. IBM Corporation
An algorithm is provided for obtaining any Boolean function as a modulo-2 sum of products containing only uncomplemented variables. The proofs, which verify the algorithm and show the uniqueness of the results, are simple and free of special mathematical notation.
Index Terms:
Algorithm, Boolean, canonical forms, combinational, exclusive or, logic, modulo-2 sum, switching functions.
Citation:
M.S. Schmookler, "On Mod-2 Sums of Products," IEEE Transactions on Computers, vol. 18, no. 10, pp. 957, Oct. 1969, doi:10.1109/T-C.1969.222553
Usage of this product signifies your acceptance of the Terms of Use.