The second homework exercises your understanding of error detection methods, and gives you some practice with finite state machines and probability calculations.
I. (10 pts) Pick any 2 of the claims at the bottom of page 100 regarding CRCs and prove them.
II. (5 pts) Design a finite state machine implementing bit stuffing as described on page 88 (we did this in class). Design the corresponding FSM for the receiver.
III. (5 pts) Argue that the CRC algorithm could be implemented by a FSM. Argue that it would not be a good idea. (Hint: consider the number of required states, for example for CRC-32 - Table 2.6).
IV. (9 pts) Do problems 2.9, 2.10, and 2.12 on pages 157 and 158.
V. (6 pts) Do problems 2.23 and 2.41 on pages 160 and 162.
As always, I invite comments on the homework or any other aspect of the class. Feel free to include them on what you turn in or separately.
This homework is due in class Sept. 14. Write or print out your solutions and turn them in to your folder.
Previous Homework: