Title: Performance test (08)

Abstract:
This experiment is designed to help students implement logic circuits derived from a given statement using
gate ICs on a breadboard and verify the output against the corresponding truth table. It also involves
performing theoretical work by deriving the logic circuit and truth table from the given logic equation or
statement, with Boolean algebra and De Morgan’s law. Additionally, the experiment includes simplifying
logic expressions using Karnaugh Maps (K-Maps) and validating their accuracy through practical
implementation on a breadboard.
Introduction:
From any given logic statement, it is possible to construct a digital logic circuit. The first step in this process
is to construct a truth table and then determine a standard SOP (sum of products) or POS (product of sums).
At the same time, it is also possible to derive a logic expression from a given combinational circuit diagram
by observing the individual logic operations performed in the circuit and matching them with their
corresponding logic gates. Expressions are simplified using Boolean algebra and De Morgan's law or K-Map
to reduce the number of gates used. Then the circuit is implemented in the breadboard using gate ICs and
observed whether the output verifies the truth table of the given statement.
Theory and Methodology:
Combinational circuits are built with logic gates and other components. It does not include any values to be
taken from a previous state of the circuit. Designing such a combinational digital system requires use of one
of the following methods:
1. If a problem statement is given, the following steps will help designing the system

Look for the problem statement

Find the input(s) and output(s) of the

system and relate the input(s) with the
output(s)

Develop a truth table for your system

using the input and output relationship
that you have established

From your truth table, generate a

standard output expression

Reduce/simplify the output expression

using Boolean algebra or K-Map
 Implement the circuit using the
simplified Boolean expression.

2. Or if an expression is given, the following steps will help in designing the system
If the provided expression is not
standard, make it standard

After standardization, create a truth-

table.

Use the truth-table to develop a K-

MAP

Use proper grouping in K-MAP in

determining the output expression.

Use the reduced expression for

combinational circuit design.

Some useful definitions related to these procedures are given below:

Boolean algebra: In Boolean algebra, a variable is a symbol used to represent an action, a condition, or
data. A single variable can only have a value of 1 or 0.

1. Variable: A symbol used to represent a logical quantity that can have a value of 1 or 0, usually
designated by an italic letter.
2. Complement: The inverse or opposite of a number. In Boolean algebra, the inverse function,
expressed with a bar over the variable.
3. Sum term: The Boolean sum of two or more literals equivalent to an OR operation
4. Product term: The Boolean product of two or more literals equivalent to an AND operation.
5. Sum of Products (SOP):
When two or more product terms are summed by boolean addition, the resulting expression is a sum of
product. Ex.
Implementing an SOP expression simply requires ORing the outputs of two or more AND gates. A product
term is produced by an AND operation, and the sum (addition) of two or more product terms is produced by
an OR operation. Therefore, an SOP expression can be implemented by AND-OR logic in which the outputs
of a number (equal to the number of product terms in the expression) of AND gates connect to the inputs of
an OR gate.

A standard SOP expression is one in which all the variables in the domain appear in each product term. Ex.
 Standard SOP expressions are important in constructing truth-tables and in Karnaugh map simplification
method.
The SOP expression is equal to 1 only if one or more of the product terms in the expression is equal to 1.

6. Karnaugh Map:
A Karnaugh map provides a systematic method for simplifying Boolean expressions and, if properly used,
will produce the simplest SOP or POS expression possible le, known as the minimum expression.
A Karnaugh map is similar to a truth table because it presents all of the possible values of input variables and
the resulting output of each valued. Instead of being organized into columns and rows like truth table, the
Karnaugh map is an array of cells in which each cell presents binary value of the input variables. The cells are
arranged in a way so that the simplification of a given expression is simply a matter of properly grouping the
cells. Karnaugh maps can be used for expressions with two, three, four and five variables. The number of cells
in a Karnaugh map is equal to the total number of possible input variable combinations as is the number of
rows in a truth table.

Apparatus:

Serial Equipment Name Picture

1 Digital trainer board

2 Integrated Circuits (ICs)

3 Power Supply

4 Connecting Wires

Integrated Circuits (ICs):

Serial Equipment Series Model Picture Remarks

Name
1 OR gate 74LS SN74LS32N Restriction of Hazardous
Substances(RoHS)compliant,
batch/date codes for tracking
2 AND gate 74HC SN74HC08N Standardized pin
arrangement for easy
implementation in circuits.

3 NOT gate 74LS SN74LS04N Interfaces easily with other

TTL devices, facilitating
integration into various
designs.

Problem: In a manufacturing plant, there are four different machines, each controlled by a designated switch.
The assembly line machine is operated by Switch A, the packaging machine by Switch B, the quality control
machine by Switch C, and the delivery machine by Switch D. The production process starts if the worker
activates the switch for the delivery machine (D), or if switches for both the assembly line machine (A) and
the quality control machine (C) are activated simultaneously, or if switches for the packaging machine (B)
and the quality control machine (C) are activated simultaneously. Using truth tables, Karnaugh Maps, and
logic gates, determine the conditions necessary to start the production process, reduce the expression, and
design the circuit accordingly.
Solution

Delivery machine D
Quality control machine C
Packaging machine B
Line machine A

Machine start condition:

1. If someone press D
2. If someone press A&C
3. If someone press B&C
Truth Table

A B C D Y
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
 K-Map
AB/CD 00 01 11 10

00 0 1 1 0
01 0 1 1 1
11 0 1 1 1
10 0 1 1 1
Therefore, SOP Expression, Y = D + BC + AC
=D+(B+A) C
Logic Gate Diagram:

Circuit Construction:
.
 SIMULATIONS FOR PROBLEM 1
Simulation:
the SOP expression Y= D+B.C+A.C
=D+(B+A).C
Discussion:
In this experiment, we first checked each IC to make sure they were working correctly. We also
tested the switches on the trainer board to make sure none of them were damaged. After confirming
everything was fine, we started building the circuits step by step. we explored the process of
deriving logic equations and truth tables from a given statement or expression and constructing
combinational circuits based on them. The process of deriving logic equations and constructing truth
tables is crucial in digital circuit design as it enables the translation of logical expressions into
tangible circuit implementations.
As we built each circuit, we compared the output with the truth tables and expressions to make sure
they were correct. We also used Karnaugh Maps (K-map) to simplify the logic expressions, which
helped reduce the number of gates needed.
By following this careful approach, we were able to successfully build and test the logic circuits,
which helped us understand how to design and simplify them effectively.

Conclusion:
This experiment was conducted to implement logic circuits derived from a given statement using gate
ICs on a breadboard and to verify the output against the corresponding truth table. It also involved
deriving the logic circuit and truth table from the given logic equation or statement with Boolean
algebra and De Morgan’s law. Additionally, the experiment included simplifying logic expressions
using Karnaugh Maps (K-Maps) and validating their accuracy through practical implementation on a
breadboard.
References:
[1] Thomas L. Floyd, “Digital Fundamentals”, available Edition, Prentice Hall International Inc.

[2] Digital Logic Circuit Lab Performance Test, FE, AIUB.

[3] BYJU’S, “Boolean Algebra Questions | Boolean Algebra Questions with Solutions,” BYJUS, Jun. 16,
2022. https://byjus.com/maths/boolean-algebra-questions/