CRC = M(x)*xK mod G

To do the division, we convert M and G into polynomial form.

M(x) = x6+ x4+ x2+1, G(x) = x4+ x3+1

K = 4, => CRC is 4 bits wide.

M(x)*x4 = x10+ x8+ x6+ x4

Divide this by G(x) to get the CRC.

x6+ x5+ x

x4+ x3+1 |x10+ x8+ x6+ x4

x10+ x9+ x6

x9+ x8+ x4

x9+ x8+ x5

x5+ x4

x5+ x4+ x

X

asked by guest
on Jan 09, 2025 at 5:57 am



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.


+ Submit Question