Digital Logic Design-Intro 2010

Digital Logic Design-Intro 2010 - 9/13/10
...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 9/13/10
 Digital
Logic
Design
 Introduc7on
 EECE
256
 Dr.
Sidney
Fels
 Steven
Oldridge
 Introduc7on
 •  Introduc7on
to
Digital
Design
 •  Follow
text
somewhat
closely
but
augment
 •  Use
the
LIP
structure
 •  Office
hours:
 –  2
weeks
on,
1
week
off
 –  Tues
and
Thurs,
2:30‐2:30pm
 –  Sid
Fels
and
Steve
Oldridge
 –  plus
TAs
 (c)
S.
Fels,
since
2010
 2
 –  or,
how
I
learned
to
love
0
and
1
 •  Two
instructors
available
 9/13/10
 Introduc7on
 •  Assignments
handed
out
online
 –  are
expected
to
be
completed
 –  solu7ons
provided
shortly
aUer
assignment
given
out
 –  not
marked
 •  Quizzes
during
selected
Friday
tutorials
and
will
 be
graded
 •  Grades:
 –  Quizzes:
15%
 –  Midterm:
25%
 –  Final:
60%
 9/13/10
 (c)
S.
Fels,
since
2010
 3
 1
 9/13/10
 Overview
of
Topics
 1.  History
of
Digital
Compu7ng
 2.  Digital
Systems
and
Binary
Numbers
 3.  Boolean
Algebra
and
Logic
Gates
 4.  Gate‐level
Minimiza7on
 –  how
to
make
it
simpler
 –  the
basics
func7ons
with
bits
 –  why
digital
design
is
important
 –  how
to
represent
and
work
with
numbers
 5.  Combina7onal
Logic
 –  let’s
make
it
more
complex
to
do
more
 (c)
S.
Fels,
since
2010
 4
 9/13/10
 Overview
of
Topics
 5.  Synchronous
Sequen7al
Logic
Design
 –  –  –  –  –  –  9/13/10
 6.  Registers
and
Counters
 useful
state
machines
 adding
a
memory
element
so
the
system
has
state
 7.  Memory
and
Programmable
Logic
 8.  Design
using
Different
Digital
Components
 bringing
it
all
together
 larger
scale
state
representa7ons
 9.  
Some
HDL
approaches
to
Digital
Design
 we’ll
use
some
HDL
throughout
term
so
you
have
an
 introduc7on
to
it
 you
have
Verilog
simulator
with
your
text
too
 (c)
S.
Fels,
since
2010
 5
 Digital
Systems
and
Binary
Numbers
 •  First
compu7ng
device,
called
Difference
 Engine
by
Charles
Babbage
(1822)
 –  Mechanical
with
crank
power
 –  Used
base
10
as
its
number
system
 –  Calculate
mathema7cal
tables
 9/13/10
 permission:
wikiMedia
commons,

 (c)
S.
Fels,
since
2010
 6
 2
 9/13/10
 9/13/10
 youtube:
hfp://www.youtube.com/watch?v=0anIyVGeWOI

 (c)
S.
Fels,
since
2010
 7
 Meanwhile,
some
theory
 developments…
 •  George
Boole
(1854)
 –  demonstrates
that
logic
is
math

 –  creates
no7on
of
Boolean
Algebra
 •  mathema7cs
of
binary
numbers
 •  Claude
Shannon
(1937)
 –  showed
two‐valued
Boolean
Algebra
 •  called
switching
algebra
 –  opened
the
door
for
digital
design
 •  the
founda7ons
of
our
current
computers
 •  and,
the
star7ng
point
of
our
course
 9/13/10
 (c)
S.
Fels,
since
2010
 8
 Where
we
are
today
 9/13/10
 permission:
Crea7ve
Commons
ASL,
wgsimon
 (c)
S.
Fels,
since
2010
 9
 3
 9/13/10
 Where
this
course
fits:
 1.  Problem
statement
 –  –  –  –  –  –  2.  Behaviour
descrip7on
 specifica7ons,
design
requirements
 algorithms
 flowcharts
 state
transi7on
diagrams
 logic
equa7ons
 digital
circuit
schema7cs
 3.  Boolean
logic
and
state
 4.  Hardware
Implementa7on
 –  TTL
gates
(AND,
OR,
NOT,
XOR…)
 –  Modules
(counters,
shiU
registers,
…)
 –  Programmable
logic
 9/13/10
 (c)
S.
Fels,
since
2010
 10
 Where
this
course
fits:
 1.  Problem
statement
 –  –  –  –  –  –  2.  Behaviour
descrip7on
 specifica7ons,
design
requirements
 algorithms
 flowcharts
 state
transi7on
diagrams
 logic
equa7ons
 digital
circuit
schema7cs
 3.  Boolean
logic
and
state
 4.  Hardware
Implementa7on
 –  TTL
gates
(AND,
OR,
NOT,
XOR…)
 –  Modules
(counters,
shiU
registers,
…)
 –  Programmable
logic
 9/13/10
 First
half
 (c)
S.
Fels,
since
2010
 11
 Where
this
course
fits:
 1.  Problem
statement
 –  –  –  –  –  –  2.  Behaviour
descrip7on
 specifica7ons,
design
requirements
 algorithms
 flowcharts
 state
transi7on
diagrams
 logic
equa7ons
 digital
circuit
schema7cs
 3.  Boolean
logic
and
state
 4.  Hardware
Implementa7on
 –  TTL
gates
(AND,
OR,
NOT,
XOR…)
 –  Modules
(counters,
shiU
registers,
…)
 –  Programmable
logic
 9/13/10
 Second
half
 (c)
S.
Fels,
since
2010
 12
 4
 9/13/10
 Where
this
course
fits:
 1.  Problem
statement
 –  –  –  –  –  –  –  –  –  –  2.  Behaviour
descrip7on
 specifica7ons,
design
requirements
 algorithms
 flowcharts
 state
transi7on
diagrams
 3.  Boolean
logic
and
state
‐>
HDL
descrip7on
 4.  Hardware
Implementa7on
 logic
equa7ons
‐>
code
 digital
circuit
schema7cs
‐>
code
 TTL
gates
(AND,
OR,
NOT,
XOR…)
 Modules
(counters,
shiU
registers,
…)
 Programmable
logic
 ASIC
 }
 HDL
helps
here;
 
‐
programming
language
 
 
*
i.e.,
verilog,
VHDL
 
‐
helps
reduce
error
 
‐
helps
with
complexity
 9/13/10
 (c)
S.
Fels,
since
2010
 13
 Let’s
begin…
 •  Ques7ons
 9/13/10
 (c)
S.
Fels,
since
2010
 14
 5
 ...
View Full Document

This note was uploaded on 12/21/2010 for the course EECE EECE 256 taught by Professor Sidney during the Spring '10 term at The University of British Columbia.

Ask a homework question - tutors are online