Name: Sirenjeevi Rao A/L Loganathan

Matrix Number : D021710304

Title Of The Experiment: Digital Simulation (Combinational Logic Circuit Design)
Course/Section: DEN 1 /1
Title: Digital Simulation (Combinational Logic Circuit Design)
Objectives:
 Understand the concept of logic circuit design.
 Use the Truth Table, Boolean algebra and Karnaugh Map to simplify the
combinational logic circuit
 Use De Morgan’s theorem for converting combinational logic circuit to all
NAND or all-NOR logic
 Use logic converter tool in Multisim to simplify circuit and equation.
 Design a simple application of combinational logic circuit by using Multisim.

Equipments:
 Computer
 Multisim
Theory:
To produce circuit that will behave in desirable ways, several methods are being used
to achieved that digital design. Combinations of basic gates can lead to obtain high
complexity level behaviour. Usually the design begins with the examinations of the
truth table of the logic gates to create a outline of the desired logic function. The truth
table are based on a Boolean equation which is simplified and reduced to a logic
drawing, which leads to a result of the logic function.
Multisim enable people to learn and explore the logic gate by using the logic converter
which could transferred the output of the logic gate easily. The logic converter is not
an instrument but yet a powerful tool which enables the user to convert a logic circuit
into a truth table, a simplified circuit version or a Boolean expression.

Procedures:
1. Find the equation for the circuit in Figure 1.
2. Built the circuit as shown in Figure 1.
3. Run the simulation and analyze the output.
Logic Converter
Use ‘logic converter’ in Multisim by clicking the figure 2(A).

How to use logic converter

Assuming that want to obtain a circuit for the following Boolean expression.

1.) Enter the Boolean expression into the logic converter as shown below:
 2.) Click on the Boolean expression to truth table conversion option.

3.) Let’s simplify the Boolean expression before you generate the circuit from it.
Click on the truth table to simplify Boolean expression option

4.) Now, you can obtain the circuit of this simplified version by following the
procedures you did earlier.
5.) Click. You will get a generated logic circuit.

Combinational Logic Circuit

Part A
1.) Find the Truth Table of the circuit in figure 2.62.
2.) Obtain the output equation.
3.) Obtain the simplified equation.
4.) Draw the new circuit based on (3)
5.) Built the circuit in Multisim and run the simulation.
Part B
1.) Transfer the truth table into logic converter.
2.) Obtain the equation by selecting
3.) Obtain the equation by selecting
4.) Generate a digital circuit from the equation by selecting
Multi Input Logic Circuit Design
Part A

1.) Design a three-input combinational logic circuit for f=∑ 𝑀 (0,2,3,6).

2.) Transfer your design into Multisim.
3.) Run the simulation and analyze the output.
4.) Modify the circuit by using All-NAND logic.
5.) Generate the equation and the digital circuit by using logic converter.
6.) Compare your result (5) and (3).

Part B

1.) Design a four-input combinational logic circuit for∑ 𝑀 (0,1,3,4,5,8,12

2.) Transfer your design into Multisim.
3.) Run the simulation and analyze the output.
4.) Modify the circuit by using All-NAND logic.
5.) Generate the equation and the digital circuit by using logic converter. Compare
your result.
Result
1.)

For figure 2.6 (Simple Logic Circuit simulation)

2.)

Converting From Boolean Expression to Truth Table.

3.)

The Boolean expression has been simplified.

Combinational Logic Circuit
1.)

The truth table for Figure 2.62

2.)

The new simplified circuit based on Figure 2.62

Multi-input logic circuit design.

Part A
1.)

three-input combinational logic circuit for f=∑ 𝑀 (0,2,3,6).

 2.)

Simplified Boolean Expression

3.)

The circuit has been modified and has been analyze using logic converter.
Part B
1.)

Four-input combinational logic circuit for∑ 𝑀 (0,1,3,4,5,8,12

2.)

Simplified version of the Boolean algebra.

3.)

The circuit has been modified by using ALL-NAND logic.

4.)

By using logic converter, the equation of the digital circuit has been generated
Discussion.
A combinational logic circuit consists of logic gates where the outputs at
any time are determined directly from the combination of logic gates.
Therefore, the outputs of logic circuits depend not only on the present values of
the inputs but also on the input's previous values. In other words, the outputs of
a logic circuit are functions of its present inputs and the previous state.
No matter how complex a combinational logic circuit might possibly be,
it will always be contained logic gates such as NAND gates, NOR gates, many
more. The logic function that a combinational logic circuit represents is usually
expressed using a Boolean function, or a set of Boolean functions. The most
important rules and laws of both Boolean algebra and De Morgan’s theorem are
used to reduce a given expression to a simplified form so that the number of
gates are minimized to as far as possible to produce the same output. Quite
often, the given Boolean functions to be implemented in combinational logic
circuits are not simplified. In order to keep the number of the logic gates that
implement the Boolean functions minimum, these Boolean functions must be
simplified before they are implemented in discrete logic circuits.
The Truth Table defines how a combination of gates will react to all
possible input combinations and the output of the gates. We use Multisim to
construct logic diagram which is known as wiring and connections of each
individual logic gate, represented by a graphical symbol that effects the Boolean
algebra.
Logic analyzer are being used to test complex digital or logic circuits.
Logic analyzer works almost the same way as oscilloscope but there are some
minor changes. In its most basic form, a logic analyzer captures and displays a
sequence of digital events. Once the data are captured, they can be rendered as
graphical images or state listings. Some analyzers can compare each captured
data set to a previously recorded data set, and let the operator know whether or
not the two data sets are identical.
The Karnaugh map provides a simple and straight-forward method of
minimising boolean expressions which represent combinational logic circuits. A
Karnaugh map is a pictorial method of grouping together expressions with
common factors and then eliminating unwanted variables.
The reason why is DeMorgan’s theorem important in the simplification of
Boolean equation are because DeMorgan’s theorem helps to break a long bar
symbol. It also operate directly underneath the break changes from addition to
multiplication, or vice versa, and the broken bar pieces remain over the
individual variables.

Conclusion.
In conclusion, in many applications of Boolean algebra, you have to reduce a
particular expression to its simplest from or change its form to a more convenient one
to implement the expression most efficiently. The approach taken in the lab is to use
Multisim and learn the basic laws, rules, DeMorgan’s theorems of Boolean algebra to
manipulate and simplify an expression. The basic rules and laws of both Boolean
algebra and Demorgan’s theorem are used to reduce a given expression to a simplified
form so that the number of gates are minimized to as far as possible to produce the
same output.

References
1.) UTeM ECAD Book
2.) http://www.32x8.com/
3.) https://en.wikipedia.org/wiki/Logic_analyzer
4.) https://www.youtube.com/watch?v=A0XupfXiKIo
5.) http://www.ccse.kfupm.edu.sa/~
6.) https://en.wikipedia.org/wiki/Logic_gate
7.) https://www.electronics-tutorials.ws/logic/logic_1.html
8.) https://en.wikipedia.org/wiki/De_Morgan%27s_laws
9.) https://www.allaboutcircuits.com/textbook/digital/chpt-7/demorgans-theorems/
10.) http://district.bluegrass.kctcs.edu/kevin.dunn/files/Simplification/mobile
_pages/4_Simplification8.html