Page 59 - Handout Digital Electronics
P. 59
Activity
1 Suppose you are given a 3-variable Boolean function to minimize. What technique would you use and
why?
2 Consider the Boolean function:
F (A, B, C) = ABC + ABC + ABC , which technique would you use to simplify and why
3 Compare the algebraic method of solving on solving the above (2) Boolean function with the K map
method and drive own conclusions.
Example 2
Minimize the Boolean function below using the K map method:
F (A, B, C) = ∑(2, 3, 4, 6, 7)
(II) (I)
Looking at group one (I) B has toggled, discard, A is constantly 1, C is constantly o, so part answer is
AC . For group two (II), A has toggled from 0 to 1, discard, C has also toggled from 0 to 1 discard, B is
constantly 1, so part answer is B. The full answer is therefore: F = AC + B
Resources for further exploration:
Morris Mano, Computer systems architecture
Logic Simplification with Karnaugh Maps Retrieved from: www.allaboutcircuits.co/textbook/digital/chpt-8/logic-
simplification-Karnaugh-maps/
Morris Mano & Michael Ciletti, (2013) Digital Design, 5th Edit, Prentice Hall
59
