crc校验（crc checking）.doc

crc校验（crc checking） [editor this paragraph] details 1, cyclic redundancy check code (CRC code, CRC=Cyclic Redundancy Check): is the data communications of the most commonly used error checking code, which is characterized in that the information field and check the length can be arbitrarily selected. The 2 generation, the basic principle of CRC Codes: an arbitrary binary string composed by code and a polynomial coefficient is only 0 and 1 value of the corresponding. For example: polynomial code 1010111 corresponds to x6+x4+x2+x+1, and the polynomial is x5+x3+x2+x+1 corresponding code 101111. 3, CRC code set selection principle: if the codeword length is N, the information field is K, check field is R (N=K+R), then for any codeword CRC code set, and there exists only a R polynomial g (x), the V (x) =A (x) g (x) =xRm (x) +r (x); the M (x) K-1 information r (x) polynomial, R-1 polynomial time check, G (x) is called polynomial: G (x) =g0+g1x1+ g2x2+... +g (R-1) x (R-1) +gRxR by specifying the sender g (x) CRC code, the recipient is through the G (x) CRC code to verify receipt. 4, CRC check code generation method: Software Based on polynomial division, the remaining number of check field. For example: information field code: 1011001; the corresponding M (x) =x6+x4+x3+1 hypothesis generator polynomial: G (x) =x4+x3+1 g (x); the corresponding code is: 11001 x4m (x) =x10+x8+x7+x4 corresponding to the code note: 10110010000; using polynomial division: the remainder is 1010 (i.e.: check field for sender: 1010): a transmission field: 10110011010 information field check: check field receiver use the same code: field / receives the generated code (binary division) if it is divisible, right, give out the remainder (1010) calculation steps: division no mathematical meaning, instead of using the die division, computer two, divisor and dividend do xor. XOR when the divisor and dividend MSB alignment, bitwise xor. 10110010000 -11001 =01111010000 1111010000 -11001 =0011110000 11110000