ECE-C690: Dependable Computing - Homework 3, Exercises of Computer Science

Information about a homework assignment for the course ece-c690: dependable computing, due on march 9, 2009. The assignment includes solving textbook problems related to hamming single-error correction, including calculating parity checks and identifying erroneous bits. No no specific textbook is mentioned.

Typology: Exercises

2012/2013

Uploaded on 05/18/2013

maazi
maazi 🇮🇳

4.4

(12)

75 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE-C690: Dependable Computing
Homework 3
February 25, 2009
The homework is due in class Monday, March 9, 2009.
Each problem is worth 10 points.
1. Textbook problem 3.6.2
2. Textbook problem 3.6.3
3. Textbook problem 3.6.21
4. Show the organization of a 8-bit memory with Hamming single-error correction. Describe the organization
clearly and show the parity groups that result. Associate the syndromes with the particular bit that they
identify as erroneous.
5. A Hamming single-error-correcting code has the following parity check matrix.
H=
d1d2d3d4c1c2c3
0 0 1 1 1 0 1
0 1 0 0 1 1 1
1 0 0 1 1 1 0
where (d1, d2, d3, d4) are the data bits and (c1, c2, c3) are the corresponding parity-check bits, respectively.
Suppose, we retrieve the word (d1d2d3d4c1c2c3) = (0111011) from memory. What was the data word that
was stored originally in memory.
1

Partial preview of the text

Download ECE-C690: Dependable Computing - Homework 3 and more Exercises Computer Science in PDF only on Docsity!

ECE-C690: Dependable Computing

Homework 3

February 25, 2009

The homework is due in class Monday, March 9, 2009.

Each problem is worth 10 points.

  1. Textbook problem 3.6.
  2. Textbook problem 3.6.
  3. Textbook problem 3.6.
  4. Show the organization of a 8-bit memory with Hamming single-error correction. Describe the organization clearly and show the parity groups that result. Associate the syndromes with the particular bit that they identify as erroneous.
  5. A Hamming single-error-correcting code has the following parity check matrix.

H =

d 1 d 2 d 3 d 4 c 1 c 2 c 3 0 0 1 1 1 0 1 0 1 0 0 1 1 1 1 0 0 1 1 1 0

where (d 1 , d 2 , d 3 , d 4 ) are the data bits and (c 1 , c 2 , c 3 ) are the corresponding parity-check bits, respectively. Suppose, we retrieve the word (d 1 d 2 d 3 d 4 c 1 c 2 c 3 ) = (0111011) from memory. What was the data word that was stored originally in memory.