Digital Logic Circuits

Prof. Tae In Kim

Department of Electrical Engineering
Inha University
[email protected]
 Chapter 3.
Describing Logic Circuits

2
Chapter 3

Describing Logic Circuits

➢ Perform the three basic logic operations.

➢ Describe the operation of and construct the truth tables for the AND, NAND, OR,
and NOR gates, and the NOT (INVERTER) circuit.

➢ Draw timing diagrams for the various logic-circuit gates.

➢ Write the Boolean expression for the logic gates and combinations of logic gates.

➢ Implement logic circuits using basic AND, OR, and NOT gates.

➢ Use Boolean algebra to simplify complex logic circuits.

➢ Use DeMorgan’s theorems to simplify logic expressions.

3
3-1 Boolean Constants and Variables

Boolean algebra : a branch of mathematics that deals with operations on logical values
with binary variables.

➢ Boolean algebra allows only two values—0 and 1.

✓ Logic 0 can be: false, off, low, no, open switch.

✓ Logic 1 can be: true, on, high, yes, closed switch.

* The three basic logic operations:

→ OR, AND, and NOT.

4
3-2 Truth Tables

➢ A truth table describes the relationship between the input and output of a logic
circuit.

➢ A mathematical table used in logic, showing the functional values of logical

expressions

➢ The number of entries corresponds to the number of inputs.

✓ A 2-input table would have 22 = 4 entries.
✓ A 3-input table would have 23 = 8 entries.

5
3-2 Truth Tables

Examples of truth tables with 2, 3, and 4 inputs.

6
3-2 Truth Tables

Exercise What is the output state of the four-input circuit

(a) When all inputs except B are 1?
(b) When A=1, B=0, C=1, D=0?

Ans> (a) x=1, (b) x=0

7
3-2 Truth Tables

Exercise How many table entries are needed for a six-input circuit?

Ans> 64 lines

8
3-3 OR Operation With OR Gates

➢ The Boolean expression for the OR operation is:

X = A + B — Read as “X equals A OR B”

The + sign does not stand for ordinary

addition—it stands for the OR operation

✓ The OR operation is similar to addition, but when A = 1 and B = 1, the OR

operation produces:

1 + 1 = 1 not 1 + 1 = 2

In the Boolean expression x = 1 + 1 + 1 = 1…

x is true (1) when A is true (1) OR B is true (1) OR C is true (1)

9
3-3 OR Operation With OR Gates

➢ An OR gate is a circuit with two or more inputs, whose output is equal

to the OR combination of the inputs.

Truth table/circuit symbol for a two input OR gate.

Circuit Symbol?

10
3-3 OR Operation With OR Gates

➢ An OR gate is a circuit with two or more inputs, whose output is equal

to the OR combination of the inputs.

Truth table/circuit symbol for a three input OR gate.

Circuit Symbol?

11
Exercise

Example In many industrial control systems, it is required to activate an output function whenever
any one of several inputs is activated. i.e., in a chemical process it may be desired that an
alarm be activated whenever the process temperature exceeds a maximum value or
whenever the pressure goes above a certain limit. TH is normally a low voltage (logic 0),
but it switches to a high voltage (logic 1) when VT exceeds VTR. PH goes from LOW to
HIGH when the pressure is too high. Design the proper circuit.

12
3-3 OR Operation With OR Gates

Exercise Determine the OR gate output.

Output = A+B

Output

Time

13
3-4 AND Operations with AND gates

➢ The AND operation is similar to multiplication:

X = A • B • C — Read as “X equals A AND B AND C”

The · sign does not stand for ordinary

multiplication—it stands for the AND operation.

x is true (1) when A AND B AND C are true (1)

Circuit Symbol?

Truth table Gate symbol

14
3-4 AND Operations with AND gates

Truth table/circuit symbol for a three input AND gate.

Circuit Symbol?

15
3-4 AND Operations with AND gates

Exercise Determine the output x.

16
AND / OR

The AND symbol on a logic-circuit diagram

tells you output will go HIGH only when all
inputs are HIGH.

The OR symbol means the output will

go HIGH when any input is HIGH.

17
3-5 NOT Operation

➢ The Boolean expression for the NOT operation:

“X equals NOT A”
“X equals the inverse of A”
X=A “X equals the complement of A”
The overbar represents
the NOT operation.

A' = A
Another indicator for
inversion is the
prime symbol (').
NOT Truth Table

18
3-5 NOT Operation

A NOT circuit—commonly called an INVERTER.

Circuit Symbol?

This circuit always has only a single input, and the out-put
logic level is always opposite to the logic level of this input.

19
3-5 NOT Operation

The INVERTER inverts (complements) the

input signal at all points on the waveform.

Timing Diagram?

Whenever the input = 0, output = 1, and vice versa.

20
3-5 NOT Operation

Exercise The push button is wired to produce a logic 1 (true) when it is pressed. Sometimes we
want to know if the push button is not being pressed. Design the circuit.

This circuit provides an expression that

is true when the button is not pressed.

21
Boolean Operations

➢ Summarized rules for OR, AND and NOT

These three basic Boolean operations

can describe any logic circuit.

22
3-6 Describing Logic Circuits Algebraically

➢ If an expression contains both AND and OR gates, the AND operation will be
performed first.

➢ Unless there is a parenthesis in the expression.

23
3-6 Describing Logic Circuits Algebraically

➢ Whenever an INVERTER is present, output is equivalent to input,

with a bar over it.
→ Input A through an inverter equals A.

24
3-6 Describing Logic Circuits Algebraically

Exercise

25
3-7 Evaluating Logic Circuit Outputs

➢ Rules for evaluating a Boolean expression:

✓ Perform all inversions of single terms.

✓ Perform all operations within parenthesis.

✓ Perform AND operation before an OR operation unless parenthesis

indicate otherwise.

26
3-7 Evaluating Logic Circuit Outputs

➢ If an expression has a bar over it, perform operations inside the

expression, and then invert the result.

➢ The best way to analyze a circuit made up of multiple logic gates is to use
a truth table.
✓ It allows you to analyze one gate or logic combination at a time.
✓ It allows you to easily double-check your work.

27