Lines Matching full:at

34 Just like with ordinary division, you proceed one digit (bit) at a time.
53 Notice how, to get at bit 32 of the shifted remainder, we look
54 at bit 31 of the remainder *before* shifting it.
59 Also, to add the CRC to a message, we need a 32-bit-long hole for it at
60 the end, so we have to add 32 extra cycles shifting in zeros at the
89 We can do it 8 bits at a time rather than 1 bit at a time::
110 word at a time and increase the inner loop count to 32.
113 bulk of a message byte-at-a-time and adding bit-at-a-time processing
114 for any fractional bytes at the end.
117 the byte-at-a-time table method, popularized by Dilip V. Sarwate,
122 in the correct multiple to subtract, we can shift a byte at a time.
132 It is not practical to process much more than 8 bits at a time using this
144 A "slicing by 2" technique would shift the remainder 16 bits at a time,
170 on the previous CRC at all.  Thus, those 4 table look-ups may commence