{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec10

# lec10 - CS 140 Lecture 10 Sequential Networks...

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

CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1

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

View Full Document
Implementation Format and Tool Procedure Excitation Tables Example 2
Canonical Form: Mealy and Moore Machines Combinational Logic x(t) y(t) CLK C2 C1 y(t) CLK x(t) C1 C2 CLK x(t) y(t) 3

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

View Full Document
Mealy Machine: y i (t) = f i (X(t), S(t)) Moore Machine: y i (t) = f i (S(t)) s i (t+1) = g i (X(t), S(t)) C1 C2 CLK x(t) y(t) Mealy Machine C1 C2 CLK x(t) y(t) Moore Machine s(t) s(t) Canonical Form: Mealy and Moore Machines 4
C1 C2 CLK x(t) y(t) Sequential Network Implementation: Format and Tool Canonical Form: Mealy & Moore machines State Table Netlist Tool: Excitation Table s(t) D(t) = h(x(t), S(t)) y(t) = f(x(t), S(t)) 5

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

View Full Document
Implementation: Procedure State Table => Excitation Table Given a state table Input PS x Q(t) NS, y we have NS = Q(t+1) = h(x(t),Q(t)) Output y(t) = f(x(t),Q(t)). We want to express D(t), T(t), S(t), R(t), J(t), K(t) as a funciton of inputs X(t) and current state Q(t).
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

lec10 - CS 140 Lecture 10 Sequential Networks...

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

View Full Document
Ask a homework question - tutors are online