A sum of products is a Boolean algebra expression of three levels:
andfunction, or nested
andfunctions, with arguments taken from level 1, or
orfunction, or nested
orfunctions, with arguments taken from level 2, or
This gives us a structure of
or function(s) where the arguments are
and function(s) where the arguments are literals.
Any functions with only one input are replaced by their inputs.
Logicians would say that the sum of products is in disjunctive normal form.
(A and B) or (not(B) and C) or (A and C)
A or B
A and B
Mano, M. Morris, and Kime, Charles R. Logic and Computer Design Fundamentals. 2nd Edition. Prentice Hall, 2000.
Kleitz, W. Digital Microprocessor Fundamentals. 3rd Edition. Prentice Hall, 2000.
Copyright © 2014 Barry Watson. All rights reserved.