Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A block of four bytes uses even parity. The first bit of each byte is its parity bit. The last byte is the parity byte for the columns. The block arrives like this:
0110010110110000010110101111000001111101Parity block: each byte has a parity bit and a parity byte holds the parity bit of each column; the wrong bit is where the failing row and the failing column cross. Checksum: the sender works out a value from the block and sends it; the receiver works it out again; a difference means an error. Here the checksum is the total of the bytes . Echo check: the receiver sends the data back and the sender compares.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The rows. byte 1 has ones; byte 2 has ones; byte 3 has ones; byte 4 has ones. Only byte has an odd count, so row fails.
Step 2. The columns. Count the 1s down each column, including the parity byte. Column has an odd count. Every other column is even.
Step 3. Where they cross. The wrong bit is in row , column . It arrived as , so it should be .
Check. With that bit flipped back, byte is 10110010, which has ones: even. Column is now even too.
Answer: (a) Row . (b) Column . (c) .
Log in to join the discussion.
Loading…