DocumentCode
1101156
Title
On Mod-2 Sums of Products
Author
Schmookler, M.S.
Issue
10
fYear
1969
Firstpage
957
Lastpage
957
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1969.222553
Filename
1671146
Link To Document