Digital Systems Design (DSD)

Lecture 3 – Describing Logic Circuit

(Part 1)
 Content
3-1 Boolean Constants and Variables
3-2 Truth Tables
3-3 OR Operation with OR Gates
3-4 AND Operation with AND Gates
3-5 NOT Operation
3-6 Describing Logic Circuits Algebraically
3-7 Evaluating Logic-Circuit Outputs
3-8 Implementing Circuits from Boolean Expressions
3-9 NOR Gates and NAND Gates
3-10 Boolean Theorems
3-11 DeMorgan’s Theorems

2
 Objectives

■ Perform the three basic logic operations, OR+AND+NOT

■ 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.
■ Appreciate the potential of Boolean algebra to simplify complex logic circuits.
■ Use DeMorgan’s theorems to simplify logic expressions.

3
 Introduction

• Study the most basic logic circuits—logic gates—which are the

fundamental building blocks from which all other logic circuits and
digital systems are constructed.
• Analysis, synthesis, and documentation of logic systems and circuits
include: truth tables, schematic symbols, timing diagrams, and
language.
• Boolean algebra  mathematic tool
• Truth tables  data organization tools
• Schematic symbols  drawing tools
• Timing diagrams  graphing tools
• Language  universal description tool

4
 3.1 Boolean Constants and Variables
• Boolean constants and variables:
• Have two possible values 0 or 1 (e.g. to represent the voltage level present
on a wire)
• Do not represent actual number
• Represent logic level (e.g. the state of a voltage variable)

5
 3.1 Boolean Constants and Variables (cont.)
• Boolean algebra:
• To express the relationship between a logic circuit’s inputs and outputs
• No fractions, decimals, negative numbers, square roots, cube roots,
logarithms, imaginary numbers, and so on.
• Only three basic operations: OR, AND, and NOT (logic operations)

• Digital circuits are called logic gates

• Constructed by from diodes, transistors, and resistors interconnected
• The circuit output is the result of a basic logic operation (OR, AND, NOT)

6
 3.2 Truth Tables
• A truth table:
• How a logic circuit’s output depends on the logic levels present at the
circuit’s inputs.

All possible combinations of logic levels present

at inputs A and B, along with the corresponding
output level .

7
 3.2 Truth Tables (cont.)
• A truth table: A truth table
• Example:

The number of input combinations will equal to 2N for an N-input truth table
8
 3.2 Truth Tables (cont.)
• Don’t Care Conditions

• It does not matter what the output is, that is,

we don’t care. In a truth table, don’t cares
are indicated by an X.
• X may be “0” or “1”.

9
3.2 Truth Tables (cont.)

10
 Definition of Switching Algebra

• Minterms

For example:

11
 Minterms and Maxterms (1)
SOP: Sum of product/minterms
Minterms

POS: Product of sum/maxterms

Maxterms

12
 Minterms and Maxterms (2)

Maxterm We only
A +B+ C consider the
A +B+ C’ value “1” of
A +B’+C the function
A +B’+C’ f or f’
A’+B+ C
A’+B+ C’
A’+B’+C
A’+B’+C’

13
 3.3 “OR” Gate
• is true (1), WHEN is true (1) OR is true (1) OR is true (1).
• The Boolean expression for the OR operation is
• “ equals OR ”

Symbol of the “OR” gate

14
 3.3 “OR” Gate (cont.)

• Example 3.1: Using block diagrams

15
 3.3 “OR” Gate (cont.)

• Example 3.2: Using timing diagrams

• Determine the OR gate output for 2 inputs

16
 3.3 “OR” Gate (cont.)

• Example 3.3: Using timing diagrams

• Determine the OR gate output for 3 inputs

17
 3.4 “AND” Operation and Gates
• The Boolean expression for the AND operation is .
• “ equals AND ,”

will be 1 only when Symbol of the “AND” gate

and are both 1.

18
 3.4 “AND” Operation and Gates (cont.)
• Examples

Signal variable

Control variable

Inhibit condition Enable condition

19
 3.4 “AND” Operation and Gates (cont.)
• Examples

20
 3.5 “NOT” Operation and Gates
• A “NOT” gate can be performed on a single input variable.
• The Boolean expression for the “NOT” operation is =
(“x equals NOT A”; “x equals the inverse of A”; “x equals the complement of A.”)
• NOT operation = inversion = complementation

FIGURE (a) Truth table; (b) symbol for the INVERTER (NOT circuit); (c) sample waveforms

21
 3.5 “NOT” Operation and Gates (cont.)
• NOT circuit = inverter
• This circuit always has only a single input, and its output logic level is
always opposite to the logic level of the input.

FIGURE (a) Truth table; (b) symbol for the INVERTER (NOT circuit); (c) sample waveforms

22
 3.5 “NOT” Operation and Gates (cont.)
• Application

0V

23
 Summary of Boolean Operations (OR, AND, and NOT)

• The rules for the OR, AND, and NOT operations may be
summarized as follows:

24
 Summary of Boolean Operations (OR, AND, and NOT)

• Example
• Derive the truth table for the following circuit?
• Draw the timing diagram of D for given timing diagrams of A, B, C

̅
A
D ̅

B
C

25
 3.6 Describing Logic Circuits Algebraically
• Any logic circuit can be described completely using three basic Boolean
operations (OR, AND, and NOT).
LEFT RIGHT

Without the parentheses, it

would be interpreted incorrectly.

FIGURE (a) Logic circuit with its Boolean expression; (b) logic circuit whose expression
requires parentheses.
26
 3.6 Describing Logic Circuits Algebraically (cont.)
• Circuits Containing INVERTERs

FIGURE - Circuits using INVERTERs

27
 3.6 Describing Logic Circuits Algebraically (cont.)
• Circuits Containing INVERTERs

The input variable A is connected as an input

to two different gates.

28
 3.6 Describing Logic Circuits Algebraically (cont.)
• Circuits Containing INVERTERs

Note especially the use of two separate sets of

parentheses

29
 3.6 Describing Logic Circuits Algebraically (cont.)
• Examples

30
 3.7 Evaluating Logic-Circuit Outputs

• Rules must always be followed when evaluating a Boolean expression:

1. First, perform all inversions of single terms; that is, or 1 = 0 or 0 = 1
2. Then perform all operations within parentheses.
3. Perform an AND operation before an OR operation unless parentheses
indicate otherwise.
4. If an expression has a bar ‘’[…]” over it, perform the operations inside
the expression first and then invert the result.
31
 3.7 Evaluating Logic-Circuit Outputs (cont.)
• Analysis Using a Truth Table:
• Example

(3 input variables  leading to have 8 different input cases (23=8) for the output )

32
3.7 Evaluating Logic-Circuit Outputs (cont.)

33
 3.7 Evaluating Logic-Circuit Outputs (cont.)

Analysis Using a Truth Table:

(4 input variables  leading to

have 16 different input cases
(24=8) for the output )

34
 3.8 Implementing Circuits from Boolean Expressions
• A circuit that was defined by . . , we would immediately know that all
that was needed was a three-input AND gate.
• A circuit that was defined by , we would use a two-input OR gate
with an INVERTER on one of the inputs.

35
 3.8 Implementing Circuits from Boolean Expressions (cont.)

Draw the circuit diagram to implement the expression

36
 3.9 “NOR” Gates and “NAND” Gates
• NOR Gate
• It is the same as the OR gate symbol except that it has a small
circle on the output for the inversion operation.
An OR gate output goes HIGH when any
input is HIGH  the NOR gate output
goes LOW when any input is HIGH.

(a)

(b) (c)
FIGURE - (a) NOR symbol; (b) equivalent circuit; (c) truth table
37
 3.9 “NOR” Gates and “NAND” Gates (cont.)
• Example
Determine the waveform at the output of a NOR gate for the input
waveforms shown in Figure

38
 3.9 “NOR” Gates and “NAND” Gates (cont.)

• NAND Gate: an AND gate followed by an INVERTER (i.e. a NOR gate)

A truth table

39
 3.9 “NOR” Gates and “NAND” Gates (cont.)
Examples: Determine the output waveform of a NAND gate

40
 3.10 Boolean Theorems
• Boolean algebra is used to help analyze a logic circuit and express its operation
mathematically.
• The various Boolean theorems (rules) are to simplify logic expressions and logic
circuits.

41
Single-variable theorems
 3.10 Boolean Theorems (cont.)
• Multivariable theorems
(hoán đổi)
called the commutative laws
(kết hợp)
the associative laws

(phân phối)
the distributive law

Proved by trying all possible cases for and .

42
 3.10 Boolean Theorems (cont.)
• Multivariable theorems

43
 3.10 Boolean Theorems (cont.)
• Multivariable theorems

44
 3.10 Boolean Theorems (cont.)
• Multivariable theorems

45
 3.10 Boolean Theorems (cont.)
• Proving a Boolean equation
• Deriving using theorems
• Using truth tables
• (Different from general algebra, only limited values/combination in
Boolean algebra (including OR, AND and NOR))
• Using your reasoning

46
 3.11 DeMorgan’s Theorems
• DeMorgan’s theorems are extremely useful in simplifying expressions for a
product or sum of variables inverted.

For example, let’s apply DeMorgan’s theorems to the expression as follows:

47
 3.11 DeMorgan’s Theorems (cont.)
• Examples

48
 3.11 DeMorgan’s Theorems (cont.)
• DeMorgan’s theorems are easily extended to more than two variables.

• Implications of DeMorgan’s Theorems

FIGURE - (a) Equivalent circuits implied by theorem (16);

(b) Alternative symbol for the NOR function. 49
 3.11 DeMorgan’s Theorems (cont.)
• Implications of DeMorgan’s Theorems

FIGURE - (a) Equivalent circuits implied by theorem (17);

(b) Alternative symbol for the NAND function.

50
 3.11 DeMorgan’s Theorems (cont.)

̅ C

3. ̅

51
SUMMARY (1)

52
SUMMARY (2)

53
 REVIEW QUESTIONS
Q1

Q2

b.

54
 REVIEW QUESTIONS (cont.)
Q3

f’
1
0
1
0
0
1
0
0

55
 REVIEW QUESTIONS (cont.)
Q4

56
 REVIEW QUESTIONS (cont.)
Q5

Q6

57
REVIEW QUESTIONS (cont.)

58
REVIEW QUESTIONS (cont.)

59
REVIEW QUESTIONS (cont.)

60
REVIEW QUESTIONS (cont.)

61
REVIEW QUESTIONS (cont.)

62
REVIEW QUESTIONS (cont.)

63
REVIEW QUESTIONS (cont.)

64
REVIEW QUESTIONS (cont.)

65
HOME WORK!!!

66
HOME WORK!!! (cont.)

FIGURE 3-53 67
HOME WORK!!! (cont.)

68
HOME WORK!!! (cont.)

69
HOME WORK!!! (cont.)

70
HOME WORK!!! (cont.)

71
 15-MINUTE QUICK TEST

Q1. For each of the following circuits,

i. Find an algebraic expression.
ii. Simplify this algebraic expression and put it in SOP form.

72
73
VGU
VIETNAMESE-GERMAN UNIVERSITY

Bui Minh Duong

Lecturer in Electrical Power System
EEIT program, Faculty of Engineering
Email: duong.bm@vgu.edu.vn
Mobile phone: 0918163356