Help: How to Calculate Cyclic Redundancy Checksum (CRC)

Hello,

Although it seems like cheating to do this, but I really have no clue and no time to calculate Cyclic Redundancy Checksum (CRC). Would you guys help me to solve the following problem? If possible, would u please give me some explanation? I'll feel guiltier to just copying your answer without understanding it.

Question:
"Suppose you want to transmit the data 10011001 and the generator polynomial is X^3 + X^2 +1. Use CRC method to find data to be transmitted T(s)?"

Thank You Very Much. I appreciate it.

Jacob

the basic idea is that you have an agreed polynominal of (n-1)'th degree, usually n being 32 as in the checksum used in internet (CRC32) and add n bits to your data so the whole polynom is divisible with the agreed polynominal. When the data is sent over most any bit and most probably all burst errors are detected when dividing the result with the agreed polynominal getting a rest.

Basically
Send D = T*x^n + T*x^n % P
and
Recieve T=D*X^-n when D % P = 0, otherways ask to retrasmit

of course you'd have to do this with bit arithmetic