The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1969 vol.18)
pp: 957
M.S. Schmookler , Systems Develop. Div. Lab. IBM Corporation
ABSTRACT
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, October 1969, doi:10.1109/T-C.1969.222553
13 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool