Scribd
Upload
63 views

Lab No. 6: Understanding The Simplification by Boolean Algebra, Truth Table and Karnaugh Map

This document describes an experiment to implement Boolean logic circuits using gates. The objectives are to build circuits on a breadboard and in Proteus. The procedure involves making truth tables, block diagrams, and implementing the circuits in Proteus and on hardware. Boolean algebra and Karnaugh maps are used to simplify circuits. The results show that the simplified circuits satisfy the truth tables when implemented on the breadboard and in Proteus.

Uploaded by

Inam Ur Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
63 views

Lab No. 6: Understanding The Simplification by Boolean Algebra, Truth Table and Karnaugh Map

This document describes an experiment to implement Boolean logic circuits using gates. The objectives are to build circuits on a breadboard and in Proteus. The procedure involves making truth tables, block diagrams, and implementing the circuits in Proteus and on hardware. Boolean algebra and Karnaugh maps are used to simplify circuits. The results show that the simplified circuits satisfy the truth tables when implemented on the breadboard and in Proteus.

Uploaded by

Inam Ur Rehman
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Lab No.

Understanding the simplification by Boolean Algebra,


Truth Table and Karnaugh map
Objectives:
1. Learning how to implement a circuit consisting of gates on breadboard.
2. Working on Proteus.
3. Learning the implementation of Boolean algebra and Karnaugh maps.

Equipment:
1. Trainer.
2. Connecting wires.
3. Power Supply.
4. ICs (AND, OR, NOT).

Introduction:
We have been provided with two Boolean functions and by using basic gates which
are AND, OR and NOT, we have to implement them. We will start with doing theoretical
calculations (truth tables) then, we will patch circuit according to the given function and
match its output with the truth table which we have made according to our theoretical
calculations.

Procedure:
At first, we make a truth table of the given circuit. Then we make a block diagram
of the circuit and then apply it on Proteus. Then we check the truth table we made and
verify it through the Proteus. After doing all this and confirming that the circuit we have
made is correct then we use the gates and apply it on hardware.

Theoretical:
First, we have to make a truth table for the given Boolean function.

F = ABCD+ABC’D+AB’C’D+AB’C’D’+A’BCD+A’BCD’
A B C D F
0 0 0 0

0 0 0 1

0 0 1 0

0 0 1 1

0 1 0 0

0 1 0 1

0 1 1 0

0 1 1 1

1 0 0 0

1 0 0 1

1 0 1 0

1 0 1 1

1 1 0 0

1 1 0 1

1 1 1 0

1 1 1

Table 1: Truth table (ABCD+ABC’D+AB’C’D+AB’C’D’+A’BCD+A’BCD’)

We make this large Boolean expression into small one by using karnaugh map. Here is its
implementation.

AB/CD 00 01 11 10
00
01 1 1
11 1 1
10 1 1

Table 2: Karnaugh Mapping


Now the function F reduces to

F2=ABD+AB’C’+A’BC

Practical:
We used the required gates to perform the task which contains AND (7408) and
(7411), OR (7432) and NOT (7404) Gates. The picture below is taken after the circuit was
completely implemented.

Figure 1

Step 1: Place 7404, 7408 and 7432 IC’s on


breadboard.
Step 2: Give all the IC’s +5V DC supply and
ground.
Step 3: Connect the wire according to the
diagram.
Step 4: Give inputs according to truth tables.
Step 5: Record the outputs and then match them with truth
table.
Step 6: After verifying all the circuits’ un-patch it.

Schematic:
Step 1: Select all the components from the list which you want to use.
Step 2: Click on the component and place them on the schematic in orderly
manner.

Step 3: Make the connection according to the circuit diagram you are provided
With.
Step 4: Make sure you have made all connections right.
Step 5: Give the source DC and place ground.

We implemented the Boolean algebra and Karnaugh Maps to solve the given circuits
and then we implemented that solved circuit on Proteus. Given below are its pictures.

F2=ABD+AB’C’+A’BC

Figure 2

Observations & Conclusion: -


After implementing the given circuits (the simplified circuit using Boolean algebra) on
the Breadboard, we observed that the circuits satisfied the truth tables we made and
behaved exactly how we anticipated.
1. The circuit we had to implement in this lab consisted of AND, OR and NOT gates.
2. We used NOT gate, OR gate and two types of AND gates i.e. (2I/O and 3I/O) in
total for these circuits.
3. From this lab we can confirm that we can use Boolean algebra and Karnaugh Maps
to make our circuit compact and easy and it will still give the same results when
applied.

You might also like