LESSON - 05

Introduction to Combinational Logic Circuits

By

Dr Moses Ubaru

November 22, 2 Introduction to Digital Design Page 1

023
 Overview

 A QUICK TEST:
 How many days of the week begin with the
letter “T”? Explain
 Answers:
a) 1
b) 2
c) 3
d) 4
e) 5
f) 6
g) 7

November 22, 2 Introduction to Digital Design Page 2

023
 SOLUTION TO THE QUICK TEST:
 How many days of the week begin with the letter “T”?
Explain.

 Answers:
 Your answer could be 2, 3,4,5,6, or 7……
 Today, Tomorrow, Tuesday, Thursday, Third day,
Thisday,
 Mark = ?
 If your answer is 2 ………….. Mark = 50%
 If your answer is 4,5 ………… Mark = 100%
 On the “Third day Christ rose from the dead”
November 22, 2 Introduction to Digital Design Page 3
023
  Luke 24:7 Saying, The Son of man must be
delivered into the hands of sinful men, and
be crucified, and the third day rise again.

November 22, 2 Introduction to Digital Design Page 4

023
 Overview

 Introduction
 Boolean Equations and Boolean Algebra
 From logic to Gates
 Karnaugh Map Minimization
 Combinational Building Blocks
[Multiplexers and Decoders]
 Timing

November 22, 2 Introduction to Digital Design Page 5

023
 Recommended Text Book

 Digital Design and Computer Architecture

By David Money Harris
and Sarah L. Harris
[Pages 51 to 165]

November 22, 2 Introduction to Digital Design Page 6

023
 Introduction

 In digital electronics, a circuit is a network that

processes discrete valued variables and a circuit can
be viewed as a black box with:
> One or more discrete-valued input terminals
> One or more discrete-valued output terminals
> A functional specification that describes the
relationship between the inputs and the outputs
> A timing specification that describes the delay
between input changes and outputs responding
November 22, 2 Introduction to Digital Design Page 7
023
 Introduction
 Circuits are composed of nodes and elements

 An element is itself a circuit with inputs, outputs

and a specification

 A node is a wire, whose voltage conveys a discrete-

valued variable

 Nodes are classified as input, output or internal

November 22, 2 Introduction to Digital Design Page 8
023
 Introduction

 Inputs receive values from external world

 Outputs deliver values to external world

 Internal nodes are wires that are not inputs or

outputs

November 22, 2 Introduction to Digital Design Page 9

023
 Introduction
 The figure below illustrates a circuit with three
elements E1, E2, and E3, and six nodes.
 Nodes A, B, and C are inputs, nodes Y and Z are
outputs while node n1 is internal

A E1 n1
E3 Y
B

C E2 Z

November 22, 2 Introduction to Digital Design Page 10

023
 Introduction

 INTRODUCTION

November 22, 2 Introduction to Digital Design Page 11

023
 Introduction

 Which line is longer?

November 22, 2 Introduction to Digital Design Page 12

023
 Introduction

 How many Fs do you see in the text below?

 FINISHED FILES ARE THE RESULT OF YEARS

OF SCIENTIFIC STUDY COMBINED WITH THE
EXPERIENCE OF YEARS.

 After you counted the Fs, scroll down...

November 22, 2 Introduction to Digital Design Page 13

023
 Introduction

 Solution:
 How many did you count? 3?
 Wrong, there were 6.
 Don't believe it?
 Scroll back up and check.
 Our brains are trained to overlook the word OF.
 If you saw all 6 Fs right away, you're a genius.
 Most people see only 3 Fs. Some people see 4.

November 22, 2 Introduction to Digital Design Page 14

023
 Introduction

How many people can you identify?

You should be able to see the two old men, the two musicians and a lady .
November 22, 2 Introduction to Digital Design Page 15
023
 Introduction
 The main purpose of this section is to acquaint you
with the basic concepts involved in logic design and to
give you a general understanding of the basic circuit
configurations used to construct computer systems.

 We shall examine the behaviors of the standard logical

operators such as AND, OR, and NOT and look at the
logic gates that implement them.

November 22, 2 Introduction to Digital Design Page 16
023
 Introduction
 Digital logic is divided into two categories:
 Combinational logic and Sequential logic.

 Combinational logic devices, such as adders,

decoders, and multiplexers, produce outputs that are
based strictly on the current inputs.
 The AND, OR, and NOT gates are the building
blocks for combinational logic circuits, although
universal gates, such as NAND and NOR, could
also be used.
November 22, 2 Introduction to Digital Design Page 17
023
 Introduction

 Sequential logic devices, such as registers, counters,

and memory, produce outputs based on the
combination of current inputs and the current state
of the circuit.

 Sequential circuits are built using SR, D, and JK

flip-flops which are the building blocks necessary
for computer systems.

November 22, 2 Introduction to Digital Design Page 18

023
 Introduction

 Digital circuits are classified as Combinational or

Sequential
 A combinational circuit is one in which the outputs
depend only on the current values of the inputs
 A sequential circuit is one in which the outputs are
determined by both the current and the previous values of
the inputs
 A combinational circuit is said to be memoryless
while a sequential circuit has memory

November 22, 2 Introduction to Digital Design Page 19

023
 Introduction
 There exists very strong relationship between Boolean logic
and the actual physical components of any computer system.

 The lessons provide sufficient background for you to

understand the basic motivation underlying computer design
and implementation.

 Understanding how Boolean logic affects the design of

computer system components will allow you to use, from a
programming perspective, any computer system more
effectively.
November 22, 2 Introduction to Digital Design Page 20
023
 Combinational Logic (cont.)

November 22, 2 Introduction to Digital Design Page 21

023
 Combinational Logic (cont.)
 Combinational logic has no memory!
 Outputs are only function of current input combination
 Nothing is known about past events
 Repeating a sequence of inputs always gives the same
output sequence

 Sequential logic (covered later) does have

memory
 Repeating a sequence of inputs can result in an entirely
different output sequence
November 22, 2 Introduction to Digital Design Page 22
023
 Boolean Equations or Switching Algebra

 Based on Boolean Algebra

 Developed by George Boole in 1854
 Formal way to describe logic statements and
determine truth of statements

 Only has two-values domain (0 and 1)

 Huntington’s Postulates define the underlying

assumptions
November 22, 2 Introduction to Digital Design Page 23
023
 Huntington’s Postulates

 Closure
If X and Y are in set (0,1)
then operations X+Y and X· Y are also in set (0,1)

 Identity
X+0=X
X·1=X

November 22, 2 Introduction to Digital Design Page 24

023
 Huntington’s Postulates

 Commutation
X+Y=Y+X
X·Y=Y·X

 Association
(A + B) + C = A + (B + C)
(A· B) · C = A· (B · C)

November 22, 2 Introduction to Digital Design Page 25

023
 Huntington’s Postulates (cont.)

 Distribution
A · (B + C + …..) = ( A · B) + (A · C) + ….
A + (B · C . ……) = ( A + B) · (A + C) · ……

 Absoption
X  (XY)  X
X  (X  Y)  X
Note that for each property, one form is the dual of the other;
(0s to 1s, 1s to 0s, ·s to +s, +s to ·s)
November 22, 2 Introduction to Digital Design Page 26
023
 Huntington’s Postulates (cont.)

 Complement

X  X 1
XX 0

Note that for each property, one form is the dual of the other;
(0s to 1s, 1s to 0s, ·s to +s, +s to ·s)
November 22, 2 Introduction to Digital Design Page 27
023
 Switching Algebra Operations
 Three common Boolean operators are AND, OR, and NOT.
 A Boolean operator can be completely described using a Truth Table

 Truth Table is a table that specifies all possible values for the inputs, and the resulting output values of the operation for all
possible combinations of these inputs.

November 22, 2 Introduction to Digital Design Page 28

023
 Switching Algebra Operations - Not

 Unary complement or inversion operation

 Usually shown as overbar (X ), other forms

are ~X, X’

X X
0 1 X X
1 0

November 22, 2 Introduction to Digital Design Page 29

023
 Switching Algebra Operations - AND

 Also known as the conjunction operation;

output is true (1) only if all inputs are true

 Algebraic operators are ‘·’, ‘&’, ‘’

X Y X·Y
0 0 0
0 1 0
1 0 0
1 1 1

November 22, 2 Introduction to Digital Design Page 30

023
 Switching Algebra Operations - OR

 Also known as the disjunction operation;

output is true (1) if any input is true

 Algebraic operators are ‘+’, ‘|’, ‘’

X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1

November 22, 2 Introduction to Digital Design Page 31

023
 Definition of Terms
 Logic Expression - a mathematical formula
consisting of logical operators and variables

 Logic Operator - a function that gives a well

defined output according to switching algebra

 Logic Variable - a symbol representing the two

possible switching algebra values of 0 and 1

 Logic Literal - the values 0 and 1 or a logic

variable or it’s complement
November 22, 2 Introduction to Digital Design Page 32
023
 Definition of Terms
 Logic Literal - the values 0 and 1 or a logic variable or it’s
complement
eg. The term ABC consists of literals: A, B, and C

 Product term – The term that comprises solely product of

literals. ABC is a product term but A(B + C) is not because of the
+ sign

 Sum term. The term that consists solely of the sum of literals.

(A + B + C) is a sum term but

A(B + C) is not a sum term because of the implied

multiplication.
November 22, 2 Introduction to Digital Design Page 33
023
 Logic Expressions - Precedence
 Like standard algebra, switching algebra operators have a
precedence of evaluation

 NOT operations have the highest precedence

 AND operations are next
 OR operations are lowest

 Parentheses explicitly define the order of operator

evaluation.

 If in doubt, USE PARENTHESES!

November 22, 2 Introduction to Digital Design Page 34

023
 Logic Expression Minimization
 Goal is to find an equivalent of an original
logic expression that:
 a) has fewer variables per term
 b) has fewer terms
 c) needs less logic to implement

 There are three main manual methods

 Algebraic minimization
 Karnaugh Map minimization
 Quine-McCluskey (tabular) minimization

November 22, 2 Introduction to Digital Design Page 35

023
 Algebraic Minimization
 Process is to apply the switching algebra postulates,
laws, and theorems to transform the original expression
 Hard to recognize when a particular law can be
applied

 Difficult to know if resulting expression is truly

minimal

 Very easy to make a mistake

 Incorrect complementation
 Dropped variables

November 22, 2 Introduction to Digital Design Page 36

023
 Switching Algebra Laws and Theorems

Involution:

X X  

November 22, 2 Introduction to Digital Design Page 37

023
 Switching Algebra Laws and Theorems
Identity:

X 11 X0  0
X0X X 1  X

Association:
(A + B) + C = A + (B + C)

(A· B) · C = A· (B · C)

November 22, 2 Introduction to Digital Design Page 38

023
 Switching Algebra Laws and Theorems

Idempotence:

XX X
XX X

November 22, 2 Introduction to Digital Design Page 39

023
 Switching Algebra Laws and Theorems

Adjacency:
(Very Powerful Tool)

X Y  X Y  X
X  Y   X  Y   X
November 22, 2 Introduction to Digital Design Page 40
023
 Switching Algebra Laws and Theorems
Adjacency:
(Very Powerful Tool)

X Y  X Y  X
X  Y   X  Y   X
PROOF:
XY + XY’ = X(Y + Y’)
=X
The product of Coefficients of Y and Y’ is X
X replaces all the terms that contain X

November 22, 2 Introduction to Digital Design Page 41

023
 Switching Algebra Laws and Theorems

Absorption:

X  X  Y   X
X  X  Y   X

November 22, 2 Introduction to Digital Design Page 42

023
 Switching Algebra Laws and Theorems

Simplification Rule:

 
X  XY  X  Y
X  X  Y   X  Y

November 22, 2 Introduction to Digital Design Page 43

023
 Switching Algebra Laws and Theorems

Simplification:
Proof:
X + X’Y = X(1 + Y) + X’Y
= X + XY + X’Y
= X + Y(X + X’)
= X + Y

Thus X + X’Y = X + Y

The Product of the coefficients of X and X’Y is Y

Y replaces all terms that contain Y

November 22, 2 Introduction to Digital Design Page 44

023
 Switching Algebra Laws and Theorems

Consensus:

XY  XZ  Y Z  XY  XZ

X  Y   X  Z  Y  Z   X  Y   X  Z 

November 22, 2 Introduction to Digital Design Page 45

023
 Switching Algebra Laws and Theorems
Consensus: Proof
Prove that :
A B  A C  BC  A B  A C

Proof:
AB + A’C = AB(BC +1) + A’C(BC + 1)
= ABC + AB + A’BC + A’C
= BC(A + A’) + AB + A’C
= BC + AB + A’C
= AB + A’C + BC

November 22, 2 Introduction to Digital Design Page 46

023
 DeMorgan’s Theorem:

November 22, 2 Introduction to Digital Design Page 47

023
 Switching Algebra Laws and Theorems

DeMorgan’s Theorem:

X Y XY
X Y  X  Y

General form:

F(, , X1 , ... X n )  G( , , X1 , ... X n )

November 22, 2 Introduction to Digital Design Page 48

023
 DeMorgan’s Theorem

November 22, 2 Introduction to Digital Design Page 49

023
 DeMorgan’s Theorem and Bubble Pushing

A Z Z
A
Is equivalent to
B
B

F A F
A Is equivalent to
B B

November 22, 2 Introduction to Digital Design Page 50

023
 DeMorgan’s Theorem and Bubble Pushing

A F A F
Is equivalent to
B B

Z A Z
A Is equivalent to
B B

November 22, 2 Introduction to Digital Design Page 51

023
 DeMorgan’s Theorem and Bubble Pushing
Implementation using AND and OR gates

A
B

C
D

POS expressions can usually be implemented using only NAND gates

As demonstrated in the next slides

November 22, 2 Introduction to Digital Design Page 52

023
 DeMorgan’s Theorem and Bubble Pushing
Implementation of the function using only NAND gates

A
B

C
D

Z Z
I s equivalent to

November 22, 2 Introduction to Digital Design Page 53

023
 DeMorgan’s Theorem and Bubble Pushing
Implementation of the function using only NAND gates

A
B

C
D

Z Z
I s equivalent to

November 22, 2 Introduction to Digital Design Page 54

023
 Implementation of the function using only NOR gates

Similarly, applying ‘bubbles’ to the input of an AND gate

yields
A Z Z
I s equivalent to
B

A
B

C
D

November 22, 2 Introduction to Digital Design Page 55

023
 Implementation of the function using only NOR gates

Generally, POS expressions can be easily implemented using only

NOR gates Only

A
B

C
D

A
B F

C
D

November 22, 2 Introduction to Digital Design Page 56

023
 Implementation of the function using only NOR gates

A
B

C
D

B
F
C

November 22, 2 Introduction to Digital Design Page 57

023
 TUTORIAL 2 EXERCISES

November 22, 2 Introduction to Digital Design Page 58

023
 EXERCISES

November 22, 2 Introduction to Digital Design Page 59

023
 EXERCISES
 Q3. Using DeMorgan equivalent gates and bubble
pushing techniques, redraw the circuit below so that
you can find the Boolean equation by inspection.
Write the Boolean equation.
A
B

C
D
A
Y
E

November 22, 2 Introduction to Digital Design Page 60

023
 EXERCISES
 Q4. Using DeMorgan equivalent gates and bubble
pushing techniques, redraw the circuit below so that
you can find the Boolean equation by inspection.
Write the Boolean equation.
A
B Y
C
D

F
G

November 22, 2 Introduction to Digital Design Page 61

023
 EXERCISES
 Q5. Determine the propagation delay and the
contamination delay of the following circuit using
the gate delays given in the next slide:

A
B Y
C
D

F
G

November 22, 2 Introduction to Digital Design Page 62

023
 Story
 Once upon a time, a sparrow flying south for the
winter encountered very cold weather.
 In a short time ice began to form on his wings and
he fell to earth in a barnyard.

 Almost frozen, a cow passed by and crapped on the

little sparrow.
 The manure warmed him and defrosted his wings.
 Warm and happy, able to breathe, he started to sing.
November 22, 2 Introduction to Digital Design Page 63
023
 Story
 Just then, a large cat came by and hearing the
chirping, investigated the sounds.

 The cat cleared away the manure, found the chirping

bird and ate him.

 Morals to the Story

 What lessons can you learn from the story?

November 22, 2 Introduction to Digital Design Page 64

023
 Story
 Morals to the Story
 1) Everyone who shits on you is not necessarily
your enemy.

 2) Everyone who gets you out of the shit is not

necessarily your friend.

 3)And, if you're warm and happy in a pile of shit,

keep your mouth shut!!! Arthur: unknown.
November 22, 2 Introduction to Digital Design Page 65
023
 Story
 Once upon a time, a sparrow flying south for the
winter encountered very cold weather.
 In a short time ice began to form on his wings and
he fell to earth in a barnyard.
 Almost frozen, a cow passed by and crapped on the
little sparrow.
 The manure warmed him and defrosted his wings.

 Warm and happy, able to breathe, he started to sing.

November 22, 2 Introduction to Digital Design Page 66
023