Scribd
Upload
9 views

DLD Lab Manual 4-1

The lab manual outlines an experiment focused on realizing and implementing a Boolean function using basic and universal gates. It includes objectives such as simplifying Boolean expressions and building corresponding logic circuits based on provided truth tables. The manual also details required components, procedures for circuit assembly, and tasks for verification using a lab trainer and simulation software.

Uploaded by

TECNICAL GURU
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

DLD Lab Manual 4-1

The lab manual outlines an experiment focused on realizing and implementing a Boolean function using basic and universal gates. It includes objectives such as simplifying Boolean expressions and building corresponding logic circuits based on provided truth tables. The manual also details required components, procedures for circuit assembly, and tasks for verification using a lab trainer and simulation software.

Uploaded by

TECNICAL GURU
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DIGITAL LOGIC DESIGN – LAB MANUAL

Lab Experiment No. 4


Realization and Implementation of a Boolean Function using
Gates
Objectives:
Ø To simplify the given expression and to realize it using Basic gates and Universal gates
Ø To simplify the Boolean expression and to build the logic circuit.
Ø Given a Truth table to derive the Boolean expressions and build the logic circuit to
realize it.

Components Required:

IC 7400, IC 7408, IC 7432, IC 7406, IC 7402, Patch Cords & IC Trainer Kit.

Introduction:

Canonical Forms (Normal Forms): Any Boolean function can be written in disjunctive normal
form (sum of min-terms) or conjunctive normal form (product of max-terms).

A Boolean function can be represented by a Karnaugh map in which each cell corresponds to
a minterm. The cells are arranged in such a way that any two immediately adjacent cells
correspond to two minterms of distance 1. There is more than one way to construct a map with
this property.

Karnaugh Maps:

For a function of two variables, say, f (x, y)

For a function of three variables, say, f (x, y, z)

For a function of four variables: f (w, x, y, z)

17 | P a g e
DIGITAL LOGIC DESIGN – LAB MANUAL

Realization of Boolean Expression:

Truth Table:

INPUTS OUTPUT Sum of min-terms:


A B C D
0 0 0 1 0 = �̅ + �̅ +� ̅ +� ̅ +�
0 0 1 0 1 +� +�
0 0 1 1 0
Reducing Equation Using K-Map, we have,
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1 = � +
1 1 1 1 0

Implementation of a Circuit Diagram:

(a) Using Basic Gate

(b) Using NAND Gate

18 | P a g e
DIGITAL LOGIC DESIGN – LAB MANUAL

(c) Using NOR Gate

Procedure:

To make the above shown circuit, follow the steps below:

Ø Check the components for their working. Insert the appropriate IC into the IC base.
Ø Make connections as shown in the circuit diagram.
Ø Provide the input data via the input switches and observe the output on output LEDs
Verify the Truth Table.

Tasks:

Lab Tasks: Draw and verify the circuit discussed above on lab trainer and on Proteus.

Post Lab Tasks: Go through all the steps discussed in the lab for the following Truth
Table

Inputs
A B C D
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

19 | P a g e

You might also like