M16_2_EEM16_F11_L10

M16_2_EEM16_F11_L10 - 19 Example of Binary Coding 20...

Info iconThis preview shows pages 1–39. Sign up to view the full content.

View Full Document Right Arrow Icon
EEM16/CSM51A: Logic Design of Digital Systems Lecture #10 Ch 7: Sequential Systems Specifications Ch 8: Sequential Networks Prof. Danijela Cabric Fall 2011
Background image of page 1

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

View Full DocumentRight Arrow Icon
Agenda ± Review: Mealy and Moore machines ± State minimization ± Canonical form of sequential networks ± Latches and edge triggered cells, D flip flop 2
Background image of page 2
Mealy and Moore State Machine 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Same Behavior in Time: Equivalent Sequential Systems 4
Background image of page 4
Equivalent States 5
Background image of page 5

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

View Full DocumentRight Arrow Icon
Example 6
Background image of page 6
Example (contd) 7
Background image of page 7

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

View Full DocumentRight Arrow Icon
Procedure to Minimize Number of States 8
Background image of page 8
( i+1)-equivalent States 9
Background image of page 9

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

View Full DocumentRight Arrow Icon
( i+1)-equivalent States 10
Background image of page 10
( i+1)-equivalent States 11
Background image of page 11

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

View Full DocumentRight Arrow Icon
( i+1)-equivalent States 12
Background image of page 12
When to Stop? 13
Background image of page 13

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

View Full DocumentRight Arrow Icon
Procedure: Summary ± Obtain P1 (directly from the state table) ± Obtain Pi+1 from Pi ± by grouping states that are i equivalent ± and whose corresponding successors are i equivalent ± Terminate when Pi+1 = Pi ± Write the reduced table 14
Background image of page 14
Example 15
Background image of page 15

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

View Full DocumentRight Arrow Icon
Example(contd.) 16
Background image of page 16
Example (contd) 17
Background image of page 17

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

View Full DocumentRight Arrow Icon
Example (contd) 18
Background image of page 18
Binary Specification of Sequential Systems
Background image of page 19

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

View Full DocumentRight Arrow Icon
Background image of page 20
Background image of page 21

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

View Full DocumentRight Arrow Icon
Background image of page 22
Background image of page 23

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

View Full DocumentRight Arrow Icon
Background image of page 24
Background image of page 25

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

View Full DocumentRight Arrow Icon
Background image of page 26
Background image of page 27

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

View Full DocumentRight Arrow Icon
Background image of page 28