Be sure to look at the Canvas Module for this week for various hand-in mechanisms!


C34 In Class Exercise: Redundancy Patterns

This is a group assignment that should be completed in class. You are permitted to split up the work however you like, but you should review the submission as a group before handing it in.

For EACH of the below listed architectural patterns discussed in the Safety Architecture Pattern lecture, answer the following three questions. (Note that the terminology is not a precise match to the slide titles. Part of the exercise is making sure you can identify which pattern is being referred to in general terms.) Prepare one slide per pattern.

  1. Summarize the idea behind the architectural pattern via a couple sentences or an annotated sketch
  2. In your opinion, what is the single most attractive "pro" for this pattern?
  3. In your opinion, what is the single most problematic "con" for this pattern? (If it is unsafe, say why.)

C35 In Class Exercise: CRC Selection

This is a group assignment that should be completed in class.

Work as a team to find FOUR "good" CRC polynomials. You can split up the work as you like, but everyone on the team should check the work before handing in. The point is that each team member goes through the procedure a few times to understand the process.

Find a "good" CRC for a particular dataword length. A "good" CRC for our purposes is one that has the maximum possible HD for that dataword length. Here are some notes to help navigate the terminology:

Follow this procedure:

  1. Take the last digit of your group number. Add 16 to the answer. This will give you a number between 16 and 25. Assign each student in your group a different numbers starting at your group's initial number. Example: you are group 14. Last digit is 4. 4+16=20. Within your group, student A gets 20, Student B gets 21, Student C gets 22, Student D gets 23.
  2. Each student independently finds a "good" CRC with a CRC size (in bits) equal to the student number and HD=6. What's the polynomial? What is the largest dataword length at that HD? What is the corresponding maximum codeword length at that HD?
  3. Each student independently finds a "good" CRC with a CRC size (in bits) equal to the student number and codeword length of 256 bits. What's the dataword length at that codeword length? What is the best HD achievable? What's the polynomial that achieves that best HD?
  4. Combine all four student results into a 4-slide deck, one student per slide
  5. As a group, go through each slide and check the calculations/findings. If there are any questions you can't resolve, ask the course staff.

Supplemental Material: