0% found this document useful (0 votes)
39 views

EX7 Report

This document describes an experiment using Karnaugh maps to design Boolean functions. The objective was to learn how to design Boolean functions using Karnaugh maps. Three Boolean functions were simplified using Karnaugh maps and implemented in logic circuits using gates like AND, OR, and XOR. The circuits were simulated and the results matched the truth tables, verifying the correct implementation of the Boolean functions. In conclusion, the experiment demonstrated how to use Karnaugh maps to simplify Boolean functions and reduce the number of gates needed to implement them in logic circuits.

Uploaded by

sedeq Alsakkf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views

EX7 Report

This document describes an experiment using Karnaugh maps to design Boolean functions. The objective was to learn how to design Boolean functions using Karnaugh maps. Three Boolean functions were simplified using Karnaugh maps and implemented in logic circuits using gates like AND, OR, and XOR. The circuits were simulated and the results matched the truth tables, verifying the correct implementation of the Boolean functions. In conclusion, the experiment demonstrated how to use Karnaugh maps to simplify Boolean functions and reduce the number of gates needed to implement them in logic circuits.

Uploaded by

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

Electrical and Electronics Engineering Department

Işık University

ELEC1402 LOGIC DESIGN LABORATORY


EXPERIMENT REPORT

Experiment 7: KARNOUGH MAPS.

LINA, AL-WHAIDI, 219SE2031

SEDEQ, AL SAKKAF, 219MC2007


Objective:

The purpose of this experiment is to learn how to design any Boolean function by
using Karnaugh maps.

Components:

 C.A.D.E.T breadboard
 1x74LS04 Hex Inverter Gate
 1x74LS08 Quad 2-Input AND Gate
 1x74LS32 Quad 2-Input OR Gate
 1x74LS86 Quad 2-Input EXOR Gate
 Jumper Wir

Experimental Procedure:
By using Karnaugh Map method we wrote the simplified Boolean function in
sum-of-products and drew it.
The Simplified Boolean Expression: The logic circuit:
F= A’B+BD+A’CD’

We Setup the logic circuit and connected A to Inverter gate and its output as the
first input in the first AND gate and B as second input and connected its output as
the first input in the first OR gate, for the second AND gate the first input was
connected to B and the second was connected to D and connected its output as a
second input in the first OR gate, and connected OR gate output as the first input in
the second OR gate, then we connected the third AND gate with A’ and C and
connected its output as the first input in the fourth AND gate, we connected D to
Inverter gate and its output as the second input in the fourth AND gate and
connected its output as the second input in the second OR gate ,then connected the
output with LED.
We simplified the Boolean expression and drew it.

The Boolean Expression: The logic circuit:


F = x 1 ' x 2 ' x3 + x 1 ' x 2 x3 '+ x 1 x2 x 3+ x 1 x 2 ' x 3 ' =
'
x 1 (x 2 ' x 3)+(x 2 x 3)+ x 1 (x 2 x 3 )+(x 2 ' x 3 ' ) =
x 1 ' (x 2+ x 3 )+ x1 (x 2 + x 3)'
'
F=x 1 ' A+ x 1 A =x 1+ x2 + x 3
We Setup the logic circuit using only XOR gates, we connected x 1 and x 2 as inputs
for the first XOR gate and connected its output as the first input in the second XOR
gate, we connected D as the second input in the second XOR gate, and connected
the output with LED.

We simplified the Boolean function in sum-of-products and drew it.


The Boolean Expression: The logic circuit:
F= A’C+BD+BC

We Setup the logic circuit and connected A to Inverter gate and its output as the
first input in the first AND gate and C as second input and connected its output as
the first input in the first OR gate, for the second AND gate the first input was
connected to D and the second was connected to B and connected its output as a
second input in the first OR gate, and connected OR gate output as the first input in
the second OR gate, then we connected the third AND gate with B and C and
connected its output as the first input in the second OR gate, then connected the
output with LED.
Simulation:
aii Circuit:

bi Circuit:
ei Circuit:

Discussion and Conclusion:

In conclusion, in the experiment we learned how to design the Boolean


function by using Karnaugh maps. We simplified the Boolean function that has
been given in SOP form using four variable Karnaugh Map.
F=A’B+BD+A’CD’. We drew and constructed the Boolean function, checked the
results by entered the inputs values of the truth table. We verified the results by
setting the logic circuit in simulation to get the same results. We designed another
Boolean function from a given a Karnaugh map that has three variable x1, x2, x3.
We got a Boolean function, simplified, and drew it. This circuit has only two XOR
gates. F = X’1A + X1A’ = X1+ X2 +X3. We constructed the circuit and entered
the inputs values to get the correct outputs. By using the simulation, we verified
the logic circuit to obtain the same results in the laboratory. Finally, we simplified
the Boolean function in SOP form, the Karnaugh map is given. It has four
variables ABCD. The simplified function: F = A’C + BD + BC. We drew and
constructed the logic circuit which contained of three AND gates and two OR
gates. We checked the results by implementing the inputs values from the cells.
We verified our results by using the simulation to get the same results. By using
Karnaugh maps we can simplify and reduce the number of gates in the logic
circuit.

You might also like