- Time Left 1 20 02 1 S 1 Z Z Zo 100 1 0 So S2 Si 0 2 Z Zo 001 Z Z Zo 010 Z Z Zo 010 1 S Zz Z Zo 100 Figure 2 1 (30.69 KiB) Viewed 68 times
- Time Left 1 20 02 1 S 1 Z Z Zo 100 1 0 So S2 Si 0 2 Z Zo 001 Z Z Zo 010 Z Z Zo 010 1 S Zz Z Zo 100 Figure 2 2 (28.21 KiB) Viewed 68 times
- Time Left 1 20 02 1 S 1 Z Z Zo 100 1 0 So S2 Si 0 2 Z Zo 001 Z Z Zo 010 Z Z Zo 010 1 S Zz Z Zo 100 Figure 2 3 (11.15 KiB) Viewed 68 times
Figure 2a 20. In Q18 a standard binary codeword assignment was used to implement the machine represented in Figure 2a. However, optimised or 'one-hot' state assignment methods could have been used instead. 1. For the original machine in Figure 2a, apply Rule 1 for optimal codeword assignment to identify which states should ideally, be assigned codewords with minimal hamming distance between them NE Comment on how performing optimal state assignment might compare to standard binary assignment. What advantages might optimal state assignment provide? lii. If a one-hot state assignment was used to implement the machine shown in Figure 2a rather than standard binary state assignment, what differences would you expect to see between the final designs? (6 marks)
Figure 2a 18. Derive all equations necessary to implement the machine shown in Figure 2 using a standard binary state assignment i.e. 50*000, S7-001, S2 =010, etc. (6 marks)