CRC (Cont)

• 3. Add the remainder R(x) to xnM(x) : T(x)= x14+x12+x8+x7+x5+x3+x2+x

• 4. Check that the result T(x) is divisible by P(x).

• Transmit the bit pattern corresponding to T(x): 101000110101110

Previous slide

Next slide

Back to first slide

View graphic version