Professional Documents
Culture Documents
Use The Karnaugh Map Representation To Find A Minimal Sum of Products Expression For The Functionf (A, B, C) Summation (0, 1, 4, 6)
Use The Karnaugh Map Representation To Find A Minimal Sum of Products Expression For The Functionf (A, B, C) Summation (0, 1, 4, 6)
Use The Karnaugh Map Representation To Find A Minimal Sum of Products Expression For The Functionf (A, B, C) Summation (0, 1, 4, 6)
below:
c
/ \
b 1 0
/ \ / \
a 1 1 0 1
0 0 0 -
The Karnaugh map shows that the function f(a, b, c) can be expressed as the sum of the
following two minterms:
● bc
● ac'
Therefore, a minimal sum of products expression for the function f(a, b, c) is:
f(a, b, c) = bc + ac'
This expression can be implemented using a two-input AND gate and a two-input OR gate. The
following circuit diagram shows how to implement the function f(a, b, c):
+-------+
| AND |
+-------+
/ \
b c
| \
+----------+
| OR |
+----------+
/ \
a 1
This circuit will output a 1 if either bc is a 1 or ac' is a 1. This is exactly the definition of the
function f(a, b, c) = summation(0, 1, 4, 6).