Islamic University ‫مية‬$‫الجامعة ا&س‬

Faculty of Engineering ‫كلية الهندسة‬

Department of Electrical
Engineering
‫قسم الهندسة الكهربائية‬

EE 3361
DIGITAL LOGIC DESIGN
Semester 443

EXPERIMENT 3
SIMPLIFICATION OF BOOLEAN FUNCTION
LAB REPORT
[CO_5, PI_6_1, SO_6]

Submitted To
Dr. Wajid Hussain

Submitted By
Name, Family Name, Student ID No
 Section No:

April 2, 2023
Page 2 of 11

OBJECTIVES

• To develop the truth table for a combinational logic problem

• To use Karnaugh map to simplify Boolean expressions.
• To draw and simplify sum of products expressions.
• To draw logic diagrams using NAND gates.

EQUIPMENTS AND COMPONENTS

Item Equipment Brand Name Model No Serial No

No
1 Digital Panel herd s20.010.330

2 Connecting Probes and Cables

Record of damage or other comments:
nothing

THEORY

Karnaugh Map provides a systematic method for simplifying Boolean expressions.

Using K-Map is very similar to truth table. K-Map can be used for expressions with two,
three, four or five variables. This method was first proposed by Veitch and later slightly
.”modified by Karnaugh. That is why, it is called “Veitch diagram” or “Karnaugh map
Number of cells in a K-Map is equivalent to the number of possible input variable
combinations (2 ). As an example:
 3
For 3-variables; number of cells are 2 = 8

The cells in K-Map are arranged so that only one single variable changes between adjacent
cells.

:Two-Variable Karnaugh Map

A two-variable Karnaugh Map is shown below:

Figure 3.1
Note that A appears primed in row 0 and unprimed in row 1. Similarly, B appears primed in
column 0 and unprimed in column 1.
The function F=AB is shown in the following fig 4.2. Since AB is equal to m3, therefore 1 is
placed inside the square that belongs to m3.

Figure 3.2 F=AB

 Similarly, the function F = A + B is represented in the following fig. 4.3 by three squares
marked with 1. These squares are found from the minterm of the function
A + B = AB + A’B + AB’ = 11 + 01 + 10 = m3 + m1 + m2 = m1 + m2 + m3
Three squares also determined from the intersection variable A in the second row and variable
B in the second column.

Figure 3.3

:Three-Variable Karnaugh Map

There are 8 minterms for 3 variables. Therefore, a three-variable K-Map consists of eight
squares.
A three-variable Karnaugh Map is shown below

Figure 3.4
Note that the minterms are arranged in a sequence similar to reflection code. The
characteristic of this sequence is that only one bit changes from 1 to 0 or 0 to 1, in the listing
sequence.
The following figure 4.5 shows the relationship between the squares and the three variables:

Figure 3.5
:Four-Variable Karnaugh Map
4
Four variable Karnaugh map contains 2 = 16 squares.
• A four-variable Karnaugh Map is shown below:

m0 m1 m3 m2
m4 m5 m7 m6
m12 m13 m15 m14
m8 m9 m11 m10

Figure 3.6

• The rows and columns in the above K-Map are numbered in a reflected code sequence, with
only one digit changing its value between two adjacent rows or columns.

• The minterm corresponding to each square can be obtained by concatenating the row
number with the column number. For example, the numbers of the third row(i.e. 11) and the
second column (i.e. 01), when concatenated, give the binary number 1101, which is the
binary equivalent of the decimal 13. Thus the square in the third row and second column
represents the minterm m13 i.e. the term wxy’z.

•In four variables, map is considered to lie on a surface with the top and bottom edges as
well as left and right edges touching each other to form adjacent squares. For example, m0
and m2 are adjacent to each other. Similarly m3 and m11 are adjacent to each other

• The larger the number of squares combined, the less the number of literals you will get in
the minimized function.

Example 1:
Simplify the following Boolean function using K-Map.
F = A’BC + A’BC’ + AB’C’ + AB’C
Solution:
Since F = A’BC + A’BC’ + AB’C’ + AB’C
= 011 + 010 + 100 + 101
= m3 + m2 + m4 + m5
= ∑(2, 3, 4, 5)
We shall mark the squares in the three-variable map by 1’s whose minterms are given in the
above function.

• We combine the adjacent 1’s to form two rectangles. Since the upper rectangle lies in the
place where A is primed and B is unprimed, therefore this rectangle represents the area
enclosed by A’B. (Since this rectangle lies in the area of C and C’, therefore they cancel each
other).

• Similarly, the lower rectangle lies in the place where A is unprimed and B is primed,
therefore this rectangle represents the area enclosed by AB’. (Since this rectangle lies in the
area of C and C’, therefore they cancel each other).
So, the simplified Boolean function is F = A’B + AB’

Example 2:
Simplify the following Boolean function using K-Map.
F = X’YZ + XY’Z’ + XYZ + XYZ’
Solution:
Since F = X’YZ + XY’Z’ + XYZ + XYZ’
= 011 + 100 + 111 + 110
= m3 + m4 + m7 + m6
= ∑(3, 4, 6, 7)
We shall mark the squares in the three-variable map by 1’s whose minterms are given in the
above function.

•We combine the adjacent 1’s to form two rectangles. Since the vertical rectangle lies in the
place where Y and Z are unprimed, therefore this rectangle represents the area enclosed by
 YZ. (Since this rectangle lies in the area of X and X’, therefore they cancel each other).

• Similarly, the lower extreme squares lie in the place where X is unprimed and Z is primed,
therefore these squares represent the area enclosed by XZ’. (Since this rectangle lies in the
area of Y and Y’, therefore they cancel each other).
• So, the simplified Boolean function is F = XZ’ + YZ

PART I: BOOLEAN FUNCTIONS

EXPERIMENTAL PROCEDURE AND RECORDS
B
1. Simplify the following Boolean functions by means of Karnaugh maps.

F = A’B’C’ + A’B’C + ABC’ + ABC

-
2. Construct truthtable for above function
3. Draw the logic diagram and verify the truth table

2
Tc A
-

ABC
FB
I + + +

ABCF
=

000 001 110 11I

0 0 0
0 0 1 !

·
0 1 00
0 1 1
1 0 0 !
1 0 1O So, the simplified Boolean function is 7: A+ AB
1 1 00
1 1 1 I

An
B -2
=pr
-
F
I
-
-

En
PART II: CONTROL OF PSEUDO 4-BIT BINARY CODES
EXPERIMENTAL PROCEDURE AND RECORDS Z

At tetrad codes, for example the 8421-BCD-Code, the decimal number is decoded
into a 4-digit binary code. One tetrad can present 16 different possibilities, 10 of them are
required. Pseudo-4-bit binary codes are all combinations, which are not related to a decimal
number.
Design a circuit, which signals “1” at output Q if a pseudo 4-bit binary code is applied at the
inputs (control of pseudo 4-bit binary code).

1. Construct a truth table containing all possible inputs and desired output. Assume that the
desired output for a valid code is a 1, and for an invalid code is 0. Complete the truth table as
shown in Table . A is the most significant bit, and D is the least significant bit.
2. Draw the Karnaugh map, and write the simplified Boolean expression for the valid codes
as sum of products.

i
O O
⑧
i 8
i
O

0 O
0

i
O
0 ⑧

8
⑧
⑧

⑧
0 0

i ⑧

i
0 8

I
8
10

in i o
9
CD
-
AB 00 01 11 10

0 0 C 0
00

⑧
01 0 0 0

19 -1 7

0 I
10 I 1

AB AD AC
+
+
3. Draw the circuit for the above simplified Boolean expression.
4. Using the universal property of the NAND gate connect an equivalent circuit for these
codes that uses only NAND gates.

Y +

Eo-DoDa
---D:
1 t]--
1).
↳

1 - --
- -
RESULT

1. What you studied from this experiment and Explain the result?
_____________________________________________________________________

we learned how to simple boolean expression

_____________________________________________________________________
a

and turn into truth table and Karnaugh

_____________________________________________________________________

map and circuitalso the opposite

_____________________________________________________________________
a

of
that.
_____________________________________________________________________

2. What is K-map? Why is it used?

_____________________________________________________________________

K-mop is a way to simplify the Boolean

_____________________________________________________________________

enperision, and we can drive the Boolean

_____________________________________________________________________

experision from the

truth table.
3. What is a Min term and Max term?
It's for boolean expressions:
_____________________________________________________________________

1. Mintern for Productformat.

_____________________________________________________________________

2. Marketerm for sum format.

_____________________________________________________________________

Page 5 of 10