EECS 373 Winter 04
Homework 2
Due Tues. March 29th in class.
Name: _______________________________ unique name: ________________
You are to turn in this sheet as a cover page for your
assignment. The rest of the assignment should be stapled to this page. See
the website for details about where to turn in your assignment. This is an
individual assignment, all of the work should be your own. Assignments that
are unstapled, lack a cover sheet, or are difficult to read will lose at
least 50% of the possible points and we may not grade them at all. If you
use references other than the text and class notes, be sure to cite them!
The function P(x) returns the even parity of the bit string x.
- Using even-one's parity find the parity of the following strings
[3]
- 100101
- 101001
- 101111
- What is the Hamming distance of the following sets?[4]
- {111,001}
- {1000,0000,1111}
- {1111,0000,1001}
- {110,101,011,000}
- Using the 1-bit error correction scheme described in class,
- Find the parity bits for the following code:[6]
1 0 1 1 1 0 0
--- --- --- --- --- --- --- --- --- --- ---
1 2 3 4 5 6 7 8 9 10 11
- Now, if bits 3 and 4 flip, what will the error correction scheme do?
- Consider the following error detection/correction scheme which covers
the data bits A, B, C and D:
X=P(A,B,C), Y=P(A,C,D), Z-P(A,C,D)
This scheme does not provide 1 bit of error correction (that is
the Hamming distance is less than 3). Do the following:[6]
- Show an example of a pair of legal codes which have a Hamming distance
less than 3. (Hint: there are easier ways than just searching all 16
posibilties!)
- Find an illegal code which is just one bit flip away from two
legal codes.
- Consider the following data stream: 101001.[11]
- Using the parity scheme described in class for the Veterbi algorithm,
show what the parity bits would be.
- Say the 2nd data bit and the 4th parity bit went bad. Show how the
Veterbi algorithm would attempt to correct the error. Draw the trellis.
- Does it correct the error?