Name

Reg. #

Marks

Experiment # 4

Implement minimizing logical circuit techniques

Objective:

 Understand and implement Karnaugh map

 Minimizing the digital functions using K map

Equipment:

ICs, Digital trainers, Jumpers wires.

Theory:

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions

without having to use Boolean algebra theorems and equation manipulations. Using a K-map,
expressions with two to four variables are easily minimized. Expressions with five to six variables are
more difficult but achievable, and expressions with seven or more variables are extremely difficult
(if not impossible) to minimize using a K-map.

Minimizing Logical Circuits (Karnaugh maps)

Note: When entering values, please use the following symbols:

FUNCTION SYMBOL
OR ∨, +
AND ·
NOT '
Exercise 1:

Karnaugh map K1

× B’A’ B’A BA BA’

D’C’ 1 0 0 1
D’C 0 0 0 0
DC ]C
0 0 0 0
DC’ 1 0 0 1

Given the Karnaugh map K1 = _______________________________________

Exercise 2:

Karnaugh map K2

× B’A’ B’A
D’C’ 0 1
D’C 1 1
DC 0 1
DC’ 0 1

Given the Karnaugh map K2=_______________________________

Exercise 3:

Table 1
C B A Q
0 0 0 0
0

0 0 1 0
1 Karnaugh map
K3
0 1 0 0
2
× B’A’ B’ BA
0 1 1 1 A
3

1 0 0 0 C’ 1
4
C 1 1
1 0 1 1
5

1 1 0 0
6

1 1 1 1
7

What is the minimized function for the output Q?

_________________________________________________________________________________
_________________________________________________________________________________

Sequence of gates

Circuit diagram of the sequence of gates to be investigated

In this task, we investigate the sequence of gates and attempt to minimize the sequence

Exercise 4:
 Fig. : Experiment set-up, - Sequence of gates

Table
Q3 Q2 Q1 Q0 I4 I3 I2 I1 I0

D C B A Z1 Z2 Z3 Z4 Q

0 0 0 0 0

1 0 0 0 1

2 0 0 1 0

3 0 0 1 1

4 0 1 0 0

5 0 1 0 1

6 0 1 1 0

7 0 1 1 1

8 1 0 0 0

9 1 0 0 1

10 1 0 1 0
 11 1 0 1 1

12 1 1 0 0

13 1 1 0 1

14 1 1 1 0

15 1 1 1 1

Karnaugh map 1
Output: Q

B 0 0 1 1

A 0 1 1 0
0 1
1 1

1 0

0 0

C D

Q What is the minimized function for this sequence of gates?

_________________________________________________________________________________
_________________________________________________________________________________

Exercise 5: Implement the minimized function and complete the following truth table.

Table

D B A Q

0 0 0 0

1 0 0 1
 2 0 1 0

3 0 1 1

4 1 0 0

5 1 0 1

6 1 1 0

7 1 1 1

Exercise 6:

Enter the values for Z4 from Table into Karnaugh map and determine the minimized function for Z4.

Karnaugh map 2
Output: Z4

Note:
The small numerals correspond to the line numbers
from Table 1<. They are intended to make it clearer
where everything belongs.

Q What is the minimized function for Z4?

_________________________________________________________________________________
_________________________________________________________________________________

Enter the values for Z3 from Table into Karnaugh map and determine the minimized function for Z3.

Karnaugh map 3
Output: Z3
 Note:
The small numerals correspond to the line
numbers from Table 1. They are intended to
make it clearer where everything belongs.

Q What is the minimized function for Z3?

_________________________________________________________________________________
_________________________________________________________________________________

Conclusion:

_________________________________________________________________________________

_________________________________________________________________________________

_________________________________________________________________________________

_________________________________________________________________________________

_________________________________________________________________________________