Answer Happy

Consider the state diagram shown in Figure 2a. S, 222.Z 100 0 So S S, 1 0 2₂ Z, Zo 001 Z₂ Z, Zo 010 Zz Z, Zo 010 1 o 54 2, Z, Zo 100

14. Does the state diagram shown in Figure 2a represent a Mealy or Moore Machine? (1 Mark) 15. For the state machine represented in Figure 2a, state the number of inputs F (1 Mark) 16 For the state machine represented in Figure 2a, state the number of outputs (1 Mark) 17. For the state machine represented in Figure 2a, state the number of flip flops required to implement the machine (1 Mark) 18. Derive all equations necessary to implement the machine shown in Figure 2 using a standard binary state assignment ie Sp1000, S=001. Sy = 010, etc. (6 marks) 19. Analyse the machine in Figure 2a and identity which, if any, states are equivalent. Comment on how state minimisation would affect the hardware requirements of the design in 018 (4 marks) 20 in 013 a standard binary codeword assignment was used to implement the machine represented in Figure 2 However, optimited or one-hot' stato assignment methods could have been used instead को

19. Analyse the machine in Figure 2a and identify which, if any, states are equivalent. Comment on how state minimisation would affect the hardware requirements of the design in 018. (4 marks) 20. In 018 a standard binary codeword assignment was used to implement the machine represented in Figure 21. However, optimised or one-hot state assignment methods could have been used instead, For the original machine in Figure 2a, apply Rule 7 for optimal codeword ansignment to identity which states should ideally, be assigned codewords with minimal hamming distance between them. Comment on how performing optimal state assignment might compare to standard binary assignment. What advantages might optimal state assignment provide H. a one-hot state assignment was used to implement the machine shown in Figure 2a rather than standard binary assignment, what differences would you expect to see between the final design? (6 marks) state