24CSE101: DIGITAL

DESIGN
 THE IMPORTANCE OF
DIGITAL LOGIC
Most of electronic devices consist of two integrated
systems

Hardwar Softwar
e e
Circuits that execute Programs that control
the program hardware
commands to execute user wishes
To learn more about how To learn how to design
to design this you need to this you need to study
study Digital Logic Design Computer Science

2
 COURSE OBJECTIVES
Why Digital Logic Design?

●Understand the theory of operation for most of

digital electronic
devices,

●Analyze how a digital computer performs

complex operations,
based on simply manipulating bits (zeros and
ones),

●Design digital logic systems! 3

 TEXT BOOK
TEXT BOOKS:
T1 Morris mano, Michael D Ciletti ,”Digital Design” , 4/e,, PEA

4
 COURSE OUTLINE

1. Introduction
2. Gate-Level Minimization
3. Combinational Logic
4. Synchronous Sequential
Logic
5. Registers and Counters
6. Memories and
Programmable Logic
5
FLASHBACK ON
DIGITAL LOGIC DESIGN
HISTORY

6
 HOW DID IT
ALL START?
1850: George Boole invents Boolean
algebra 11
 HOW DID IT ALL START?

1946: ENIAC, the first electronic computer is

developed

●18,000 vacuum tubes

●5,000 operations per second 12

●1,000 square feet

●It really cost a lot of power to turn on the
switch!
Dr. Haitham Omran, Dr. Wassim Alexan 13
 AND IT WENT ON…

1947: Shockley, Brattain,

and
Bardeen invent the
transistor
●Replaces vacuum tubes
●Enables integration of
multiple devices into one
package

1956: They received the

Nobel Prize in Physics
1
 AND IT WENT ON…
1955: TRADIC: AT&T Bell Labs
announced the first fully
transistorized computer
1958: The1st (2D) Integrated
Circuit (Kilby received the
Nobel prize in 2000)
•Transistor, resistors and
capacitors on the same piece
of semiconductor
•Interconnects between
components is
not integrated
1
•Low connectivity between
 AND IT WENT ON…
1971: Intel’s 4004 1st
microprocessor

•Maximum clock rate is 740 kHz

•46300 to 92600 instructions per
second

Now: Intel® Core™ i7-6700K Processor

(8M Cache, up to 4.20 GHz)
1
 APPLICATIONS OF DIGITAL
LOGIC DESIGN
Conventional computer design
●CPUs, busses, peripherals
Networking and communications
●Phones, modems, routers
Embedded products
●Cars
●Toys
●Appliances
●Entertainment devices: MP3 players, gaming
consoles (PlayStation,
Xbox, etc…) 1
 BUT WHAT IS THE
MEANING OF DIGITAL
LOGIC DESIGN?

1
 WHAT IS DIGITAL?

Digital describes any system based on discontinuous data or

events. Computers are digital machines because at their most
basic level they can distinguish between just two values, 0 and
1, or off and on. There is no simple way to represent all the
values in between, such as 0.25. All data that a computer
processes must be encoded digitally, as a series of zeroes and
ones.

1
 ANALOG VS. DIGITAL
An analog signal is any variable signal continuous in
both time and
amplitude. e.g. Sound

Example:
A typical analog device is a clock in which the hands move continuously
around the face. Such a clock is capable of indicating every possible
time of day. In contrast, a digital clock is capable of representing only a
finite number of times (every tenth of a second, for example).

1
 WHY DIGITAL?

Digital systems are easier to design and

implement than
analog systems.

1
 WHAT IS LOGIC DESIGN?

Given a specification of a problem, come up

with a way of solving it, choosing
appropriately from a collection of available
components, while meeting some criteria for
size, cost, power, etc…

1
 WHAT ARE THE BASIC UNITS
USED TO BUILD
THESE DIGITAL CIRCUITS?
■ Digital Logic Gates!

■ Digital Logic Gates are the basic

units to 23

build any digital circuit

DIGITAL A Digital
System
LOGIC GATES B

•Digital logic circuits are hardware components that

manipulate
binary information (we call them gates)
•A digital system is basically a black box with a
minimum of one input and one output
•Inside this box, are millions of switches called
transistors
•Transistors perform different functions according
to inputs 2
 Digital Logic levels

What is the physical meaning of logic 0

and
logic 1? How can we recognize them?

2
 DIGITAL LOGIC LEVELS
(CONT.)
Electrical Signals (voltages or
currents) that exist throughout a
digital system are in either of two
recognizable
Voltage values (logic 1 or logic 0)
5
Logic – 1 range
Intermediate
region, 2
crossed only Transition (occurs
during state 0.8 between the two limits)
transition Logic – 0 range
0
Time
2
 Boolean Algebra

What is the difference between the

Boolean algebra and arithmetic
algebra?

The first obvious difference is that in

Boolean algebra we have only (+) and (∙)
operators, but we do not have subtraction
(-) or division (/) like in mathematics
27
 BINARY LOGIC

You should distinguish between binary logic

and binary
arithmetic. Carry
Two digits
●Arithmetic variables are numbers that consist of
many digits.
Arithmetic 1 + 1 = 10
●A binary logic variable is always
either 1 or 0.
Binary 1+1=1
2
 DIGITAL LOGIC GATES
There are three fundamental logical
operations, from which all other functions,
no matter how complex, can be derived.
These Basic functions are named:
●AND,
●OR,
●NOT (INVERTER).
Each of these has a specific symbol
and a clearly-defined behavior

2
 BASIC DIGITAL LOGIC
GATES (CONT.)
X Z
AND Gate AN
Y D
●Represented by any of the
following Symbol
diagram
notations:
●X AND Y
●X . Y
●X Y
●Function definition: AND
X Y
Z=1 only if X=Y=1
0 otherwise Switch
representation
2
 BASIC DIGITAL LOGIC
GATES (CONT.)
X O Z
OR Gate Y R
●Represented by any of the following Symbol
notations: diagram
●X OR Y
●X + Y
●X v Y X
●Function
OR
definition:
1 if X=1 or Y =1 or
Z both X=Y=1
= Y
0 if X=Y=0 Switch
representation
2
 BASIC DIGITAL LOGIC
GATES (CONT.)
NOT (Inverter) Gate
●Represented by a bar over the X NO Z
T
variable
Symbol
X diagram
Function
X
definition:
Z is what X is not
NOT
It is also called the z
complement operation, Switch
as it changes 1s into 0s representation
and 0s into 1s.
2
 LOGIC GATES TIMING
DIAGRAM
•Timing diagrams illustrate the response of any gate to all
possible input signal combinations.
•The horizontal axis of the timing diagram represents time and
the vertical axis represents the signal as it changes between the
two possible voltage levels 1 or 0

2
 DIGITAL LOGIC GATES
(CONT.)
Gates can have more than
2 inputs

Other Types of logic

gates

3
HOW TO DESCRIBE A LOGIC
SYSTEM?
By using one of the following two
methods:
•A Truth Table
•A Boolean Expression

3
 TRUTH TABLES

A Truth Table is a table of combinations of the binary variables

showing the relationship between the different values that the
input variables take and the result of the operation (output).
The number of rows in the Truth Table is
2n, where n = number of input
variables in the function.
The binary combinations are obtained from the binary number by
counting from 0 to 2n −1 X Z
Example: AND gate with 2 X Y Z
Y
inputs 0 0 0
n=2 All input 0 1 0
output
combinations 1 0 0
The truth table has 22 rows =
1 1 1
4
The binary combinations are Truth table of an AND
from 0 to (22-1=(3)) gate 3
 BOOLEAN EXPRESSIONS
We can use these basic operations to form more
complex
expressions:
f(x,y,z) = (x + y’)z + x’

Some terminology and notation:

●f is the name of the function.
●(x,y,z) are the input variables, each representing 1 or
0. Listing the inputs is optional, but sometimes helpful.
●A literal is any occurrence of an input variable or its
complement.
The function above has four literals: x, y’, z, and x’.
Precedencies are important, but not too difficult
●NOT has the highest precedence, followed by AND,
3
and then OR
HOW TO GET THE
BOOLEAN EXPRESSION
FROM THE TRUTH
TABLE?

3
BOOLEAN EXPRESSIONS FROM
TRUTH TABLES
Each 1 in the output of a truth table specifies one term in the
corresponding Boolean expression

The expression can be read off by inspection…

A B C F
F is true when:
0 0 0 0
A is false AND B is true AND C is false OR 0 0 1 0
0 1 0 1
A is true AND B is true AND C is true 0 1 1 0
1 0 0 0
1 0 1 0
F = A’BC’ + ABC
1 1 0 0
Sum-of-Products-Algorithm 1 1 1 1

3
ANOTHER EXAMPLE

A F
F=?
0 0
B
1
0 1
C
0 F= A’B’C +
0 1 A’BC’ +
0 0
0
AB’C’ +
0 1 ABC
1
0

0 3
 BASIC LOGIC GATES

• We have defined three basic logic gates and

operators

•Also, we could build any digital circuit from those

basic
logic gates
•In digital Logic, we are not using normal
mathematics we are using Boolean algebra

So, we need to know the laws & rules of

Boolean 3
LAWS & RULES OF BOOLEAN
ALGEBRA
The basic laws of Boolean algebra
•The commutative law
•The associative law
•The distributive law

3
 COMMUTATIVE LAW
The commutative law of addition for two
variables is
A+B = B+A
A
B
A+B
≡ B
A
B+A

The commutative law of multiplication for

two variables is
AB = BA A
B
AB B
≡ A
BA

3
 ASSOCIATIVE LAW
The associative law of addition for 3
variables is
A+(B+C) = (A+B)+C A+B
≡
A A+(B+C) A
B B (A+B)+C
C B+C C

The associative law of multiplication for 3

variables is
A(BC) A= (AB)C A(BC) A
B B (AB)C AB
C BC C
≡
4
 DISTRIBUTI
VE LAW
The distributive law for
multiplication is
A(B+C) = AB + AC AB
B+C A
B
C B
X
A A
AC
C
X=A(B+C) X=AB+AC
The distributive law
for addition is A+
BC A A+B
B (B.C) = (A+B)(A+C)
B X
C
A
X ≡ A
A+C
C
X=A+(B.C) X=(A+B)
 BASIC THEOREMS OF
BOOLEAN ALGEBRA
A.+ 0 = A 7.A ∙ A =
A
2.A +1 = 1
9.A∙=
8.A =
AA
3.A ∙ 0 =
0 + AB = A
10.A
0
11.A + AB = A + B
4.A ∙1 = A
12.( A + B)( A + C) = A +
A.A + A =
BC
A and C can represent a single variable or a
A, B,
combination of variables.
B.A + A = 4
 DUALITY PRINCIPLE
A Boolean equation remains valid if we take the
dual of the
expressions on both sides of the equals sign
The dual of an expression is reached as follows:
●Interchange any 1 with a 0 (and vice-versa)
●Interchange any AND (∙) with an OR (+) (and vice- Duality Duality
X+0=X X⋅1 = X X + X ⋅Y =X X⋅ (X + Y) = X
versa) X + X⋅Y = X X ⋅ (X + Y) = X

Duality
Duality
X+X=X X⋅X = X

4
 DEMORGAN’S LAW
A⋅ B = A + B
≡

A + B = A⋅B

≡
4
8
EXA
MPLE
Get the logic function from the following truth table
and implement it using basic logic gates (AND, OR,
NOT)

A B P P = A’ B’ + A’B + A
B’
0 0 1
0 1 1 • It needs two inverters +
1 0 1 three AND + two OR
gates
1 1 0 = 7 gates to implement
Can we make this circuit better? the
• Cheaper: fewer gates The answer in the simplification of
function
• Faster: fewer delays from inputs to the logic function
outputs
4
9
 SIMPLIFICATION OF THE
LOGIC FUNCTION
A’B’ + A’B +
AB’ = A’ * (B’ + B) + A *
B’ (Distributivity

= A’ * (B + B’) + A * )
=
B’ A’ * 1 + A * (x + x’ = 1)
B’ (Commutativi
(x +x’y)=(x+x’)(x+y)
= A’ + (A * B’) ty)
(Distributivity)
= (A’ + (De
B’) Morgan’s)
= (A 1 GATE (NAND)
B)’ ONLY

Simplification rules allow us here to optimize the design and use a

single gate!
5
0
 DERIVED GATES
NAND NOR XOR XNOR
AND-Invert OR-Invert Odd Even

X Y Z X Y Z X Y Z X Y Z
0 0 1 0 0 1 0 0 0 0 0 1
0 1 1 0 1 0 0 1 1 0 1 0
1 0 1 1 0 0 1 0 1 1 0 0
1 1 0 1 1 0 1 1 0 1 1 1

5
1