CRC校验代码实现

1.CRC校验简介

CRC就是块数据的计算值,它的全称是“Cyclic Redundancy Check”,中文名是“循环冗余码”。CRC校验是数据通讯中最常采用的校验方式。在嵌入式软件开发中,经常要用到CRC 算法对各种数据进行校验。所谓通讯过程的校验是指在通讯数据后加上一些附加信息,通过这些附加信息来判断接收到的数据是否和发送出的数据相同。

CRC校验计算
      CRC码是由两部分组成,前部分是信息码,就是需要校验的信息,后部分是校验码,如果CRC码共长n个bit,信息码长k个bit,它的编码规则是:
      1、首先将原信息码(kbit)左移r位(k+r=n),对应多项式为m(x)。
      2、运用一个生成R次多项式g(x)(也可看成二进制数)用模2除上面的式子,得到的余数就是校验码,r=R。
      非常简单,要说明的:模2除就是在除的过程中用模2加,模2加实际上就是我们熟悉的异或运算,就是加法不考虑进位,公式是:    
      0+0=1+1=0,1+0=0+1=1,即‘异’则真,‘非异’则假。
      由此得到定理:a+b+b=a 也就是‘模2减’和‘模2加’直值表完全相同。 
      有了加减法就可以用来定义模2除法,于是就可以用生成多项式g(x)生成CRC校验码。
      例如:代码1010111对应的多项式为x6+x4+x2+x+1,而多项式为x5+x3+x2+x+1对应的代码101111。
      现在计算 信息码1011001(多项式为x6+x4+x3+1),生成多项式g(x)=x4+x3+1(信息码为11001)的CRC,计算过程如下
      step1:   1011001左移4位得到10110010000
      steo2:   采用多项式除法:  得余数为: 1010     (即校验字段为:1010)
      CRC码即为1011001,1010 (逗号前为信息码,后为校验码)

代码实现:C#版:

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace MailSendAndReceive
{
  public   class CRC16
    {
        #region CRCTAB 表
        /// <summary>
        /// CRCTAB 表
        /// </summary>
        private static ushort[] crctab = new ushort[256]{
                    0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7,
                    0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef,
                    0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6,
                    0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, 0xf3ff, 0xe3de,
                    0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485,
                    0xa56a, 0xb54b, 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d,
                    0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,
                    0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc,
                    0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823,
                    0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b,
                    0x5af5, 0x4ad4, 0x7ab7, 0x6a96, 0x1a71, 0x0a50, 0x3a33, 0x2a12,
                    0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a,
                    0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41,
                    0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,
                    0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70,
                    0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, 0x9f59, 0x8f78,
                    0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f,
                    0x1080, 0x00a1, 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067,
                    0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e,
                    0x02b1, 0x1290, 0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256,
                    0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,
                    0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,
                    0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e, 0xc71d, 0xd73c,
                    0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634,
                    0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, 0xb98a, 0xa9ab,
                    0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3,
                    0xcb7d, 0xdb5c, 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a,
                    0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,
                    0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9,
                    0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1,
                    0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8,
                    0x6e17, 0x7e36, 0x4e55, 0x5e74, 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0
                    }; 
        #endregion

        #region CRC校验公式
        /// <summary>
        /// CRC校验公式
        /// </summary>
        /// <param name="crc">CRC</param>
        /// <param name="cp">发送的数据序列</param>
        /// <returns>新CRC</returns>
        private static ushort xcrc(ushort crc, byte cp)
        {
            ushort t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0;
            t1 = (ushort)(crc >> 8);
            t2 = (ushort)(t1 & 0xff);
            t3 = (ushort)(cp & 0xff);
            t4 = (ushort)(crc << 8);
            t5 = (ushort)(t2 ^ t3);
            t6 = (ushort)(crctab[t5] ^ t4);
            return t6;
        } 
        #endregion

        #region 在信息串后面添加两个字节的CRC校验字
        /// <summary>
        /// 添加CRC校验字
       /// </summary>
        /// <param name="bufin">信息串</param>
        /// <param name="n">不包括校验字的串总长度</param>
       /// <returns>返回原始信息串再加上两个校验字节的信息串(发送时用)</returns>
        public static byte[] ConCRC(ref byte[] bufin, int n)
        {
            ushort crc16 = 0;
            int i;
            //n个数据的CRC校验
            for (i = 0; i < n; i++)
            {
                crc16 = xcrc(crc16, bufin[i]);
            }
            bufin[i] = (byte)(crc16 >> 8);
            bufin[i + 1] = (byte)(crc16 & 0xff);
            return bufin;
        } 
        #endregion

        #region CRC数据验证
        /// <summary>
        /// CRC数据验证
        /// </summary>
        /// <param name="bufout">信息串</param>
        /// <param name="count">接收数据总长度</param>
        /// <returns>true:校验成功,false:校验失败(接收时校验)</returns>
        public static bool DataCRC(ref byte[] bufout, int count)
        {
            ushort crc16 = 0;
            int i;
            for (i = 0; i < (count - 2); i++)
                crc16 = xcrc(crc16, bufout[i]);
            if ((bufout[count - 2] == (byte)(crc16 >> 8)) && (bufout[count - 1] == (byte)(crc16 & 0xff)))
            {
                return true;
            }
            else
            {
                return false;
            }
        } 
        #endregion
    }
}

参考文章:

http://www.cppblog.com/smagle/archive/2009/02/18/74119.html

参考文章里面有C语言版

原文地址:https://www.cnblogs.com/miaoying/p/5255400.html