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.
Keywords :
Algorithm, Boolean, canonical forms, combinational, exclusive or, logic, modulo-2 sum, switching functions.; Boolean functions; Inspection; Algorithm, Boolean, canonical forms, combinational, exclusive or, logic, modulo-2 sum, switching functions.;
