Issue No. 10 - October (1969 vol. 18)
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.
Algorithm, Boolean, canonical forms, combinational, exclusive or, logic, modulo-2 sum, switching functions.
M. Schmookler, "On Mod-2 Sums of Products," in IEEE Transactions on Computers, vol. 18, no. , pp. 957, 1969.