摘要
循环冗余校验码CRC(Cyclic Redundancy Check)是数据通信领域中最常用的一种差错校验码,文中引用了一种基于IA(Intel Architecture)PCLMULQDQ指令的快速CRC算法,用于在LTE系统中快速实现CRC24校检算法。不同于使用传统的约简算法简化信息,该算法通过一种快速的折叠途径将一个任意长度的缓冲器缩减至较小的长度,然后使用传统的约简算法(比如巴雷特约简算法)做进一步简约计算。文中通过C++代码实现这种快速CRC算法模拟并与传统算法做比较,从而验证该算法的有效性。
Cyclic redundancy check is the most commonly used error check code in the field of data communication. Quoted one kind of fast CRC algorithm based on the IA ( Intel Architecture) PCLMULQDQ instruction which is used in LTE system for the CRC24 algo- rithm implementation, the C++ code was designed for the implementation. Unlike traditional reduction algorithm to reduce the entire mes sage, the algorithm uses a fast folding approach which will reduce an arbitrary length of the buffer to a smaller length, then use the tradi tional algorithms ( such as Barrett reduction algorithm) to do further reduction calculation. Achieve the fast CRC algorithm simulation and compare with traditional algorithm through the C++ code,which verifies the validity of the algorithm.
出处
《计算机技术与发展》
2012年第12期93-96,共4页
Computer Technology and Development
基金
江苏高校优势学科建设工程资助项目(yx002001)