C
Chen L.
Hi all,
If I have a 32-bit data M, and the CRC genrator polynomial G(x),which
power is 32, then I can get the CRC checkword R by the following
algorithm:
X^32*M(x) = Q(x)G(x) + R(x),
But how is the inversed process, if I have get the R(x), is there a
inverse polynomial to generator the M(x)?
Another example is that I have a 32-bit data sequence D0,D1,D2,D3,
with the G(x), I can get the CRC checkword. If have known the
D1,D2,D3,CRC, how to define D0, if the quotient Q(x) could be defined
by some way.
Thanks a lot.
Chen L.
If I have a 32-bit data M, and the CRC genrator polynomial G(x),which
power is 32, then I can get the CRC checkword R by the following
algorithm:
X^32*M(x) = Q(x)G(x) + R(x),
But how is the inversed process, if I have get the R(x), is there a
inverse polynomial to generator the M(x)?
Another example is that I have a 32-bit data sequence D0,D1,D2,D3,
with the G(x), I can get the CRC checkword. If have known the
D1,D2,D3,CRC, how to define D0, if the quotient Q(x) could be defined
by some way.
Thanks a lot.
Chen L.