Scribd
Upload
12 views

WS5 ..pdf

Uploaded by

Frost BiteTV
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

WS5 ..pdf

Uploaded by

Frost BiteTV
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Karnaugh Mapping

Procedure 1.
Write the simplified sum-of-products (SOP) logic expression for the K-Maps shown below.

F1 = ?
F1(A,B) = Σ(0,2)
F1 = B’

F2 = ?
F2(A,B,C) = Σ(1,4,6,7)
F2 = AC’ + AB + A’B’C

F3 = ?
F2(A,B,C,D) = Σ(2,3,4,5,6,7,8,9)
F3 = A’B + A’C + AB’C’
After transferring the truth table data into the K-Maps, write the simplified sum-of-products
(SOP) logic expression for the K-Maps shown below.

F1 = ?
F1(Q,R) = Σ(2,3)
F1 = Q

F1 = ?
F1(Q,R,S) = Σ(1,2,5,6)
F1 = RS’ + R’S
F3 = ?
F3(Q,R,S,T) = Σ(5,6,7,8,9,10,13,15)
F3 = RT + T’QR’ + Q’RS + QS’T
After labeling the K-Map and transferring the truth table data into it, write the simplified sum-
of-products (SOP) logic expression for the K-Maps shown below.

F1 = ?
F1(Q,R,S,T) = Σ(1,2,3)
F1 = X + W

F2 = ?
F2(W,X,Y) = Σ(0,1,2,4,6,7)
F2 = Y’ + W’X’ + WX
After labeling the K-Map and transferring the truth table data into it, write the simplified sum-
of-products (SOP) logic expression for the K-Maps shown below.

F3 = ?
F3(W,X,Y,Z) = Σ(0,1,5,6,9,10,13)
F3 = Y’Z + Y’W’X’ + W’XYZ’ + WX’YZ’
Write the simplified sum-of-products (SOP) logic expression for the K-Maps shown below. Be
sure to take advantage of any don’t care conditions.

F1 = ?
F1(A,B) = Σ(1,2) + d(0)
F1 = B’ + A’

F2 = ?
F2(A,B,C) = Σ(2,6,7) + d(3,4)
F2 = B
F3 = ?
F3(A,B,C,D) = Σ(1,4,5,6,10,12) + d(7,9,11)
F3 = BC’D’ + A’B + B’C’D + AB’C

Conclusion

1. Give three advantages of using K-mapping to simplify logic expressions over Boolean
algebra.

Reduced Complexity:
K-maps let you visualize all possible output combinations in a grid, making it easier to
handle multiple variables without getting overwhelmed, unlike Boolean algebra which can
get complicated with many variables.

Quick Simplification:
K-maps make it easy to group terms visually, helping you quickly simplify expressions,
whereas Boolean algebra requires more steps and rule applications to simplify.

Easier Error Detection:


The visual nature of K-maps allows you to easily spot errors, like ungrouped 1s, which can
lead to mistakes. In Boolean algebra, it’s harder to catch such errors since you rely on
algebraic manipulation.
2. The three variable K-maps shown below can be completed with three groups of two. The two
groups shown (cells #1 & #3; cells #4 & #6) are required. The third group, needed to cover the
one in cell #2, could be cells #2 & #3 or cells #2 & #6.

Write the two possible logic expressions for the function F1.

These logic expressions are considered to be equivalent (not equal). Explain what this
means.

These two expressions are fundamentally the same because they give the same results, even
though they look different. However, since their structures are not the same, they are not
considered equal. This shows the difference between being equivalent and being equal in
math.
Going Further

The following four variable K-Maps can be solved using the traditional method of grouping the
ones (Identify the 3 groups of 8).

F1 = ?
F1(A,B,C,D) = Σ(0,1,2,3,4,6,7,8,9,10,11,12,14,15)
F1 = C + B’ + D’

Rather than taking this approach, let’s get creative and take advantage of the fact that the K-Map
contains only two zeros. Group these zeros and write the logic expression. Since you grouped the
zeroes, this is the logic expression for F’1. Now apply De Morgan’s Theorem to get the logic
expression for F1 .

F’₁ = C + B’ + D’
F₁ = C’BD
What is the advantage of taking this approach over the traditional approach of circling
the ones?

Focusing on zeros instead of circling ones simplifies the process when the K-map is mostly filled
with 0s. This method results in fewer loops and groupings, making it easier to identify the
conditions where the function is false. Overall, it streamlines the process and leads to a more
efficient derivation of the logic expression.
Are there any disadvantages?

Focusing on zeros in a K-map has some drawbacks. With few zeros, it can be difficult to form
useful groups, making the logic expression more complex. In larger K-maps, only considering
zeros may not yield clear results and could overlook important relationships among the 1s. Also,
working with complements can be less intuitive for those used to thinking about the function’s true
states.

You might also like