EXAM 4-solution

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: 01/1
 
 XfXd/Y
 00/1,
 00/0,
 01/0
 b
 a
 10/0,
 
 11/1
 
 10/1,
11/0
 
 
 
 
 b)(10
pts)
 
 
 X
 y
 ALL
SAME
 
 
 
 
 Draw
state
transition
diagram
for
the
sequential
circuit
that
produces
output
1
iff
the
last
three
bits
 arrived
are
all
0
or
all
1,
i.e.
Xn‐2
Xn‐1
Xn=000
or
Xn‐2
Xn‐1
Xn=111
 Example
 Time
 0
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 ...
 X
 0
 0
 1
 1
 0
 1
 1
 1
 1
 0
 1
 0
 0
 0
 1
 1
 1
 0
 ...
 Y
 ‐
 ‐
 0
 0
 0
 0
 0
 1
 1
 0
 0
 0
 0
 1
 0
 0
 1
 0
 
 
 0/1
 1/0
 00
 01
 1/0
 1/0
 0/0
 0/0
 11
 10
 0/0
 1/1
 
 
 Q2)
(10
pts)
 
 PS
 NS
 Given
the
state
transition
table,
apply
state
reduction
by
 partitioning
algorithm...
View Full Document

This test prep was uploaded on 04/06/2014 for the course EEE 348 taught by Professor Gozdeakar during the Summer '11 term at Middle East Technical University.

Ask a homework question - tutors are online