Experiment 4
Simplification and Implementation of Boolean Expressions
Objective
• To understand the utilization of Boolean algebra in logic circuits.
• To write logic equation of a logic circuit from the logic diagram.
• Simplification of Boolean Expression K-Map.
Tools/Equipment Requirement
• ICs as required, Digital Electronics trainer.
Theoretical Explanation
A set of rules or Laws of Boolean Algebra expressions have been invented to help reduce the
number of logic gates needed to perform a particular logic operation resulting in a list of
functions or theorems known commonly as the Laws of Boolean Algebra.
Boolean Algebra is the mathematics we use to analyze digital gates and circuits. We can use
these “Laws of Boolean” to both reduce and simplify a complex Boolean expression in an
attempt to reduce the number of logic gates required. Boolean Algebra is therefore a system
of mathematics based on logic that has its own set of rules or laws which are used to define
and reduce Boolean expressions.
The variables used in Boolean Algebra only have one of two possible values, a logic
“0” and a logic “1” but an expression can have an infinite number of variables all labelled
individually to represent inputs to the expression, For example, variables A, B, C etc, giving us
a logical expression of A + B = C, but each variable can ONLY be a 0 or a 1.
Procedure Step 1
Expression Y = BC + BAD + BAD′
1. Simplify the Expression using Boolean algebra.
2. Draw the logic diagram for the original and simplified expression.
3. Implement the circuit on trainer using the required logic gates.
4. Verify your circuit by applying all the possible input combinations to the circuit.
5. Complete the truth table for the original expression theoretically.
6. Construct a modified truth table for the simplified expression.
Simplified Expression
Step 2
Y = ABC + AB′C + A′B
1. Express it in the form of sum of minterms.
2. Draw the K-Map for the function.
3. Find its simplified expression from K-map in SOP form.
4. Draw the logic diagram for the original and simplified expression.
5. Verify your circuit by applying all the possible input combinations to the circuit.
6. Complete the truth table for the original expression theoretically.
7. Construct a modified truth table for the simplified expression.
Canonical Form:
Y=∑
K -Map
Simplified Expression
Circuit/Logic Diagram Step 1 (for original/simplified expression)
Step 2 (for original/simplified expression) Observations/Truth Table Step 1
INPUTS Expression
(solve
theorectically)
A B C D Y
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 1
Draw truth table for simplified expression and complete with the output obtained in the
experiment.
Step 2
INPUTS Expression
(solve
theorectically)
A B C D Y
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 1
Draw truth table for simplified expression and complete with the output obtained in the
experiment.
Conclusion