3. Boolean Expressions
3. Boolean Expressions
Max-term
• Individual term of canonical Product of sum (POS) is called
Maxterm.
• Maxterm is a sum of all the literals(with or without bar) within
the Boolean expression.
F = Π A, B, C (1, 4, 6) = (A + B + C) * (A + B’ + C’) * (A + B’ + C’)
Simplification (Minimization) of Boolean
expression
•Two ways to reduce Boolean expression
1. Algebraic
2. 2. Karnaugh Map( K-Map)
(BD + B’D’)
• A Boolean function that has some of the terms as don’t cares, in that case,
the outputs are undefined. we don’t care whether the logic value
produced is 0 or 1.
• In a K-map, consider don't cares as either 1s or 0s, or ignore them
altogether when groups are not forming.