针对在CRC-32校验码生成方法中,固定电路成本高且缺乏灵活性,传统按位串行算法计算速度慢、查表法需要额外占用空间问题,提出了基于递推法的CRC-32校验码并行改进算法.该算法以递推法为基础,根据实际情况中不同的计算速度和占用空间的需求,计算出并行输入任意n位数据时CRC寄存器中新老数据之间的并行逻辑关系,并根据这一逻辑关系修改程序,从而达到在一定占用空间的限制下,最大程度提升运算速度的目的.仿真结果表明,改进算法存储空间小于查表法,有利于小型化、快速化的硬件实现.%In all of the CRC-32 check code generation methods, the fixed circuit has high cost and lack of flexibility. The traditional bit-wise serial algorithm is slow in calculation and the look-up table method requires extra space. This paper proposed a new improved parallel algorithm for CRC-32 check code based on recursive method for the limitation of firing environment. The algorithm is based on the recursive method. When arbitrary n-bit data is parallel input, the parallel logical relationship between the new and old data in the CRC register is calculated according to the different calculation speed and space requirements in actual situation. So as to achieve the purpose of maximizing the operation speed under the limitation of a certain space. The simulation results showed that the improved parallel algorithm for CRC-32 check code based on recursive method was faster than the bit-wise serial calculation method, and the took less storage space than the look-up table method, which would be beneficial to the miniaturization and rapid hardware implementation.
展开▼
