Lab Report on Implementing Function: Simple and Not So Simple

Course Code: CSE 1326

Course Title: Digital Logic Design Laboratory
Report No: 02 | Group No:

Submitted by:
Name: Tarek Hasan
Student ID: 0112230109
Section: D

Submitted to:
Fahim Hafiz
Lecturer
Dept. of CSE, UIU

Submission Date: 10th June 2023

Experiment 1:
Objectives:
Implementing the following functions using basic gates in both logism and trainer board.
1. F (A, B, C) = AC + B’C

Components used:
1. Logisim Software
2. Trainer Board
3. 74LS04 Quad 2-Input NOT gate
4. 74LS08 Quad 2-Input AND gate
5. 74LS32 Quad 2-Input OR gate

Theory:
Logic gates are electronic devices that manipulate binary information by performing
logical operations on one or more input signals to produce an output signal. These gates
are implemented using various electronic components, such as transistors, diodes, or
integrated circuits (ICs), and are available in different types, each with its unique
functionality. The most commonly used basic logic gates include: AND gate, OR gate,
NOT gate etc.
AND gate: The AND gate produces an output of '1' only when all of its input signals are
'1.' Otherwise, the output remains '0.' The AND gate follows the logical conjunction
operation, and its truth table is as follows:

Logic Diagram:

Truth Table:
 Input A Input B Output A.B
0 0 0
0 1 0
1 0 0
1 1 1

OR gate: The OR gate produces an output of '1' if any of its input signals is '1.' The output
is '0' only when all input signals are '0.' The OR gate follows the logical disjunction
operation, and its truth table is as follows:

Logic Diagram:

Truth Table:
Input A Input B Output A+B
0 0 0
0 1 1
1 0 1
1 1 1

Not gate: The NOT gate, also known as an inverter, produces an output that is the
complement of its input signal. It takes a single input and negates it. If the input is '0,' the
output is '1,' and vice versa.
Logic Diagram:

Truth Table:

Input A Output A’

0 1

1 0
Problem/Design Solve Procedure:
By using logism software we can implement different types of logical functions.
1. F (A, B, C) = AC + B’C
To implement this function we need to use 2 AND gate, 1 OR gate and 1 NOT gate.

A B C B’ AC B’C F=AC+B’C
0 0 0 1 0 0 0
0 0 1 1 0 1 1
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0 1 0 0 0
1 0 1 1 1 1 1
1 1 0 0 0 0 0
1 1 1 0 1 0 1

We took A and C as input in an AND gate. We took another AND gate where we took B as
an input which at first goes through a NOT gate then connects to the AND gate. Then we
linked C in the 2nd AND gate where we took B as an input. 1st AND gate give us AC output
and 2nd AND gate gives us B’C output. Then both output passed to an OR gate which gives
us the end result AC+B’C.
Discussion:
Through this experiment, I have gained knowledge in analyzing combinational circuits and
integrating them into the Trainer Board and Logisim software. Additionally, I have
acquired the skill of constructing truth tables for various logical functions and
comprehending the distinct operations performed by different types of gates.
Experiment 2:
Objectives:
To simplify and implement the following equation
1. F (A, B, C, D) = ABC’D + A’BCD’ + ABC + AB’C’D’ + ABD’ + AB’C’
with necessary gates.

Components used:
1. Logisim Software
2. 74LS04 Quad 2-Input NOT gate
3. 74LS08 Quad 2-Input AND gate
4. 74LS32 Quad 2-Input OR gate

Theory:
In digital logic circuits, the equation
1. F(A, B, C, D) = ABC'D + A'BCD' + ABC + AB'C'D' + ABD' + AB'C'
represents a combinational logic function. To implement this equation, we can simplify it
by converting it to canonical form, applying Boolean algebra rules, and then breaking it
down into basic logic gates such as AND, OR, and NOT gates. The simplified equation can
be implemented using these gates, and the circuit's correctness can be verified by
constructing a truth table and comparing the output values with the expected values from
the original equation. Thorough testing is necessary to ensure the accuracy of the circuit.
After simplification the function looks like this:
1. F (A, B, C, D) = A(B+C) + D’(A+BC)

Number of literals:
In the function, F(A, B, C, D) = ABC'D + A'BCD' + ABC + AB'C'D' + ABD' + AB'C'
there are 7 literals (A, B, C, D, A’, B’, C’).
But in the simplified function, F (A, B, C, D) = A(B+C) + D’(A+BC) there are 4 literals
(A, B, C, D’).
Problem/Design Solve Procedure:
To draw the gate diagram of function F (A, B, C, D) = A(B+C) + D’(A+BC) I needed to
use 3 OR gate, 3 AND gate and 1 NOT gate.

Truth table of function A(B+C) + D’(A+BC):

A B C D D’ B+C BC A(B+C) A+BC D’(A+BC) A(B+C)+D’(A+BC)
0 0 0 0 1 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 1 1 0 0 0 0 0
0 0 1 1 0 1 0 0 0 0 0
0 1 0 0 1 1 0 0 0 0 0
0 1 0 1 0 1 0 0 0 0 0
0 1 1 0 1 1 1 0 1 1 1
0 1 1 1 0 1 1 0 1 0 0
1 0 0 0 1 0 0 0 1 1 1
1 0 0 1 0 0 0 0 1 0 0
1 0 1 0 1 1 0 1 1 1 1
1 0 1 1 0 1 0 1 1 0 1
1 1 0 0 1 1 0 1 1 1 1
1 1 0 1 0 1 0 1 1 0 1
1 1 1 0 1 1 1 1 1 1 1
1 1 1 1 0 1 1 1 1 0 1
Discussion:
Through this experiment, I have gained knowledge and skills in the simplification and
implementation of logical functions using various gates in Logisim software. Additionally,
I have recognized the advantages of simplifying logical functions and have acquired the
ability to determine the number of literals in a logical expression as well as construct truth
tables for logical equations.