Lines Matching refs:bit

14   subtract, we just xor.  Thus, we tend to get a bit sloppy about
18 To produce a 32-bit CRC, the divisor is actually a 33-bit CRC polynomial.
19 Since it's 33 bits long, bit 32 is always going to be set, so usually the
20 CRC is written in hex with the most significant bit omitted.  (If you're
27 little-endian; the most significant bit (sometimes used for parity)
31 Just like with ordinary division, you proceed one digit (bit) at a time.
32 Each step of the division you take one more digit (bit) of the dividend
36 and to make the XOR cancel, it's just a copy of bit 32 of the remainder.
39 throw the quotient bit away, but subtract the appropriate multiple of
41 ready to process the next bit.
49 Notice how, to get at bit 32 of the shifted remainder, we look
50 at bit 31 of the remainder *before* shifting it.
55 Also, to add the CRC to a message, we need a 32-bit-long hole for it at
78 in the least significant bit of the binary "remainder" variable.
80 be bit-reversed) and next_input_bit().
84 We can do it 8 bits at a time rather than 1 bit at a time:
102 If the input is a multiple of 32 bits, you can even XOR in a 32-bit
106 bulk of a message byte-at-a-time and adding bit-at-a-time processing
114 Here, rather than just shifting one bit of the remainder to decide
116 This produces a 40-bit (rather than a 33-bit) intermediate remainder,
123 4-bit shifts followed by a lookup in a 16-entry table.
138 producing a 48-bit intermediate remainder.  Rather than doing a single
151 broken into bytes and looked up in the tables.  Because the 32-bit shift
160 in parallel.  Each step, the 32-bit CRC is shifted 64 bits and XORed