- Q2 5 5 This Exercise Examines The Single Error Correcting Double Error Detecting Sec Ded Hamming Code 2 1 What Is 1 (43.96 KiB) Viewed 68 times
Q2 <$5.5> This Exercise examines the single error correcting, double error detecting (SEC/DED) Hamming code. 2.1 What is
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Q2 <$5.5> This Exercise examines the single error correcting, double error detecting (SEC/DED) Hamming code. 2.1 What is
Q2 <$5.5> This Exercise examines the single error correcting, double error detecting (SEC/DED) Hamming code. 2.1 What is the minimum number of parity bits required to protect a 128-bit word using the SEC/DED code? 2.2 Section 5.5 states that modern server memory modules (DIMMs) employ SEC/DED ECC to protect each 64 bits with 8 parity bits. Compute the cost/ performance ratio of this code to the code from Q2.1. In this case, cost is the relative number of parity bits needed while performance is the relative number of errors that can be corrected. Which is better? (Hint: How many bits of overhead (non-data) and needed to protect the same amount of data.) 2.3 Consider a SEC code that protects 8 bit words with 4 parity bits. If we read the value Ox375, is there an error? If so, correct the error.