Modulo 2 Division _ Binary

About a binary number of 1111000 divided by 1101, modulo 2 Division quotient is 1011, the remainder is 111. This result is different from decimal division. So make a note of it. The specific steps are as follows:

#第一步 1111000 1101 0010000----remainder, quotient is 1, as long as the first not 0 quotient is 1 #第二步, each move one bit, when the starting bit is 0 o'clock, divided by 0, and 1 o'clock divided by divisor.    010000 0000 010000----remainder, quotient is 0, as long as the first is 0 business is 0 #第三步 10000 1101 01010-----Remainder, quotient 1, the remainder of you guess, in fact, is the corresponding bit or #第四步 1010 1101 0111------Remainder, quotient is 1, if the number of digits is smaller than the divisor, no longer continue operation #最终余数为111, quotient is 1011

Modulo 2 division can be used on CRC redundancy check. K,h are 2 digits, K to left R, and K divided by H. Modulo 2 In addition to the resulting remainder in the R bit. For example: K=1111,h=1101,r=3, 1111000 after displacement, finally crc=1111111.