Scribd
Upload
21 views30 pages

RME 2102 Lec 4

The document discusses combinational logic circuits and covers the following topics in 3 sentences: 1) It defines combinational logic circuits as digital circuits whose outputs depend only on the current inputs and not on past inputs. 2) It describes different types of combinational logic expressions like sum-of-products and product-of-sums forms and how they can be used to simplify logical functions. 3) It also discusses concepts like minterms, maxterms, and how Boolean algebra theorems and Karnaugh mapping can be used as methods to simplify logic circuits.

Uploaded by

asraful islam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views30 pages

RME 2102 Lec 4

The document discusses combinational logic circuits and covers the following topics in 3 sentences: 1) It defines combinational logic circuits as digital circuits whose outputs depend only on the current inputs and not on past inputs. 2) It describes different types of combinational logic expressions like sum-of-products and product-of-sums forms and how they can be used to simplify logical functions. 3) It also discusses concepts like minterms, maxterms, and how Boolean algebra theorems and Karnaugh mapping can be used as methods to simplify logic circuits.

Uploaded by

asraful islam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

University of Dhaka

Dept. of Robotics and Mechatronics Engineering


RME-2102: Digital Logic Circuit and Microprocessor

Lec-4: Combinational Logic Circuits


Ref: Digital Systems, Principles and Applications, by Ronald J. Tocci, Edition-12 (Chapter-4)

Md. Ariful Islam


Assistant Professor
Dept. of Robotics and Mechatronics Engineering
University of Dhaka

1
consists of two or more AND terms (products) that are ORed together.

consists of two or more OR terms (sums) that are ANDed together.

These expressions are used to simplify logical functions and can be implemented using logic gates or
2
digital circuits.
Minterm and Maxterm
A minterm is a Boolean AND function containing exactly one instance of each
input variable or its inverse.
A maxterm is a Boolean OR function with exactly one instance of each variable
or its inverse.

3
implement a circuit that is equivalent to the original circuit but that contains
fewer gates and connections.

Two methods for simplifying logic circuits.


 Utilize the Boolean algebra theorems and
 Karnaugh mapping
a systematic, step-by-step approach.

4
 The original expression is put into SOP form by repeated application of
DeMorgan’s theorems and multiplication of terms.
 Once the original expression is in SOP form, the product terms are checked
for common factors, and factoring is performed wherever possible. The
factoring should result in the elimination of one or more terms.

5
Simplify the logic circuit shown in Figure

6
7
8
The table shows that output x is to be at the 1 level only for the case where A =
0 and B = 1.

9
An AND gate with appropriate inputs can be used to produce a HIGH output
for a specific set of input levels.

10
Each set of input conditions that is to produce a 1 output is implemented by a
separate AND gate. The AND outputs are ORed to produce the final output.

11
Generating AND terms
The sum-of-products expression for x is
obtained by ORing the three AND terms.

12
Interpret the problem and set up a truth table to describe its
operation

Write the AND (product) term for each case where the
output is 1

Write the sum-of-products (SOP) expression for the output

Simplify the output expression if possible

Implement the circuit for the final, simplified expression


13
Design a logic circuit that has three inputs, A, B, and C, and whose output
will be HIGH only when a majority of the inputs are HIGH.

14
15
16
simplify a logic equation or to convert a truth table to its corresponding logic
circuit in a simple, orderly process.

17
18
The process for combining the 1s is called looping.

looping a pair of adjacent 1s in a


K map eliminates the variable
that appears in complemented
and uncomplemented form.

19
looping a quad of adjacent
1s eliminates the two
variables that appear in
both complemented and
uncomplemented form.

20
looping an octet of adjacent 1s
eliminates the three variables that
appear in both complemented and
uncomplemented form.

21
22
Figure shows the K map for a four-variable problem. We will assume that Step 1
(construct a K map from the problem truth table) has been completed. The
squares are numbered for convenience in identifying each loop. Use steps 2–7
of the simplification process to reduce the K map to an SOP expression.

23
24
25
Some logic circuits can be designed so that there are certain input conditions for
which there are no specified output levels, usually because these input
conditions will never occur.
In other words, there will be certain combinations of input levels where we
“don’t care” whether the output is 1 or 0.

Whenever don’t-care conditions occur, we must decide which x to change to 0 and


which to 1 to produce the best K-map looping 26
Example:
Let’s design a logic circuit that controls an elevator door in a three-story building.
The circuit in Figure has four inputs. M is a logic signal that indicates when the
elevator is moving (M = 1) or stopped (M = 0). F1, F2, and F3 are floor indicator
signals that are normally LOW, and they go HIGH only when the elevator is
positioned at the level of that particular floor. For example, when the elevator is
lined up level with the second floor, F2 = 1 and F1 = F3 = 0. The circuit output is
the OPEN signal, which is normally LOW and will go HIGH when the elevator door
is to be opened.

27
28
a transmitter can attach a parity bit to a set of data bits before transmitting the data bits to a
receiver.

29
Determine the parity checker’s output for each of the following sets of data from the transmitter:

30

You might also like