Module 2 1

Laboratory Exercises

College of Engineering, Architecture and Fine Arts

Department of Electrical Engineering

LABORATORY ACTIVITY NO. 2

“DESIGNING COMBINATIONAL CIRCUITS”

Submitted by:
Hernandez, John Patrick A.
19-00968
EE-3104

Magpantay, Mark Ray T.

19-02118
EE-3104

Submitted to:
Engr. Philip A. Caguete
Instructor

October 1, 2021

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 2
Laboratory Exercises

2 Designing Combinational Circuits

Intended Learning Outcomes

1. Design and test a combinational circuits using different designing techniques
and strategies
2. Simplified and implement and test a Boolean expression using different
simulation tools

Materials
Basic Logic Gates Connecting wire Wire Stripper

Breadboard (Optional) or Trainer Board Multimeter

Or

Logic Circuit Simulator

Procedures
The following experiment will test the understanding of different methods and
techniques in designing combinational circuits. Results must be documented and
demonstrated to your respective instructor

Experiment 1 : Boolean Algebra

Using the theorem and properties of the Boolean algebra, perform the following
experiments.
1. State the unsimplified Boolean expression for Figure below, and place your answer in
the space provided. Complete the truth table.

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 3
Laboratory Exercises

Unsimplified Boolean Expression: F = A’BC’+ABC’+ABC

Implement the unsimplified circuit and complete the truth table.

A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

Solving the truth table of the unsimplified expression using Microsoft Excel

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 4
Laboratory Exercises

2. Reduce the unsimplified expression to its simplest form using the Boolean Laws and
Rules. Show all work below. List each Law or Rule you used next to the line where you
applied it.

F = A’BC’+ABC’+ABC → starting Boolean expression

F = BC’(A’+A) + ABC → used the Distributive Law
F = BC’ + ABC → used the Identity Law
F = B(AC+C’) → used the Distributive Law
F = B(A+C’) → used the Absorption Law
F = BA + BC’ → used the Distribution Law, final simplified Boolean Expression

Hand-draw the simplified circuit below:

Implement the simplified circuit and complete the truth table for the simplified simplified
circuit

A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 5
Laboratory Exercises

Solving the simplified expression in Microsoft Excel

Findings and Conclusion

We found out that the unsimplified and the simplified Boolean Expressions does not
change the value of its output, no matter how complex the unsimplified Boolean Expression
is, the output will not change once it is simplified. This is evident in the first problem given in
this Laboratory Experiment.

3. Implement the expression in its unsimplified form. Create its truth table.

A B C Z

0 0 0 1

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 1

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 6
Laboratory Exercises

Solving the truth table of the unsimplified expression in Microsoft Excel

Using the Boolean properties and Laws and theorem, reduced the circuit into its simplest
form.

Z = A'BC+AB'C'+A'B'C'+AB'C+ABC → unsimplified expression

Z = BC(A’+A)+AB’C’+A’B’C’+AB’C → used the Distributive Law
Z = BC+AB’C’+A’B’C’+AB’C → used the Identity Law
Z = BC+B’C’(A+A’)+AB’C → used the Distributive Law
Z = BC+B’C’+AB’C → used the Identity Law
Z = B’C’+C(AB’+B) → used the Distributive Law
Z = B’C’+C(A+B) → used the Absorption Law
Z = B’C’+CA+CB → used the Distribution Law, final simplified expression.

Implement the simplified circuit, test its operation, and create its Truth Table

A B C Z
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 1

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 7
Laboratory Exercises

Solving the simplified expression using Microsoft Excel

Findings and Conclusion
Just like the first example, the final output from both the unsimplified and the
simplified Boolean Expression yielded the same output. It is very evident in this problem
where we are given a complex Boolean Expression where it is simplified into a shorter
expression it still gave out the same result.

4. Design a combinational circuit that have 3 inputs and 1 output. The output should be
high whenever the binary value of the input is less than 3, otherwise the output is LOW.
Implement the Design and demonstrate the result to your Instructor.

A B C Decimal Y
0 0 0 0 1
0 0 1 1 1
0 1 0 2 1
0 1 1 3 0
1 0 0 4 0
1 0 1 5 0
1 1 0 6 0
1 1 1 7 0

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 8
Laboratory Exercises

Circuit Diagram:

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 9
Laboratory Exercises

Finding and Conclusion

A = 0, B = 0, C = 0, Decimal = 0, Output (Y) = 1

A = 0, B = 0, C = 1, Decimal = 0, Output (Y) = 1

A = 0, B = 1, C = 0, Decimal = 0, Output (Y) = 1

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 10
Laboratory Exercises

A = 0, B = 1, C = 1, Decimal = 0, Output (Y) = 0

A = 1, B = 0, C = 0, Decimal = 0, Output (Y) = 0

A = 1, B = 0, C = 1, Decimal = 0, Output (Y) = 0

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 11
Laboratory Exercises

A = 1, B = 1, C = 0, Decimal = 0, Output (Y) = 0

A = 1, B = 1, C = 0, Decimal = 1, Output (Y) = 0

We were tasked to build a combinational circuit that outputs a HIGH value (1) when the
input is less than 3 and outputs a LOW value (0) when the output is higher than or equal to 3. To
make this possible, we converted the inputs ABC into its decimal value from 1 to 7.

To get the Boolean Expression of the circuit, we used Karnaugh Mapping in which we got the
expression A’B’+A’BC’. After getting the Boolean Expression, we can now make a circuit design in
which we tested at Logicly online simulator to prove that our circuit design meets the requirements
given in the instructions.

After testing, we got the circuit design correctly and the required output corresponds with
the input that we gave the circuit.

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 12
Laboratory Exercises

Experiment 2: KARNAUGH Map

For Design 1 and 2, the student must design their own experiment in order to implement
the given design specification. The experiment should contain a Introduction, Materials,
Procedures, Results and Finding and conclusion. Use the blank spaces provided.
Design 1
a. You need to control two pumps that supply two different concentrations of reactant
to a chemical process. The strong reactant is used when pH is very far from the desired
value, and the weak reactant when pH is close to desired.
b. You need to ensure that only one of the two pumps runs at any time. Each pump
controller responds to standard logic signals, that is when the input to the pump
controller is 1, the pump operates, and when that input is 0, the pump does not
operate.
c. You have a bunch of two-input AND gates (IC chips), OR gates and Inverters, and
you need to design a logic circuit to control the pumps. You can generate a signal that is
1 when Pump S is ON, and 0 when Pump W is ON. Can you design the circuit?
d. In order to solve the problem, consider that the pump controls should receive
logical inverse signals. When one pump signal is one, the other is zero. Given that
recognition this circuit should work. Here, if X is 1, Pump S pumps.

Design 2

Let's reconsider the pump problem. What happens if there are times when you don't want
either pump to pump? Assume you have a digital signal that is 1 when one of the two
pumps is to pump, and 0 when neither pump is to pump. For example, if the pH was very
close to desired you wouldn't want to do anything at all so you wouldn't want either pump
to turn on..

You still have the other signal that determines which pump is to pump whenever one of
the pumps should pump.

Devise a circuit that will ensure that both pumps are OFF when the Pump signal is 0 and
that the correct pump pumps when the Pump signal is 1.

The circuit you devise in this section will be simple enough that you can probably
implement it with a few chips although you will need to look for chips with AND gates and
inverters. You should be able to handle that now. Work through the solution in this lesson
and try it out in lab if you can.

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 13
Laboratory Exercises

KARNAUGH Map
Experiment 2

Introduction:
The Karnaugh map is a method of simplifying Boolean algebra expressions. Maurice Karnaugh
introduced it in 1953 as a refinement of Edward W. Veitch's 1952 Veitch chart, which was a rediscovery of
Allan Marquand's 1881 logical diagram aka Marquand diagram but with a focus now set on its utility for
switching circuits.

Using Karnaugh Map, we can formulate such Boolean Expression which in then help us in making its
corresponding logic circuit that can input and output values properly given a particular problem. In this
experiment, we are tasked in making two circuit designs with the help of Karnaugh Map. These are the designs
we are tasked with.

Design 1
a. You need to control two pumps that supply two different concentrations of reactant to a
chemical process. The strong reactant is used when pH is very far from the desired value, and the
weak reactant when pH is close to desired.
b. You need to ensure that only one of the two pumps runs at any time. Each pump controller
responds to standard logic signals, that is when the input to the pump controller is 1, the pump
operates, and when that input is 0, the pump does not operate.
c. You have a bunch of two-input AND gates (IC chips), OR gates and Inverters, and you need to
design a logic circuit to control the pumps. You can generate a signal that is 1 when Pump S is ON,
and 0 when Pump W is ON. Can you design the circuit?
d. In order to solve the problem, consider that the pump controls should receive logical inverse
signals. When one pump signal is one, the other is zero. Given that recognition this circuit should
work. Here, if X is 1, Pump S pumps.

Design 2

a. Let's reconsider the pump problem. What happens if there are times when you don't want
either pump to pump? Assume you have a digital signal that is 1 when one of the two pumps is to
pump, and 0 when neither pump is to pump. For example, if the pH was very close to desired you
wouldn't want to do anything at all so you wouldn't want either pump to turn on..
b. You still have the other signal that determines which pump is to pump whenever one of the
pumps should pump.
c. Devise a circuit that will ensure that both pumps are OFF when the Pump signal is 0 and that
the correct pump pumps when the Pump signal is 1.

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 14
Laboratory Exercises

Materials:

• Breadboard
• Logic gates
• Wires
• Logic Gate Simulator

Procedure:

1. Create a corresponding truth table for both the design 1 and design 2 respectively.
2. Generate a Karnaugh Map for each of the truth table that is calculated.
3. Formulate a Boolean Expression from the Karnaugh Map generated.
4. Device a combinational circuit from the Boolean Expression.
5. Simulate the combinational circuit and check if it meets the requirements of the
truth table and the given design.
6. Record the data.

Result and Findings:

Karnaugh Mapping and Combinational Circuit for Design 1 and 2

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 15
Laboratory Exercises

For Design 1:

A = 0, B = 0, Pump S = 1, Pump W = 0

A = 0, B = 1, Pump S = 1, Pump W = 0

A = 1, B = 0, Pump S = 1, Pump W = 0

A = 1, B = 1, Pump S = 1, Pump W = 0

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 16
Laboratory Exercises

For Design 2:

A = 0, B = 0, Pump S = 1, Pump W = 0

A = 0, B = 1, Pump S = 0, Pump W = 0

A = 1, B = 0, Pump S = 0, Pump W = 0

A = 1, B = 1, Pump S = 0, Pump W = 1

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.

 Module 2 17
Laboratory Exercises

In the simulations for Design 1, there are four different inputs namely 00, 01, 10, and
11. From all the simulations done it is very evident that the outputs Pump S and Pump W
yielded the opposite results every time. Pump W only operates at input 11, while Pump S
operates at every other input but 11. In conclusion this design is accurate.

In the simulations for Design 2, the combinational circuit also met the conditions
given. There are also 4 inputs namely, 00, 01, 10, and 11. Pump W operates at input 11
while Pump S operates at input 00 and for inputs 01 and 10, the pumps did not operate
which makes the combinational circuit accurate.

Conclusion:

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions

without having to use Boolean algebra theorems and equation manipulations. A K-map can
be thought of as a special version of a truth table. Using a K-map, expressions with two to
four variables are easily minimized.
These four outputs may be observed on a lamp in the relay ladder logic, on a logic
probe on the gate diagram. These outputs may be recorded in the truth table, or in the
Karnaugh map. Look at the Karnaugh map as being a rearranged truth table.
The Output of the Boolean equation may be computed by the laws of Boolean
algebra and transferred to the truth table or Karnaugh map and this makes it possible for
designs like the one given in the experiment to be formulated and generated.

Authors : Sarmiento, J.; Macabagdal, C.B.; Serrano, R.R.; Magboo, A.