Lecture 22

# Lecture 22 - ECE52 Spring 11 Lecture 22 Spring Break...

This preview shows pages 1–14. Sign up to view the full content.

ECE52 Spring 11 Lecture 22 3/4/11 Spring Break follows 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 One more design example (from MIT OpenCourseware – needed in lock and vending machine!)
3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4
5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6
7

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
8
9

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
10
11 Finite State Machine M={S,X,Y, Φ , Ψ } • A finite, nonempty set S={s i } of states |S| <= 2 n for n flip flops • A finite, nonempty set X={x j } of primary inputs • A finite, nonempty set Z={z k } of outputs A state transition function Φ :X × S S S(t+1) = Φ (S(t),X(t)) An output function Ψ :X × S Z or Ψ :S Z Z(t+1) = Ψ (S(t),X(t)) Mealy machine Z(t+1) = Ψ (S(t)) Moore machine Synchronous (clocked) behavior is assumed

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
12 So – back to chapters 6, 7 Reason we jumped to chapter 8 and beyond was to motivate counters and other sequential machine designs which tumble fully functional out of the sky in chapter 7…
13 Chapter 6 – finish up combinational logic Building blocks – we were introduced to most of these a few weeks ago A few more advanced VHDL techniques for designing and manipulating combinational circuits

This preview has intentionally blurred sections. Sign up to view the full version.

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

{[ snackBarMessage ]}

### Page1 / 19

Lecture 22 - ECE52 Spring 11 Lecture 22 Spring Break...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online