Digital Logic Design

(EL-227)
LABORATORY MANUAL
FALL 2016

(LAB # 4)
Boolean Function Simplification using K-map
Engr. Jawad-ul Haq
Engr. Maria Nasir
Student Name: ___________________________

Roll No: _____________ Section: ___________

Date performed: _____________________, 2016

___________________________

LAB ENGINEER SIGNATURE & DATE

MARKS AWARDED: /10

_____________________________________________________________________________________________________________________________________________

NATIONAL UNIVERSITY OF COMPUTER AND EMERGING SCIENCES, ISLAMABAD

Prepared by: Engr. Maria Nasir Version: 2.1
Last Edited by: Engr. Maria Nasir Updated: Fall 2016
Verified by: Dr. Jamshed Iqbal
 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

LAB: 04 Boolean Function Simplification using K-map

Objectives of the Exercise:
a) To become familiar with two standard forms of logic functions: SOP and POS
b) To become familiar that how a Boolean function can be minimized with the k-map
and then can be expressed in gates.
Equipment Required:
 Trainer Board (DEV-2765E)
 Logic Probe
 Digital Multimeter
 NOT (Inverter) gate IC (Hex 1-input, IC # 7404)
 AND gate IC (Quad 2-input, IC # 7408)
 OR gate IC (Quad 2-input, IC # 7432)

Introduction:
When a Boolean expression is implemented with logic gates, each term requires a gate,
and each variable within the term designates an input to the gate. We define a literal as a single
variable within the term that may or may not be complemented. By reducing the number of
terms, the number of literals, or both in a Boolean expression, it is often possible to obtain a
simpler circuit. Boolean algebra or K-map is applied to reduce an expression for the purpose
of obtaining a simpler circuit.
A Boolean function can be written in a variety of ways when expressed algebraically.
There are, however, a few ways of writing algebraic expressions that are considered to be
standard forms. The standard forms facilitate the simplification procedures for Boolean
expressions and frequently result in more desirable logic circuits.
The standard forms contain product terms and sum terms. An example of a product
term is XYZ. This is a logical product consisting of an AND operation among three literals.
An example of a sum term is X+Y+Z. This is a logical sum consisting of OR operation among
the literals.
In the sum of minterms canonical form, ‘Sum Of Products (SOP)’, every product term
includes a literal of every variable of the function. Product terms of the SOP form which do
not include a literal of a variable, say variable B, should be augmented by,
 AND-ing the product term which misses a literal of B with (𝐁 + 𝐁 ′ ),
 Subsequently applying the distributive property to eliminate the parenthesis.
In the product of maxterms canonical form, ‘Product Of Sums (POS)’, every sum term
includes a literal of every variable of the function. Sum terms of the POS form which do not
include a literal of a variable, say variable B, ought to be augmented by,
 OR-ing the sum term with (𝐁. 𝐁 ′ ),
 Subsequently applying postulate 𝑎 + 𝑏. 𝑐 = (𝑎 + 𝑏). (𝑎 + 𝑐) to distribute the
product (𝐁. 𝐁 ′ ).

DLD LAB NUCES, ISLAMABAD Page 2 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

Lab Tasks:
Task 1: For the following given Boolean expressions:
𝑭𝟏 = 𝑨′ 𝑩′ + 𝑨′ 𝑩 + 𝑨𝑩
i. Complete the truth table for fuction F1:
Output
Inputs Intermediate terms
Calculated Observed

A B 𝑨′𝑩′ 𝑨′𝑩 𝑨𝑩 𝑭𝟏

′ ′ ′
Table 2.2: Truth table for 𝑭𝟏 = 𝑨 𝑩 + 𝑨 𝑩 + 𝑨𝑩

ii. Draw the logic circuit for 𝑭𝟏 = 𝑨′ 𝑩′ + 𝑨′ 𝑩 + 𝑨𝑩:

iii. Implement the logic circuit of F1 on bread board and verify and note the
ouput in the ‘Observed’ column of the truth table.

DLD LAB NUCES, ISLAMABAD Page 3 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

Task 2:
A function F2 is defined by
𝑭𝟐 (𝑨, 𝑩) = ∑(𝟎, 𝟏, 𝟑)
Steps to Implement the Function:
i. Write the truth table for the function given above.
ii. Fill the k-map cells from the truth table
iii. Simplify and minimize the function with k-map.
iv. Write the simplified function from k-map.
v. Draw the circuit diagram and construct the circuit on the Trainer Board.

i. Truth Table:

Inputs Output

A B F2

ii. K-Map:

iii. Simplified Boolean Expression:

DLD LAB NUCES, ISLAMABAD Page 4 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

iv. Circuit Diagram

Task 3:
A function F3 is defined by
𝑭𝟑 (𝑨, 𝑩, 𝑪) = ∑(𝟐, 𝟑, 𝟒, 𝟔, 𝟕)

i. Truth Table:

DLD LAB NUCES, ISLAMABAD Page 5 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

ii. K-Map:

iii. Simplified Boolean Expression:

iv. Circuit Diagram

v. Compare and comment on the results of F1 and F2:

DLD LAB NUCES, ISLAMABAD Page 6 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

Task 4:
A function F4 is defined by
𝑭𝟒 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟐, 𝟓, 𝟖, 𝟏𝟎, 𝟏𝟒, 𝟏𝟓)

i. Truth Table:

ii. K-Map:

DLD LAB NUCES, ISLAMABAD Page 7 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

iii. Simplified Boolean Expression:

iv. Circuit Diagram

DLD LAB NUCES, ISLAMABAD Page 8 of 9

 Digital Logic National University Roll No: __________

Lab #
Design
(EL-227)
of Computer and Emerging Sciences
Islamabad Fall 2016
04
_________________________________________________________________________________

Student's feedback: Purpose of feedback is to know the strengths and weaknesses of the
system for future improvements. This feedback is for the 'current lab session'. Circle your
choice:
[-3 = Extremely Poor, -2 = Very Poor, -1 = Poor, 0 = Average, 1 = Good, 2 = Very Good, 3 =
Excellent]:
The following table should describe your experience with:
S# Field Rating Describe your experience in words
1 Overall Session -3 -2 -1 0 1 2 3
2 Lab Instructor -3 -2 -1 0 1 2 3
3 Lab Staff -3 -2 -1 0 1 2 3
4 Equipment -3 -2 -1 0 1 2 3
5 Atmosphere -3 -2 -1 0 1 2 3

Any other valuable feedback:

__________________________________________________________________________
__________________________________________________________________________
__________________________________________________________________________

Student's Signature: _________________________________

AWARDED

Correctness

Conclusion
Originality
of results

Initiative
Neatness
MARKS

Attitude

TOTAL

TOTAL 10 10 10 20 20 30 100

EARNED

Lab Instructor's
Comments:_________________________________________________________________
__________________________________________________________________________
__________________________________________________________________________

Lab Instructor's Signature: ________________________

DLD LAB NUCES, ISLAMABAD Page 9 of 9