LAB NUMBER 5

 TITLE
 Simplification of Boolean function using K-Map
 OBJECTIVES
 To use K-map for simplification of Boolean functions.
 To draw and simplify (SOP) sum of products equations.
 COMPONENTS
 Bread board
 Digital trainer
 Leads
 LS7420
 LS7414
 LS7410
 LS7400
 INTRODUCTION
A Boolean function is an algebraic expression with variables that represent the binary values 0
and 1. Karnaugh or K-Maps are used to simplify and minimize the number of logical operations
required to implement a Boolean function. The implementation of the function may be in the
form of digital electronic hardware or software statements.
 PROCEDURE
A K-map shows the value of a function for every combination of input values just like a truth
table, but a K-map spatially arranges the values so it is easy to find common terms that can be
factored out. The image below shows the form of a 2,3 and 4 variable K-map.
 RESULTS
 F1 (A,B,C,D)=∑m (0, 1, 4, 5, 8, 9, 10, 12, 13)

 F2 (A,B,C,D)=∑m (3, 5, 7, 8, 10, 11, 13, 15)

 CONCLUSIONS
In this lab we have learnt simplification of Boolean expression using k-map, also learnt how to
draw simple sop expression that is sum of products
 REFRENCE
 www.googleimages.com
 www.wikipedia.com