LESSON II

Simplification of Boolean functions using Karnaugh mapping

Hans Hofmann emphasized, "The ability to simplify means to eliminate the unnecessary so that the
necessary may speak."

In designing a logic circuits, you need to find expressions with minimum

variables. You can minimize Boolean functions of 3, 4, and 5 variables very easily using
Karnaugh mapping without using any Boolean
algebra theorems. Karnaugh mapping can take
two forms: Sum of product (SOP) or
Product of Sum (POS). You will fill a grid
of the Karnaugh map with 0’s and 1’s then solve
it by making groups.

LEARNING OBJECTIVES
By the time the you finish the lesson, you are expected to:

1. Draw the Karnaugh map for a given Boolean function.

2. Convert function to SOP using Karnaugh mapping.
3. Convert function to POS using Karnaugh mapping.
4. Simplify functions using the Map method.

ENERGIZE YOUR MIND

Recall previous knowledge and skills, then perform the activities

below. Form a group with 5 members each. Discuss your output to the
class.

Activity 1: Simplify the function, F = x’y + y’z’ + xyz’ + y ( xz + z’), using

Boolean algebra. Write your solution and final answer inside the box
provided below.
Activity 2: Determine the cost of the digital circuit, F = ABC + BC’ + ABC’ +
ABD’ + C’D’ + B’, after simplifying the function using Boolean algebra. Assume
that the cost of logic gate is 10 pesos. Write your solution and final answer inside
the box provided below.

NAVIGATE TO THE SOURCE OF NEW KNOWLEDGE AND SKILLS

This lesson is all about complements (Radix and Diminished radix) which are used
by digital systems to simplify subtraction. The complements are also used in
converting signed numbers into binary.

1.1 The Map Method

The Karnaugh map method provides a simple, straightforward procedure for minimizing
Boolean expressions. The K-map minimization procedure obtains a minimal expression
directly from a truth table. The map is a diagram made up of squares containing 1s
and/or 0s. The map presents a visual diagram of all possible ways a function may be
expressed in a standard form. By recognizing various patterns, the user can derive
alternative algebraic expression for the same function.

Two- And Three- Variable Maps

Minimization Procedure

1. Construct a K-map.

2. Find all groups of horizontal or vertical adjacent squares that contain 1.

a. Each group must be either rectangular or square with 2n squares.
b. Each group should be as large as possible.
c. Each 1 on the K-map must be covered at least once. The same 1 can be
included in several groups if necessary.
d. Nonessential groups are omitted. (A nonessential group does not contain a 1
that is not covered by any other group)
e. Adjacency applies to both vertical and horizontal borders.

3. Translate each group into a product term by eliminating any variable whose value
changes from cell to cell.

4. Sum all the product terms.

Note: Don't care conditions can be used to provide further simplification of the
representation of a function.

Two Variable Map

y y
x x
0 1 0 1

0 m0 m1 0 x’y’ x’y

1 m2 m3 1 xy’ xy
From the Karnaugh map there are four minterms for two variables. The 0’s and 1’s
designate the values of variable x and y, respectively. Variable x appears primed in row
0 and unprimed in row 1. Similarly, y appears primed in column 0 and unprimed in
column 1.

A three-variable map

yz yz
00 01 11 10 00 01 11 10
x x

0 m0 m1 m3 m2 0 x’y’z’ x’y’z x’yz x’yz’

1 m4 m5 m7 m6 1 xy’z’ xy’z xyz xyz’

There are 8 minterms for three binary variables (8 squares). The minterms are not
arranged in a binary sequence; however, it is listed similar to Gray code. Variables
appear unprimed in the squares where it is equal to 1 and primed where it is equal to 0.
Any 2 adjacent squares in the map differ by only one variable, which is primed in one
square and unprimed in the other. From the map above, m5 and m7 lie in two adjacent
squares where y is primed in m5 and unprimed in m7.

You simplify the Boolean function F (a, b, c) = Σ (2, 3, 4, 5)

bc

F = a’b + ab ’= a b

There are cases where two cases are considered to be adjacent even though they don’t
touch each other. You simplify the Boolean function F (x, y, z) = Σ (3, 4, 6,7)

The number of adjacent squares that may be combined must always represent a
number that is a power of two such as 1, 2, 4, and 8. As a larger number of adjacent
squares are combined, you obtain a product term with fewer literals.
1. One square represents one minterm, giving a term of three literals.
2. Two adjacent squares represent a term of two literals.
3. Four adjacent squares represent a term of one literal.
4. Eight adjacent squares encompass the entire map and produce a function that
is equal to 1.

You simplify the Boolean function F (a, b, c) = Σ(0, 2, 4, 5, 6)

F = b’ + a’c

You simplify the Boolean function F = A’C + A’B + AB’C + BC

AB
F = C + A’B
F (A, B, C) = ∑ (1, 2, 3, 5, 7)
1.2 SAMPLE PROBLEMS WITH SOLUTION

Simplify the following problems using Karnaugh mapping.

1. F(x, y) = ∑ (0,1,3) 2. F(x, y, z) = ∑ (1,3,5,6,7)

Y YZ

X X

F = x’ + y F = z + xy

3. F(A, B, C) = ∑ (1, 2, 3, 5, 6, 7) 4. F(A, B, C) = ∑ (0, 2, 4, 5)

BC BC

A A

F=C+B F = A’C’ + AB’

5.F(A, B, C) = ∑ (2, 3, 4, 5) 6.F(A, B, C) = ∑ (1, 2, 5, 7)

BC BC

A A

F = A’B + AB’ F = B’C + AC + A’BC’

7.F(A, B, C) = ∑ (1, 2, 3, 6, 7) 8. F(A, B, C) = ∑ (0, 1, 5, 7)

BC BC

A A

F = A’C + B F = A’B’ + AC
9. F(A, B, C, D, E) = ∑ (1, 3, 9, 12, 13, 14, 15, 16, 17, 18, 19, 20, 28, 29, 30, 31)

F = AB’C’ + B’C’E + ACD’E’ + BC + A’BD’E

10. F(A, B, C, D, E) = A’B’C’ + ABCD’ + AB’ + CDE’ + A’D’ + AB’E + D

F = A’ + B’ + C + D
 1.3 DON’T CARE CONDITIONS
o Can be used to simplify functions
o It is presented by the symbol ‘x’  X can be treated as
logic 0 or 1.

Example: Simplify the following functions with don’t care conditions.

a. F (x, y, z) = ∑ (0,1,4)
d (x, y, z) = ∑ (2,6,7)
YZ

X F = z’ + x’y’

b. F (A, B, C, D) = ∑ (0,1,4,5,9)
d (10,13,14,15)

CD

AB

F = A’C’ + C’D

SUMS OF MINTERM

o All product term/s should contain all input variables.

Example:
a. F = ABC + ABC’ + A’B’C’ + ABC’
b. F = A’BCD’ + ABCD + A’B’CD + A’B’C’D’
PRODUCTS OF MAXTERM

o All sum term/s should contain all input variables.

Example:
a. F = (A+B) (A’+B) (A’+B’)
b. F = (X+Y+Z) (X’+Y+Z) (X’+Y’+Z’) (X+Y’+Z’)

SUM OF PRODUCTS
o Product term/s may/not contain all input variables.
Example:
a. F = (x+y’) (x+z’)
b. F = (B+B) (C+D’) (A+C+D’)

Example: Convert the following function to SOP & POS.

a. F(x, y, z)=∑(1,3,5,6,7)

YZ

SOP = xy + z

X POS = (x + z) (y + z)

b. F(A, B, C, D) = ∑ (0, 1, 2, 3, 8, 9, 10, 11, 12, 13)

 CD

AB

POS: F = (A+B’) (A’+B+C’)

SOP: F = A’B + AB + AC’

1.4 LOGIC GATES

The basic building blocks of digital circuits are logic gates. There are eight basic logic
gates.

1. BUFFER 2. INVERTER

3. AND GATE 4. OR GATE

5. NAND 6. NOR

7. EXCLUSIVE OR (XOR) 8. EXCLUSIVE NOR (XNOR)

1.5 UNIVERSAL GATES
- these can replace the function of the basic gates.

NAND and NOR gates are generally faster and use fewer components than AND or OR
gates. • Any logic function can be implemented using only NAND gates or only NOR
gates. Î NAND gate or NOR gate forms a functionally complete set since any switching
function can be expressed in terms of NAND gate or NOR gate.

NAND IMPLEMENTATION
NOR IMPLEMENTATION
 GATHER AND APPLY INTEGRATED KNOWLEDGE AND SKILLS

Now that you learned about the types of complements, form a group with a
maximum of five(5) members then solve the following questions applying your
new knowledge and skills. Discuss your output in the class.

Application 1: Simplify the function f = a + b where a = x + y’ z + xz and

b = z ( x+y’) + xyz’ + yz’. Use the map method in deriving the simplified
function. Show your solution and answer below.

Application 2: Implement the logic circuit shown below using NAND

gates only. Prove that the circuit implemented with NAND gates is cheaper
than the original logic circuit. Draw your circuit inside the box provided
below this item.
 GUAGE INTEGRATED NEW KNOWLEDGE AND
SKILLS

Engage in the following exercises to assess your comprehension and ensure a

thorough understanding of the lesson.

Exercises: Solve the following problems and write your

solution in the blank spaces provided.
QUIZ: Multiple Choice
Simplify the Boolean function using K-map.

1.

a.) F = A + B
b.) F = A’ + B
c.) F = B’ + A’
d.) F = B’ + A

2.

a.) F = A’B
b.) F = B’C + A’
c.) F = AC
d.) F = A’ + B

3.

a.) F = A’C + AB’

 b.) F = BC’ + A’B’C’ + AB
c.) F = A + B + C’
d.) F = A’C’ + AB
4.

a.) F = A’BC’
b.) F = BC’
c.) F = B + C’
d.) F = A’B + BC’

5.

a.) F = AC’
b.) F = AB + AB’
c.) F = B’C’
d.) F = A + C’

6.

a.) F = C’ + A’B + BC
b.) F = A’ + B’C + AB
c.) F = ABC’ + B’C + A’B’
d.) F = A’B’C + BC’ + AB
7.

a.) F = A’B’C’ + A’C

b.) F = BC + A’B’
c.) F = A’C + ABC
d.) F = A’B’ + A’C + BC

8.

a.) F = A’C’D’ + A’C’D + AB’CD’

b.) F = A’B’C’ + A’BC’ + ABC
c.) F = A’C’ + B’C’D
d.) F = A’C’ + AB’C’D

9.
 F = AD’ + AB’C’ + A’B’CD’
F = A’B’C’D’ + A’B’CD’ + A’B
F = AB’ + A’B’ + C
F = B’D’ + AB’
10 – 15. Using K-map simplify the Boolean functions with don’t care condition.

10.

a.) F = C’D’ + AB
b.) F = BC’ + AB
c.) F = BC’D’ + AD’
d.) F = AB’ + AB

11.
a.) F = C’D’ + B’D
b.) F = A’B’ + C’D + A’D
c.) F = C’D + A’D
d.) F = B’ + CD’ + A’D + A’B’

12.

a.) F = C’D’ + AD’ + ABC’

b.) F = C’D’ + ABC’ + ABCD’
c.) F = A’B’C + AB’C + C’D’ + ABC’
d.) F = A’B’C + AB’C + C’D’ + ABC’ + ABCD’
13.

a.) F = A’C’D + A’B

b.) F = A’B + A’C’
c.) F = BC’ + A’D
d.) F = A’B + A’C’ + BC’

14.

a.) F = A’B + C’D + BC

b.) F = A’B’C’D’ + A’B’C’ + AB’
c.) F = AB’ + CD’ + B’C’
d.) F = AB’ + CD’ + A’B’C’

15.

F = A’B + BC’ + BD F =
A’B + A’CD’ + BC’D’
F = A’B + BD + ABD
F = A’D’ + A’B + BD + ABD
16 – 18. Convert the Boolean functions to SOP & POS.

16.
a.) SOP: F = ACD + B’ POS: F = (A’+D’) (B’+D’)
b.) SOP: F = A’C’D’ + B POS: F = (A+D) (B+D)
c.) SOP: F = AD + BD POS: F = (A’+C’+D’) (B)
d.) SOP: F = A’D’ + B’D’ POS: F = (A+C+D) (B’)

17.

a.) SOP: F = B POS: F = B

b.) SOP: F = B’ POS: F = B
c.) SOP: F = B’ POS: F = B’
d.) SOP: F = B POS: F = B’

18.
a.) SOP: F = A’B’ + D’ POS: F = (A’+D’) (B’+D’)
b.) SOP: F = A’D’ + B’D' POS: F = (A’+B’) (D’)
c.) SOP: F = AD +BD POS: F = (A+B) (D)
d.) SOP: F = AB + D POS: F = (A+D) (B+D)
19 – 20. Simplify the Boolean functions using a five-variable K-map.

19.

a.) F = ABCE + B’C’DE + A’BD’E + B’C’E + ACD + ACE’ + BD’

b.) F = ABC’E’ + BCD’E’ + AB’DE’ + BCE + A’C’D’ + AC’E + BD
c.) F = A’B’C’E’ + BCD’E’ + ABD’E’ + B’CE + A’CD + ACE + B’D
d.) F = ABCE + BCDE + ABDE + BCE + ACD + A’C’E’ + B’D’

20.

a.) D + C’
b.) D’ + C
c.) D
d.) D’