作者: Andrew Michael Jones , Marc Owen Homewood
DOI:
关键词: Byte 、 Cyclic redundancy check 、 Loop (topology) 、 Computer science 、 Longitudinal redundancy check 、 Arithmetic 、 Operand 、 Parallel computing 、 Generator (computer programming) 、 Set (abstract data type) 、 Value (computer science)
摘要: A cyclic redundancy check value is computed by iterating a loop in which the contents of an operand having first CRC and data are shifted 1 bit to end at located. generator exclusive-RED into corresponding respective bits only if out shift was set. This repeated until byte has been displaced entirely modified occupies most significant bytes, but now incorporates original form.