Digital System Design and Applications

What this course is all about?

Course specification
Lecture plan
Comparison of Digital and Analog signals/systems
All possible Boolean Functions of two variables
Boolean Laws and Theorems
DeMorgan’s Law
 How to study—DSDA
1. There will be two lectures and one lab every week
2. Assessment strategy
a) Quizzes—8
b) Assignments—several small one-day assignments and one
running project.
c) Labs—there will be more than ten labs
d) Three one-hourly tests
e) Final exam
3. Buy the textbook, Digital Systems –principles and applications
by Tocci, 9th edition.
4. Reference books:
a) John F. Wakerly, Digital Design: Principles and practices, 3rd
edition, Prentice Hall.
b) Randy H.Katz, Contemporary Logic Design , 2nd edition,
Pearson Education.
 How to study—DSDA

Lectures will be posted on the Intranet in advance

\\paf3\mohiuddin\Fall2010\EE1321

7. Regularity is extremely important to synch with the instructor

8. I highly encourage questions, ask questions before, during or
after the lecture.
9. Office hours:
1000-1200 hrs Monday and Wednesday. My office is next to the
office of Director, Administration.
 The Digital World

PCs
Laptop computer

smartcards

Mainframe/supercomputer

Router
CRT projector
Router

printer

Router
Television

Scanner

Data

PDA
Telephone
Fax
 The Digital World
• Digital Systems, especially computers, are driving the world
economy.
– The Internet is changing the way we communicate, shop,
learn, invest, and entertain ourselves.
• This is an amazingly fast moving business!!
– Processors double in speed every 18 months
– The Internet doubles in size every year
• Computers are the most amazing and complex things ever built
by mankind
– The Intel Pentium 4 has 55 million transistors
– It runs at 3 billion cycles per second
 Analog vs. Digital

V V
+5 +5
1 0 1

Time Time
–5 –5

Analog: values vary Digital: only discrete

over a broad range values
continuously
 Analog vs. Digital

• Analog devices process signal that can assume any

value across a continuous range and produce results
that are also in continuous form.
• Digital devices process signals that take on only two
discrete values such as 0 and 1 and produces output
that can be represented by 0 and 1.
• Examples
– Analog Devices: solid-state devices TV (except for digital
TV), Audio amplifier etc.
– Digital Devices: Computer, CD player, digital TV, cellular
phone, electronic calculator, and digital camera.
 Analog vs. Digital Systems

Analog systems:
• Limited precision, errors accumulate, drift
• Interface circuits (i.e., sensors & actuators) often
analog

Digital systems:
• More accurate and reliable
• Readily available as self-contained, easy to cascade
building blocks
• Computers use digital circuits internally
 Binary Digital Systems
• Just two discrete values:
yes/on/5 volts/current flowing/magnetized North/true/"1"
no/off/0 volts/no current flowing/magnetized South/false/"0"

• Two kinds of systems:

1. Combinational: Described by Boolean Logic

2. Sequential: Described by State Machine Theory

There are 16 possible unique functions for a 2-input gate

X Y F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15

0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
1 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

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

XOR XNOR

Truth Table NAND

NOR Truth T able
X Y Z X Y Z
0 0 1 0 0 1
Description 0 1 0 Description 0 1 1
Z = 1 if both X 1 0 0 Z = 1 if X is 0 1 0 1
andY are 0 1 1 0 or Y is 0 1 1 0

Gates Gates
X X
Z Z
Y Y
 Logic Functions: XOR, XNOR
XOR: X or Y true but not both ("inequality", "difference")
XNOR: X and Y are the same ("equality", "coincidence")

XOR X Y = X Y + X Y XNOR XY=XY + XY

Description Description
Z = 1 if X has a different Z = 1 if X has the same
value than Y value as Y

Gates Gates
X X
Z Z
Y Y

Truth Table Truth Table

X Y Z X Y Z
0 0 0 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 1
 From Expressions to Gates
More than one way to map an expression to gates

Example T1
Z = A' • B' • (C + D) = (A' • (B' • (C + D)))
T2

A
A Z

B Z B

C T1
C
T2
D D

uses a 3 input gate

 Boolean Laws & Theorems
Useful Laws/Theorems of Boolean Algebra

Duality:
Duality: For
For any
any equation
equation that
that isis true,
true, its
its dual
dual isis also
also true!
true!
The
The dual
dual of
of aa Boolean
Boolean equation
equation isis derived
derived by by replacing
replacing AND AND
operations
operations byby ORs,
ORs, OROR operations
operations by by ANDs,
ANDs, constant
constant 0s 0s by
by 1s,
1s,
and
and 1s
1s by
by 0s
0s (literals
(literals are
are left
left unchanged).
unchanged).

Operations with 0 and 1

1. X + 0 = X 1D. X•1=X
2. X + 1 = 1 2D. X•0=0
Idempotent Law
3. X + X = X 3D. X•X=X
Involution Law
4. (X')' = X
Laws of Complementarity
5. X + X' = 1 5D. X • X' = 0
 Boolean Laws & Theorems (Cont.)

Duality:
Duality: For
For any
any equation
equation that
that isis true,
true, its
its dual
dual isis also
also true!
true!
The
The dual
dual of
of aa Boolean
Boolean equation
equation isis derived
derived by by replacing
replacing AND AND
operations
operations byby ORs,
ORs, OROR operations
operations by by ANDs,
ANDs, constant
constant 0s 0s by
by 1s,
1s,
and
and 1s
1s by
by 0s
0s (literals
(literals are
are left
left unchanged).
unchanged).

Commutative Law
6. X + Y = Y + X 6D. X • Y = Y • X
Associative Law
7. (X + Y) + Z = X + (Y + Z) 7D. (X • Y) • Z = X • (Y • Z)
=X+Y+Z =X•Y•Z
Distributive Law
8. X • (Y+ Z) = (X • Y) + (X •Z) 8D. X+(Y• Z) = (X + Y) • (X + Z)

Multiplying out Adding out

 Boolean Laws & Theorems (Cont.)

Duality:
Duality: For
For any
any equation
equation that
that isis true,
true, its
its dual
dual isis also
also true!
true!
The
The dual
dual of
of aa Boolean
Boolean equation
equation isis derived
derived by by replacing
replacing AND AND
operations
operations byby ORs,
ORs, OROR operations
operations by by ANDs,
ANDs, constant
constant 0s 0s by
by 1s,
1s,
and
and 1s
1s by
by 0s
0s (literals
(literals are
are left
left unchanged).
unchanged).

Simplification Theorems
9. X • Y + X • Y' = X 9D. (X + Y) • (X + Y') = X
10. X + (X • Y) = X 10D. X • (X + Y) = X
11. (X + Y') • Y = X • Y 11D. (X • Y') + Y = X + Y
DeMorgan's Law
12. (X + Y + Z + ...)' = X' • Y' • Z' • ...
12D.(X • Y • Z • ...) ' = X' + Y' + Z' + ...

13. {F(X1,X2,...,Xn,0,1,+,•)}‘ = {F(X1',X2',...,Xn',1,0,•,+)}

 Boolean Laws & Theorems (Cont.)

Duality:
Duality: For
For any
any equation
equation that
that isis true,
true, its
its dual
dual isis also
also true!
true!
The
The dual
dual of
of aa Boolean
Boolean equation
equation isis derived
derived by by replacing
replacing AND AND
operations
operations byby ORs,
ORs, OROR operations
operations by by ANDs,
ANDs, constant
constant 0s 0s by
by 1s,
1s,
and
and 1s
1s by
by 0s
0s (literals
(literals are
are left
left unchanged).
unchanged).
Where is YZ term ?

Multiplying and Factoring Theorems

16. (X + Y) • (X' + Z) = X • Z + X' • Y
16D.X • Y + X' • Z = (X + Z) • (X' + Y)

Consensus Theorem
17. (X • Y) + (Y • Z) + (X' • Z) = X • Y + X' • Z
17D.(X + Y) • (Y + Z) • (X' + Z) = (X + Y) • (X' + Z)
 DeMorgan's Law Example

Pushing
Pushingbubbles
bubbles
around
around

Notice, the 2 bubbles

cancel each other out

X' + Y' = (X • Y)'

NAND
has 2
forms
 Exercises for simplification

Simplify or prove the following:

1. [AB’(C+BD) + A’B’]C = B’C
2. [AB(C+(BD)’) + (AB)’]CD = CD
3. (X+Y)’Z + XY’ = Y’(X+Z)
4. (A’+B)C +ABC
5. AB’C(BD+C’DE) +AC’
DeMorgan Symbols
 x y z F
Combinational Analysis 0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
The most primitive
Combinational formal
analysis is a
description of a1logic
formal description 0adiagram
of 1 1
logic
is a truth table
function.
1 1 0 0
1 1 1 1
 Signal Expressions

F = ((X + Y)  Z) + (X  Y  Z)– with no algebraic simplification

Multiply out:
= (X  Z) + (Y  Z) + (X  Y  Z) to get SOP
Add out: How?

= (X+Y’+Z’)(X’+Z)(Y+Z) to get POS

New circuit, same function—Multiply out
 Yet another circuit, Same function—“Add
out” logic function

• Circuit:
Graphical Application of DeMorgan
 Different circuit, same function—
Eliminating/Introducing pair of bubbles
 Another Example

AND-OR NAND-NAND

Ad hoc