In: Computer Science
Reconsider your student ID in a binary format (as explained in the previous question) as the dataword.
2.1) Find the codeword corresponding to this dataword using the CRC error detection technique, and the divisor polynomial g(x) = x3 +x2 +1. Do Binary division with 0s and 1s.
2.2) Compute now the codeword corresponding to this dataword assuming that the divisor polynomial that is used is f(x) = x5+1. Do Polynomial division.
2.3) Assume that an error corrupted the first two bits of the dataword; show how the CRC technique allows you to detect such an error using the divisor of question 2.2.
My ID digits are: 706
Solution:
Given,
=>Student ID = 706
(2.1)
Given,
=>CRC error detection technique is used.
=>Divisor = x^3 + x^2 + 1
Explanation:
Converting student ID into binary format:
=>(706)10 = (1011000010)2
=>Divisor in binary = 1101
Finding codeword:
(2.2)
Given,
=>Divisor = x^5 + 1
Explanation:
=>Divisor in binary = 100001
Finding codeword:
(2.3)
=>Divisor = x^5 + 1
Explanation:
=>Divisor in binary = 100001
Showing that CRC can detect error:
I have explained each and every part with the help of statements as well as images attached to the answer above.