My question is about the CRC generator polynomial.
If I have a generator of level 5, say:
$$X^5+X^4+X^2+1$$
How can I know if it can or cannot detect a parity error?
Also how can I know the error patterns that can pass without being detected?
Electrical Engineering Stack Exchange is a question and answer site for electronics and electrical engineering professionals, students, and enthusiasts. It only takes a minute to sign up.
Sign up to join this communityMy question is about the CRC generator polynomial.
If I have a generator of level 5, say:
$$X^5+X^4+X^2+1$$
How can I know if it can or cannot detect a parity error?
Also how can I know the error patterns that can pass without being detected?
This is a general rule , in youre case k = 6
Short Burst Errors
(Length b ≤ k, number of redundant bits)
-->All errors up to length k are detected
Undetectable only if burst error is the same as g(x)
g(x) = x^k+ … + 1 k-1 bits between xk and x0
e(x) = x^k + … + 1 must match
Probability of not detecting the error is 2^(-(k-1))
Probability of not detecting the error is 2^(-k)