how Cyclic redundancy check are calculated

399 viewsMathematicsOther

(not their purpose)

In: Mathematics

2 Answers

Anonymous 0 Comments

In math terms it’s a polynomial division with a constant divisor, and then just keeping the remainder. So your data is a binary number N and you divide it for example by x^3 +x+1.

In practical terms this is equivalent to just executing a moving XOR operation with your data and the coefficients or the polynom. 

The coefficients are 1101 So the algorithm goes as follows: 

Take fhe first 4 bits of your data, calculate the XOR operation on them with 1101, then remove the first bit of the result and add the 5th bit of the data. Repeat until you arrive at the end. XOR in case you don’t know is “exclusive OR” wich basically flips your data bits whenever there is a 1 in your polynomial 

You are viewing 1 out of 2 answers, click here to view all answers.