Cyclic redundancy check in a computer system

作者: Andrew Michael Jones , Marc Owen Homewood

DOI:

关键词: ByteCyclic redundancy checkLoop (topology)Computer scienceLongitudinal redundancy checkArithmeticOperandParallel computingGenerator (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.

参考文章(10)
Sunil P. Joshi, Venkatraman Iyer, CRC calculation machine with variable bit boundary ,(1985)
D. V. Sarwate, Computation of cyclic redundancy checks via table look-up Communications of The ACM. ,vol. 31, pp. 1008- 1013 ,(1988) , 10.1145/63030.63037
Aram Perez, Byte-Wise CRC Calculations IEEE Micro. ,vol. 3, pp. 40- 50 ,(1983) , 10.1109/MM.1983.291120
J. Arjun Prabhu, Denton E. Gentry, SIMD TCP/UDP checksumming in a CPU ,(1997)
William J. Harmon, John R. Mick, Processor unit for microcomputer systems ,(1980)
Takeshi Shimizu, Patrick James Helland, Thomas Martin Wicki, Method and apparatus for detection of errors in multiple-word communications ,(1997)