基于英特尔架构的LTE系统的一种CRC校检算法-《计算机技术与发展》

文章信息/Info

作者:: 翟晓彤¹; 2 张代远[1; 2; 3]; [1]南京邮电大学计算机学院[2]江苏省无线传感网高技术研究重点实验室[3]南京邮电大学计算机技术研究所

Author(s):: ZHAI Xiao-tong ; ZHANG Dai-yuan; [1]College of Computer, Nanjing University of Posts and Telecommunications[2]Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks[3]Institute of Computer Technology, Nanjing University of Posts and Telecommunications

摘要:: 循环冗余校验码CRC（CyclicRedundancyCheck）是数据通信领域中最常用的一种差错校验码，文中引用了一种基于IA（IntelArchitecture）PCLMULQDQ指令的快速CRC算法，用于在LTE系统中快速实现CRC24校检算法。不同于使用传统的约简算法简化信息，该算法通过一种快速的折叠途径将一个任意长度的缓冲器缩减至较小的长度，然后使用传统的约简算法（比如巴雷特约简算法）做进一步简约计算。文中通过c＋＋代码实现这种快速CRC算法模拟并与传统算法做比较，从而验证该算法的有效性

Abstract:: 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 algorithm 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