Fast CRCs

Fast CRCs
复制标题

快速 CRC

DOI:
10.1109/tc.2009.83
复制
发表时间:
2009
影响因子:
3.7
通讯作者:
G. Nguyen
G. Nguyen
中科院分区:
计算机科学2区
文献类型:
--
作者:
G. Nguyen

文献摘要

被引文献

相似文献

crc具有有效错误检测所需的特性。但它们的软件实现依赖于多项式除法的许多步骤,通常比其他代码(如较弱的校验和)慢。一个相关的问题是,是否有一些特定的crc执行速度很快。在本文中,我们介绍了这种快速crc以及实现它们的有效技术。对于这些快速crc,即使不使用表查找,也可以在计算过程中消除或大大减少多项式除法的许多步骤。
CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation. In this paper, we introduce such fast CRCs as well as an effective technique to implement them. For these fast CRCs, even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.