0. Digital Principles and Design Algorithmic State Machines
PowerPoint Slides
to accompany
Digital Principles and Design
Donald D. Givone
Chapter 8
Algorithmic State Machines

1. Partitioning of a digital system.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Partitioning of a digital system.
Figure 8.1
8-1

2. Model of an algorithmic state machine.
Figure 8.2

3. Timing of an algorithmic state machine.
Figure 8.3

4. The state box.
Figure 8.4

5. The decision box. (a) Symbol. (b) Alternate symbol.
Figure 8.5

6. The conditional output box.
Figure 8.6

7. Example of an ASM block and its link paths.
Figure 8.7

8. Two equivalent ASM blocks.
Figure 8.8

9. Two equivalent ASM blocks. (a) Using a single decision box
Two equivalent ASM blocks. (a) Using a single decision box. (b) Using several decision boxes.
Figure 8.9

10. Two equivalent ASM books blocks. (a) Parallel decision boxes
Two equivalent ASM books blocks. (a) Parallel decision boxes. (b) Serial decision boxes.
Figure 8.10

11. Invalid ASM block having nonunique next states.
Figure 8.11

12. Looping. (a) Incorrect. (b) Correct.
Figure 8.12

13. ASM chart for a mod-8 binary counter.
Figure 8.13

14. ASM chart for a mod-8 binary up-down counter.
Figure 8.14

15. Moore sequential network. (a) State diagram. (b) ASM chart.
Figure 8.15

16. Mealy sequential network. (a) State diagram. (b) ASM chart.
Figure 8.16

17. ASM chart to recognize the sequence x1x2 = 01,01,11,00.
Figure 8.17

18. Binary multiplication. (a) Pencil-and-paper approach
Binary multiplication. (a) Pencil-and-paper approach. (b) Add-shift approach.
Figure 8.18

19. Architecture for a binary multiplier.
Figure 8.19

20. ASM chart for a binary multiplier.
Figure 8.20

21. An ASM chart.
Figure 8.21

22. A minimum state locus assignment for the ASM chart of Fig. 8. 21
A minimum state locus assignment for the ASM chart of Fig (a) State-assignment map. (b) State locus.
Figure 8.22

23. Karnaugh map for simplifying the function of Table 8.1b.
Figure 8.23

24. Discrete-gate realization with clocked D flip-flops for the ASM chart of Fig. 8.21.
Figure 8.24

25. Using variable-entered Karnaugh maps to obtain a discrete-gate realization with clocked D flip-flops for the ASM chart of Fig
Figure 8.25

26. Using variable-entered Karnaugh maps to obtain a discrete-gate realization with clocked JK flip-flops for the ASM chart of Fig
Figure 8.26

27. Assignment of inputs to a multiplexer for each excitation and output function.
Figure 8.27

28. Multiplexer realization with clocked D flip-flops for the ASM chart of Fig. 8.21.
Figure 8.28

29. Structure of a PLA realization for an ASM.
Figure 8.29

30. PLA realization with clocked D flip-flops for the ASM chart of Fig. 8
Figure 8.30

31. Fragments of ASM charts illustrating problems associated with asynchronous inputs. (a) Transition race. (b) Output race.
Figure 8.31

32. Using a clocked D flip-flop to synchronize an asynchronous input.
Figure 8.32