Scribd
Upload
44 views

52 Rohan Vishwakarma Extc DSD Exp 4

The document describes an experiment to verify a Boolean function using a K-map. The aim is to simplify the Boolean function F(w,x,y,z)= Σ(0,1,2,4,5,6,8,9,12,13,14) using a 4-variable K-map. The function is then implemented using logic gates and verified with a truth table. The experiment involves simplifying the function using the K-map, drawing the logic diagram, building the circuit, and observing the output for different input combinations to verify the truth table.

Uploaded by

Shashank Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views

52 Rohan Vishwakarma Extc DSD Exp 4

The document describes an experiment to verify a Boolean function using a K-map. The aim is to simplify the Boolean function F(w,x,y,z)= Σ(0,1,2,4,5,6,8,9,12,13,14) using a 4-variable K-map. The function is then implemented using logic gates and verified with a truth table. The experiment involves simplifying the function using the K-map, drawing the logic diagram, building the circuit, and observing the output for different input combinations to verify the truth table.

Uploaded by

Shashank Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Vidyavardhini’s College of Engineering & Technology

Department of Electronics and Telecommunication Engineering

Name-: Yash Aher


Roll No.: 02
Class/Sem- :EXTC Sem-III

EXPERIMENT NO. 04

VERIFICATION OF K-MAP.

Aim: - Simplify the Boolean function F(w, x, y, z) = Σ (0, 1,2,4,5,6,8,9, 12, 13, 14) using
4-variable K-Map, implement it and verify it using truth-table.

APPARATUS REQUIRED:

SL No. COMPONENT SPECIFICATION QTY

1. AND GATE IC 7408 1

2. OR GATE IC 7432 1
3. NOT GATE IC 7404 1

4. NAND GATE 2 I/P IC 7400 1

5. NOR GATE IC 7402 1

6. X-OR GATE IC 7486 1

7. IC TRAINER KIT - 1

THEORY:

The complexity of the digital logic gates that implement a Boolean function is directly
related to the complexity of the algebraic expression from which the function is
implemented. Although the truth table representation of a function is unique, expressed
algebraically, it can appear in many different forms. Boolean functions may be simplified
Vidyavardhini’s College of Engineering & Technology
Department of Electronics and Telecommunication Engineering

by algebraic means. However, this procedure of minimization is awkward because it lacks


specific rules to predict each succeeding step in the manipulative process. The map method
provides a simple straightforward procedure for minimizing Boolean functions. This
method may be regarded either as a pictorial form of a truth table or as an extension of the
Venn diagram. The map method, first proposed by Veitch and modified by Karnaugh, is
also known as the "Veitch diagram" or the "Karnaugh map."
The map is a diagram made up of squares. Each square represents one minterm. Since any
Boolean function can be expressed as a sl1m of minterms, it follows that a Boolean function
is recognized graphically in the map from the area enclosed by those squares whose min
terms are included in the function. In fact, the map presents a visual diagram of all possible
ways a function may be expressed in a standard form. By recognizing various patterns, the
user can derive alternative algebraic expressions for the same function, from which he can
select the simplest one. We shall assume that the simplest algebraic expression is anyone in
a sum of products or product of sums that has a minimum number of literals. (This
expression is not necessarily unique.)
The map for Boolean functions of four binary variables has 16 minterms and the square is
assigned to each. The rows and columns are numbered in a reflected -code sequence, with
only one digit changing value between two adjacent rows or columns. The minterm
corresponding to each square can be obtained from the concatenation of the row number
with the column number. For example, the numbers of the third row (11) and the second
column (01), when concatenated, give the binary number 1101, the binary equivalent of
decimal 13. Thus, the square in the third row and second column represents minterm
m13.

PROCEDURE:

Simplify the given Boolean function using 4-variable K-Map Implement


simplified Boolean function using logic gates.
Verify the gates and make connections as per the logic diagram. Connect Pin-14
of all ICs to +5V and Pin-7 to ground.
Feed the logic 0 (0V) or 1(5V) in different combinations at the inputs w,
x, y, and z according to truth table.
Observe and note down the output readings for F for different
combinations of inputs and verify the truth table for input/output
combination

F(w, x, y, z) = Σ (0,1,2,4,5,6,8,9, 12, 13, 14)


Vidyavardhini’s College of Engineering & Technology
Department of Electronics and Telecommunication Engineering

TRUTH TABLE REPRESENTATION OF THE FUNCTION

w x y z F

0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
Vidyavardhini’s College of Engineering & Technology
Department of Electronics and Telecommunication Engineering

1 1 1 1 0

SIMPLIFICATION USING 4-VARIABLE K-MAP


Vidyavardhini’s College of Engineering & Technology
Department of Electronics and Telecommunication Engineering

Simplified Boolean function F =


Vidyavardhini’s College of Engineering &
Technology
Department of Electronics and Telecommunication
Engineering

LOGIC DIAGRAM OF SIMPLIFIED BOOLEAN

FUNCTION
Vidyavardhini’s College of Engineering &
Technology

Department of Electronics and Telecommunication


Engineering
Vidyavardhini’s College of Engineering &
Technology
Department of Electronics and Telecommunication
Engineering

Output:-
Vidyavardhini’s College of Engineering &
Technology

Department of Electronics and Telecommunication


Engineering
Vidyavardhini’s College of Engineering &
Technology
Department of Electronics and Telecommunication
Engineering

Conclusion:-

You might also like