摘要
通过对CRC校验码原理的分析,研究了一种并行32位CRC算法。该算法采用递推的方法,直接得出计算多位数据后的CRC余数与计算前余数之间的逻辑关系。相对于一般的按位串行计算或者查表并行计算的方法来说,该方法运算速度快且不需要额外的空间存储余数表,十分有利于硬件实现。
Based on the theory of the cyclic redundancy check, a parallel algorithm is studied in the paper. This algorithm uses a recursive method to calculate the logic relationship of the checksum. Differing from general serial algorithm or the parallel algorithm based on list- checking, it is faster and doesn＇t need the extra memory space to store the remainder list. It is very easy to be implemented by hardware.
出处
《信息技术》
2007年第4期71-74,共4页
Information Technology
关键词
CRC
模2运算
并行CRC算法
Cyclic redundancy check
modulo 2 arithmetic
CRC parallel algorithm
