Experiment Number: Experiment 4

Experiment Name: Design of Logic Circuit

from Boolean Expression

Date: Thursday, April 10th, 2025.

Name: Emmanuel Saviour

Student Number: 22120712851

Group Members: Emmanuel Saviour

Akinjaiyeju Tosin
Nasir Saleem
ABSTRACT
This experiment involved the systematic design, implementation, and validation of
combinational logic circuits derived from Boolean expressions. Utilizing TTL logic families,
specifically the 7404 (NOT), 7408 (AND), and 7432 (OR) integrated circuits, the objective
was to translate algebraic logic expressions into functional gate-level hardware
representations. Logic diagrams were constructed and circuits were built on a breadboard
with SPST switches simulating binary inputs and LEDs serving as output indicators.
Comprehensive truth tables were developed through exhaustive input permutations,
verifying the correctness of each circuit’s logical behaviour. The experiment reinforced key
concepts such as gate interconnectivity, Boolean algebra simplification, and logic
equivalence. Additionally, it provided practical exposure to the electrical characteristics
and constraints of TTL components, offering critical insights into real-world digital system
design and troubleshooting.

AIM
The aim of this experiment is to design, implement, and analyse combinational logic
circuits based on given Boolean expressions using fundamental logic gates (AND, OR,
NOT). It also seeks to validate the functional correctness of the implemented circuits
through hardware testing, while reinforcing understanding of Boolean algebra, circuit
simplification, and practical digital logic design using TTL logic families.

THEORY
Digital logic design is the cornerstone of modern electronic systems, enabling binary
computation and decision-making through structured arrangements of logic gates. At the
heart of digital systems lies the Boolean algebra, a mathematical framework introduced by
George Boole, which governs the behavior of binary variables through logical operations
such as AND, OR, and NOT.
Combinational logic circuits are a class of digital circuits whose outputs depend solely on
the current combination of input values, devoid of any memory elements or feedback
loops. These circuits are deterministic in nature — the same input always yields the same
output — making them ideal for implementing arithmetic operations, data routing,
encoding, decoding, and decision-making in digital systems.
In practical terms, designing a logic circuit from a Boolean expression involves translating
algebraic formulations into physical configurations of logic gates. The ICs used in this
experiment — 7408 (AND), 7432 (OR), and 7404 (NOT) — belong to the 7400 series of TTL
(Transistor-Transistor Logic) devices, known for their reliability and wide usage in
combinational and sequential circuit design.

Figure 1 Image of the internal logic gate design of a 7408.

By implementing and analyzing expressions such as 𝑌 = 𝐴𝐵 + 𝐶, 𝑍 = 𝐶(𝐴 + 𝐵), and 𝑋 = 𝐴𝐴 +

𝐴𝐶, this experiment not only reinforces theoretical understanding of Boolean algebra and
circuit design principles but also provides hands-on experience in circuit assembly, fault
detection, and logical verification through empirical testing.
The process of translating Boolean expressions into digital logic involves:
1. Simplifying the expression where possible.
2. Drawing a corresponding logic diagram using standard gates.
3. Identifying the appropriate ICs and their pin configurations.
4. Constructing the circuit and testing against a truth table.
This experiment includes expressions such as:
• 𝑌 = 𝐴𝐵 + 𝐶: A two-level AND-OR combinational logic.
• 𝑍 = 𝐶(𝐴 + 𝐵): A nested logic function combining OR followed by AND.
• 𝑋 = Ā𝐶: A logic function demonstrating selective enabling using inversion.
Ultimately, mastering the design and validation of logic circuits is a critical step toward
developing more complex systems such as multiplexers, decoders, arithmetic logic units
(ALUs), and microprocessors — the very fabric of digital computation.

Apparatus and Materials

• DC Power Supply (0–30V)
• Breadboard
• Jumper wires
• IC 7404 (Hex Inverter)
• IC 7408 (Quad 2-input AND)
• IC 7432 (Quad 2-input OR)
• SPST DIP Switches
• LEDs (with current-limiting resistors)
• Multimeter

EXPERIMENT I: Implementation of Boolean Expressions Y = AB + C and Z = C(A + B)

In the first part of this experiment, the primary objective was to implement and analyze two
Boolean expressions: Y=AB+CY = AB + CY=AB+C and Z=C(A+B)Z = C(A + B)Z=C(A+B). The
process began with the design and drawing of the corresponding logic diagrams using only
two-input AND and OR gates. This step was essential for visualizing the required gate-level
implementation before physical assembly.
Following the design phase, the circuits were constructed on a breadboard using IC 7408
(AND gate) and IC 7432 (OR gate). DIP switches were connected to serve as input sources
for variables A, B, and C, while LEDs were connected to the output pins to visually indicate
logic states. Pin configurations and proper wiring practices were ensured by referencing the
datasheets of the respective ICs. All TTL chips were powered using a regulated +5V DC
supply, with VCC and GND connections correctly established to enable stable operation.
Before powering up the circuit, all DIP switch inputs were set to the LOW (logic 0) position
to prevent erroneous behavior. Once powered, input combinations were applied
systematically based on the configurations listed in Table 1. For each unique set of inputs,
the corresponding LED outputs were observed and documented in Table 2 for both Y and Z.
Finally, the experimental results for both output expressions were analyzed and compared.
Attention was given to the order of operations in Boolean logic—particularly the
precedence of AND operations over OR operations, unless modified by parentheses. The
correctness of the logic gate implementation was validated by confirming that the output
behavior aligned with the theoretical expectations derived from the given Boolean
expressions.

EXPERIMENT II: Implementation of Boolean Expression X = AĀ + ĀC

The second segment of the experiment focused on the implementation and verification of
the Boolean expression X=AA‾+A‾CX = A\overline{A} + \overline{A}CX=AA+AC, which
combines inversion, conjunction, and disjunction operations. The first step involved the
design and illustration of the logic diagram using two-input AND, OR, and NOT gates. To
streamline the construction process, each logic gate was labeled with its corresponding IC
pin numbers based on datasheet specifications.
The logic circuit was then constructed using IC 7408 (AND), IC 7432 (OR), and IC 7404
(NOT). DIP switches were integrated as manual input sources for variables A and C, while
the output was monitored through an LED connected at the appropriate pin. Each IC was
connected to a +5V regulated power supply for TTL operation, ensuring that VCC and GND
were properly wired to maintain logic integrity and prevent malfunction.
Prior to powering the circuit, all DIP switches were initialized to the LOW state to avoid
undefined logic levels. Once the power was applied, input combinations were adjusted
sequentially as specified in Table 2. For each input configuration, the LED output
representing the logic state of X was observed and recorded accordingly.
Throughout the procedure, careful attention was given to verifying the accuracy of the
circuit's behavior against the expected outcomes derived from Boolean logic. In cases
where discrepancies arose, the circuit was thoroughly inspected for wiring errors, incorrect
pin usage, or faulty components, and necessary troubleshooting was conducted to restore
proper functionality.

RESULTS
The results obtained from the experimental implementation of the Boolean logic circuits
are presented in this section. Using systematic input variations through DIP switches,
output states were observed via LEDs and recorded for each logical expression. Truth
tables were completed for each circuit, capturing the real-time behaviour of the
implemented logic gates in response to all possible input combinations. These results are
critical in verifying the functional correctness of the designed circuits and in affirming the
accuracy of Boolean simplification and gate-level design.
 Table 1: Experiment 1.

INPUT OUTPUT
A B C Y Z
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 0
1 0 1 1 1
1 1 0 1 0
1 1 1 1 1

Figure 2: Schematics of Circuits 1 and 2.

Table 2: Experiment 2.

INPUT OUTPUT
A C A' A'C X
0 0 1 0 0
0 1 1 1 1
1 0 0 0 0
1 1 0 0 0
 Figure 3: Schematics of Circuit 3.
Mathematical Proof of A + ĀB = A + B:

Starting with the left-hand side (LHS):

𝐿𝐻𝑆 = 𝐴 + Ā𝐵
Using the Distributive Law which states (𝑋 + 𝑌𝑍 = (𝑋 + 𝑌)(𝑋 + 𝑍)):

𝐿𝐻𝑆 = (𝐴 + Ā)(𝐴 + 𝐵)
Using the Complement Law (𝐴 + Ā = 1):

𝐿𝐻𝑆 = 1 ⋅ (𝐴 + 𝐵)
Using the Identity Law (1 ⋅ 𝑌 = 𝑌):

𝐿𝐻𝑆 = 𝐴 + 𝐵
LHS = Right-hand side (RHS).

Therefore, 𝐴 + Ā𝐵 = 𝐴 + 𝐵 is proven.

DISCUSSION
In this experiment, we explored the behavior and functionality of basic combinational logic
circuits derived from Boolean expressions. The circuits analyzed were based on the
expressions Y = AB + C, Z = C(A + B), and X = A'C. Each of these circuits was built and tested
using basic logic gates, and their outputs were observed under varying input conditions.
The behavior of these circuits was then compared to the expected theoretical results,
confirming the validity of the designs.
Circuits 1 and 2:
For the first circuit, based on the Boolean expression Y = AB + C, the output Y was HIGH
when either both A and B were HIGH, or when C was HIGH. This result was consistently
observed in rows 2, 4, 6, 7, and 8 of the truth table, where the respective combinations of
inputs yielded the correct output. In rows 2, 4, and 6, C was HIGH, and in row 7, both A and
B were HIGH, while in row 8, both AB = 1 and C = 1. These results confirmed that the circuit
was correctly implementing the inclusive OR operation between the AND of A and B, and
the independent input C.
The second circuit, based on the expression Z = C(A + B), demonstrated a more selective
behavior than the first. The output Z was HIGH only when C was HIGH and either A or B was
HIGH. The output became HIGH in rows 4, 6, and 8, where the appropriate combinations of
inputs were applied. In rows where C = 0, the output Z remained LOW, regardless of the
values of A and B. This dependency on both C and A + B illustrated the conditional gating
behavior of the circuit. Such behavior is crucial in circuits designed for enabling signals
only under specific control conditions.
Circuit 3:
The third circuit, based on the Boolean expression X = A'C, was designed to allow C to pass
only when A was LOW. This setup created a condition where A acted as an inhibiting signal.
Specifically, when A = 1, the output X was forced to be 0, regardless of the value of C. This
circuit is a classic example of conditional logic, where one input acts as a control to permit
or block the passage of another signal. Such logic is commonly utilized in enabling circuits,
where the main signal (C) is only allowed to pass through if a specified condition, such as A
= 0, is met. This type of logic is critical in applications where signal routing must be
controlled by specific conditions or inputs.
Overall, the results of these experiments successfully validated the theoretical principles
behind Boolean algebra and logic gates. The circuits operated as expected, demonstrating
how different Boolean operations can be realized through simple logic gates. Additionally,
the experiments reinforced the importance of understanding logical dependencies and
how they govern the flow of signals in digital systems.

CONCLUSION
In conclusion, this experiment successfully demonstrated the practical application of
combinational logic circuits, validating key Boolean principles through hands-on circuit
design and analysis. By constructing and testing circuits based on the expressions Y = AB +
C, Z = C(A + B), and X = A'C, the experiment reinforced the importance of logical
dependencies and how basic logic gates, such as AND, OR, and NOT, work together to
perform complex operations.
The results confirmed that the circuits functioned as expected, with each output
corresponding accurately to the truth tables derived from the Boolean expressions.
Specifically, the experiment highlighted the role of selective gating in digital systems, with
the circuits showing how different input conditions control the flow of signals.
Furthermore, the experiment provided insight into the use of logic gates for designing
circuits with conditional behaviors, a fundamental aspect of digital system design.
Ultimately, this experiment not only deepened the understanding of Boolean algebra and
logic gate operations but also emphasized the practical skills needed to build,
troubleshoot, and optimize digital circuits in real-world applications. The findings
underscore the critical role of logical analysis and circuit design in the development of
reliable and efficient digital systems.

REFERENCES
[1] M. M. Mano and C. R. Kime, Logic and Computer Design Fundamentals, 5th ed. Upper
Saddle River, NJ: Pearson, 2015.
[2] T. L. Floyd, Digital Fundamentals, 11th ed. Boston, MA: Pearson, 2014.
[3] A. P. Malvino and J. A. Brown, Digital Computer Electronics, New York, NY: McGraw-Hill,
2018.
[4] Laboratory Manual for EEE 312 – Digital Electronics Experiments, Department of
Electrical and Electronics Engineering, [Your University Name], [Year].
[5] J. F. Wakerly, Digital Design: Principles and Practices, 4th ed. Upper Saddle River, NJ:
Prentice Hall, 2006.