Digital Logic Design

CHAPTER 1
Boolean Algebra and Logic Gates

Slide 1
 Boolean Constants and 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,
OR AND,
AND and NOT.
NOT
Slide 2
 Truth Tables
• The truth table is a tabular representation of a logic function.
• It gives the value of the function for all possible combinations of values
of the variables.
• 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.
• Consider the expression,
• F (A, B) = A.B + A.B A B F
• The truth table for this function is given by 0 0 0
0 1 0
1 0 0
The information contained in the truth table
and in the algebraic representation of the 1 1 1
function are the same.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 3
 Truth Tables

• Total number of possible combinations of binary

inputs
N = 2n
• For two input variables:
N = 22 = 4 combinations
• For three input variables:
N = 23 = 8 combinations
• For four input variables:
N = 24 = 16 combinations

Slide 4
 Logic Gates

• Inverter
• AND Gate
• OR Gate
• Exclusive-OR Gate
• NAND Gate
• NOR Gate
• Exclusive-NOR Gate

Slide 5
 The Inverter

Truth table Boolean expression

0 = LOW
1 = HIGH

The output of an inverter is always the

complement (opposite) of the input.

Slide 6
 The AND Gate

Boolean expression

Truth table
Same as Boolean
0 = LOW
1 = HIGH multiplication Pulsed waveforms

The output of an AND gate is HIGH only

when all inputs are HIGH.

Slide 7
 The AND Gate

3-Input AND Gate

4-Input AND Gate

Slide 8
 The OR Gate

Boolean expression

Truth table Same as Boolean

0 = LOW
1 = HIGH
addition, except
Pulsed waveforms
no carry

The output of an OR gate is HIGH

whenever one or more inputs are HIGH

Slide 9
 The OR Gate

3-Input OR Gate

4-Input OR Gate

Slide 10
 The NAND Gate

Boolean expression

Truth table
0 = LOW
1 = HIGH
Pulsed waveforms

The output of a NAND gate is HIGH

whenever one or more inputs are LOW.

Slide 11
 The NAND Gate

3-Input NAND Gate 4-Input NAND Gate

Slide 12
 The NOR Gate

NOR is equivalent to NOT/OR

Boolean expression
Truth table
0 = LOW
1 = HIGH
Pulsed waveforms

The output of a NOR gate is LOW

whenever one or more inputs are HIGH.

Slide 13
 The NOR Gate

3-Input NOR Gate 4-Input NOR Gate

Slide 14
 Exclusive-OR Gate

Boolean expression
Truth table
0 = LOW
1 = HIGH
Pulsed waveforms

The output of an XOR gate is HIGH

whenever the two inputs are different.

Slide 15
 Exclusive-NOR Gate

Boolean expression

Truth table
0 = LOW
1 = HIGH
Pulsed waveforms

The output of an XNOR gate is HIGH

whenever the two inputs are identical.

Slide 16
 Review of Basic Logic Gates

• Inverter
• AND Gate
• OR Gate
• Exclusive-OR Gate
• NAND Gate
• NOR Gate
• Exclusive-NOR Gate

Slide 17
 Fixed-Function Logic

• CMOS
– Complementary Metal-Oxide Semiconductor
• TTL
– Transistor-Transistor Logic
• Logic Functions operate the same in
CMOS and TTL.
• Different voltage, power, speed

Slide 18
 CMOS

• DC Voltages: 5 V, 3.3 V, 2.5 V, 1.8 V

• Reducing voltage reduces power
V2
P=
R
• Reducing voltage from 5 V to 3.3 V
reduces power by 34%.

TTL
●
DC Voltage is 5 V
●
Not sensitive to electrostatic discharge.

Slide 19
 Basic Characteristics of Digital ICs

The transistor-transistor logic (TTL) family

consists of subfamilies shown here:

Differences between the TTL devices is limited to electrical

characteristics such as power dissipation & switching speed.
Pin layout and logic operations are the same.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 20
 Basic Characteristics of Digital ICs
VCC for TTL devices is normally +5 V.

Power (VCC) and

ground connections
are required for
chip operation.

TTL
INVERTER

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 21
 Basic Characteristics of Digital ICs

The Complimentary Metal-Oxide Semiconductor (CMOS)

family consists of several series

CMOS devices perform the same function as, but are not
necessarily pin for pin compatible with TTL devices.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 22
 Basic Characteristics of Digital ICs
VDD for CMOS
Power (VDD) and
devices can be ground connections
from +3 to +18 V. are required for
chip operation.

CMOS
INVERTER

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 23
Typical dual in-line (DIP) and small-outline (SOIC) packages showing pin numbers and
basic dimensions.

Slide 24
Pin configuration diagrams for some common fixed-function IC gate
configurations.

Slide 25
Figure 3–65 The partial data sheet for a 74LS00.

Slide 26
 Boolean Operations and Expressions

• Addition • Multiplication
0+0=0 0*0=0
0+1=1 0*1=0
1+0=1 1*0=0
1+1=1 1*1 =1

Slide 27
 Laws Boolean Algebra

• Commutative Laws
• Associative Laws
• Distributive Law

Slide 28
 Laws of Boolean Algebra

• Commutative Law of Addition:

A+B=B+A

• Commutative Law of Multiplication:

A*B=B*A

Slide 29
 Laws of Boolean Algebra
• Associative Law of Addition:
A + (B + C) = (A + B) + C

• Associative Law of Multiplication:

A * (B * C) = (A * B) * C

Slide 30
 Laws of Boolean Algebra

• Distributive Law:
A(B + C) = AB + AC

Slide 31
Rules of Boolean Algebra

Slide 32
 Rules of Boolean Algebra

• Rule 1

OR Truth Table

Slide 33
 Rules of Boolean Algebra

• Rule 2

OR Truth Table

Slide 34
 Rules of Boolean Algebra

• Rule 3

AND Truth Table

Slide 35
 Rules of Boolean Algebra

• Rule 4

AND Truth Table

Slide 36
 Rules of Boolean Algebra

• Rule 5

OR Truth Table

Slide 37
 Rules of Boolean Algebra

• Rule 6

OR Truth Table

Slide 38
 Rules of Boolean Algebra

• Rule 7

AND Truth Table

Slide 39
 Rules of Boolean Algebra

• Rule 8

AND Truth Table

Slide 40
 Rules of Boolean Algebra

• Rule 9

Slide 41
 Rules of Boolean Algebra

• Rule 10: A + AB = A

AND Truth Table OR Truth Table

Slide 42
 Rules of Boolean Algebra

• Rule 11: A+ A B= A+B

AND Truth Table OR Truth Table

Slide 43
 Rules of Boolean Algebra

• Rule 12: (A + B)(A + C) = A + BC

AND Truth Table OR Truth Table

Slide 44
DeMorgan’s Theorem

Slide 45
 DeMorgan’s Theorems

• Theorem 1

XY = X +Y

• Theorem 2
X +Y = X Y
Remember:
“Break the bar,
change the sign”

Slide 46
 DeMorgan’s Theorems

Equivalent circuits implied by Theorem

The alternative symbol

for the NAND function.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 47
 DeMorgan’s Theorems

Equivalent circuits implied by Theorem

The alternative symbol

for the NOR function.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 48
 Universality of NAND and NOR Gates
How combinations of NANDs
NAND or NORsNOR are
used to create the three logic functions.

It is possible, however, to implement any logic expression using only

NAND gates and no other type of gate, as shown.

Digital Systems: Principles and Applications, 11/e

Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 49
 Universality of NAND and NOR Gates
How combinations of NANDs
NAND or NORsNOR are
used to create the three logic functions.

NOR gates can be arranged to implement

any of the Boolean operations, as shown.
Digital Systems: Principles and Applications, 11/e
Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss Slide 50
A logic circuit showing the development of the Boolean expression for the output.

Combinational Circuit Ch-2

Slide 51