United International University

Department of CSE

Course Code:
Course Name:

Experiment no.
Experiment Name:

Submitted by (Group no.):

Section:
Date of Performance:
Date of Submission:
Objective:
The goal of this report is to simplify a given Boolean function using the Karnaugh Map
(K-Map) method. We will:

1.​ Learn how K-Maps help in simplifying logic expressions.

Apparatus/Instruments used in the Lab:

Theory:
A Karnaugh map (K-map) is a graphical method used to simplify Boolean algebra
expressions. It provides a systematic way to minimize the number of logical operations
required to implement a given Boolean function. K-maps are particularly useful for
simplifying expressions with up to four or five variables, as they allow for easy visualization
of logical relationships and redundancies.

The K-map is a grid of cells, where each cell represents a unique combination of input
𝑛
variables. The number of cells in a K-map is 2 , where 𝑛 is the number of input variables.
For example:
●​ a 2-variable K-map has 4 cells
●​ a 3-variable K-map has 8 cells &
●​ a 4-variable K-map has 16 cells.

Each cell in the K-map corresponds to a minterm (a product term that includes all variables
in the function). The cells are arranged in a way that adjacent cells differ by only one
variable. This adjacency allows for the grouping of cells to identify common terms that can
be factored out, leading to a simplified expression.

The process of simplifying a Boolean expression using a K-map involves the following steps:

1. Construct the K-map: Draw the grid and label the rows and columns with the binary
values of the input variables. Ensure that the labeling follows the Gray code sequence,
where only one bit changes between adjacent cells.
2. Fill the K-map: For each minterm in the Boolean expression, place a '1' in the
corresponding cell. Optionally, place '0's in the remaining cells or leave them blank.

3. Group the '1's: Identify groups of adjacent '1's. Groups can be formed in sizes of 1, 2, 4,
8, etc., and they must be rectangular or square. The goal is to cover all '1's with the fewest
number of the largest possible groups.

4. Derive the simplified expression: For each group, identify the common variables that
remain constant within the group. These variables form the product term for that group. The
simplified Boolean expression is the sum of these product terms.

K-maps are particularly effective for minimizing expressions with a small number of
variables. They provide a visual and intuitive approach to simplification, making it easier to
identify and eliminate redundancies in the logic. However, for expressions with more than
five variables, K-maps become less practical, and other methods such as the
Quine-McCluskey algorithm are often used.

The K-map method is widely used in digital logic design to optimize circuits, reduce the
number of gates, and improve the efficiency of electronic systems.

Problem:
f=Σ(0,1,2,3,4,5,6,7,10,11,12,13)

Solution of the mentioned problems:

Determine the number of variables: The highest minterm is 13, which in binary is 1101.
This indicates we have 4 variables (A, B, C, D).

Construct the K-map: For 4 variables, the K-map will have 16 cells (4 rows and 4 columns).
The rows represent variables A and B, and the columns represent variables C and D. The
cells are arranged in Gray code order to ensure that only one variable changes between
adjacent cells.

Fill the K-map: Place a '1' in each cell corresponding to the minterms listed in the function.
The remaining cells can be filled with '0's or left blank.

K-map:
AB↓ \ CD→ 00 01 11 10

00 1 1 1 1

01 1 1 1 1

11 1 1 0 0

10 0 0 1 1
Fig(1): Simulated diagram of the simplified logic(!A+B!C+!BC) with logic gates from Logisim

Truth Table:

A B C !A !B !C B!C !BC F

0 0 0 1 1 1 0 0 1

0 0 1 1 1 0 0 1 1

0 1 0 1 0 1 1 0 1

0 1 1 1 0 0 0 0 1

1 0 0 0 1 1 0 0 0

1 0 1 0 1 0 0 1 1

1 1 0 0 0 1 1 0 1

1 1 1 0 0 0 0 0 0

1)

Fig(2): Pin diagram of NOT Gate IC- 7404

Fig(3): Pin diagram of AND Gate IC- 7408

3)

Fig(4): Pin diagram of OR Gate IC- 7432

Discussion:
In this experiment, I learned to use Karnaugh maps (K-maps) for simplifying Boolean
expressions and implemented them in Logisim. I practiced creating K-maps for 2, 3, and
4-variable functions, grouping '1's to minimize expressions, and building corresponding logic
circuits. Initially, I faced challenges with correct grouping in 4-variable K-maps and wiring
issues in Logisim, but these were resolved through careful review and testing. This hands-on
experience improved my understanding of K-maps and digital logic design, enhancing my
skills in circuit simulation and debugging.