Lines Matching full:remainder

5 A CRC is a long-division remainder.  You add the CRC to the message,
9 remainder computed on the message+CRC is 0. This latter approach
20 Like all division, the remainder is always smaller than the divisor.
36 and append it to the current remainder. Then you figure out the
37 appropriate multiple of the divisor to subtract to being the remainder
39 and to make the XOR cancel, it's just a copy of bit 32 of the remainder.
43 the polynomial from the remainder and we're back to where we started,
49 multiple = remainder & 0x80000000 ? CRCPOLY : 0;
50 remainder = (remainder << 1 | next_input_bit()) ^ multiple;
53 Notice how, to get at bit 32 of the shifted remainder, we look
54 at bit 31 of the remainder *before* shifting it.
57 the remainder don't actually affect any decision-making until
69 remainder ^= next_input_bit() << 31;
70 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
71 remainder = (remainder << 1) ^ multiple;
77 remainder ^= next_input_bit();
78 multiple = (remainder & 1) ? CRCPOLY : 0;
79 remainder = (remainder >> 1) ^ multiple;
82 The most significant coefficient of the remainder polynomial is stored
83 in the least significant bit of the binary "remainder" variable.
92 remainder ^= next_input_byte() << 24;
94 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
95 remainder = (remainder << 1) ^ multiple;
102 remainder ^= next_input_byte();
104 multiple = (remainder & 1) ? CRCPOLY : 0;
105 remainder = (remainder >> 1) ^ multiple;
121 Here, rather than just shifting one bit of the remainder to decide
123 This produces a 40-bit (rather than a 33-bit) intermediate remainder,
144 A "slicing by 2" technique would shift the remainder 16 bits at a time,
145 producing a 48-bit intermediate remainder. Rather than doing a single
147 two different 256-entry tables. Each contains the remainder required
159 leaves the low-order bits of the intermediate remainder zero, the
182 appending it. This makes the remainder of the message+crc come out not
188 a remainder of 0, an initial remainder of all ones is used. As long as