Cyclic Redundancy Check (CRC)

Polynomial Division Method

Make T(x) divisible by P(x) =x5+x4+x2+1 (Note: n=5)

Example: M=1010001101 is to be sentM(x) = x9+x7+x3+x2+1

1. Multiply M(x) by xn, xnM(x)= x14+x12+x8+x7+x5+ ....

2. Divide xnM(x) by P(x), find remainder: R(x)=01110=x3+x2+x

Previous slide

Next slide

Back to first slide

View graphic version