Given a 10-bit sequence 1010011110 and a divisor of 1011, find the CRC. Check your answer.
Answers
Answered by
2
Answer:
CRC - 001
Step-by-step explanation:
The CRC or the cyclic redundancy check is a checksum algorithm that detects the inconsistency of data, that is the bit errors during the data transmission.
As per the question -
The sequence after adding n = 3 extra zeros -1010011110000.
Divisor (of length n + 1) - 1011
The polynomial division will be -
= x12 + x10 + x7 + x6 + x5 + x4/ x³+x+1
= x9 + x6 + x² + x + 1 + 1/x³+x+1
= 1
The remainder polynomial will be 1.
Hence, the CRC will be 001.
Similar questions