本文主要是介绍Qt5.9 写的一个crc校验例子,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
界面如下图:
界面很简单 从网上随便找了个crc8 crc16 crc32算法直接加进去了,想实现其他算法的自己添加就可以了
main就不介绍了,界面 一个textEdit commbox pushbutton lineEdit 就这几个控件
通过信号槽判断选中的算法然后 pushbutton按下去执行对应的算法
代码如下:
crcchecksum.h
#ifndef CRCCHECKSUM_H
#define CRCCHECKSUM_H#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <QByteArray>
#include <QString>
#include <QStringList>
#include <QDebug>typedef unsigned char u8;
typedef unsigned char byte;
typedef unsigned short u16;
typedef unsigned int u32;class crcCheckSum
{
public:crcCheckSum();quint16 crc16ForModbus(const QByteArray &data);quint8 Crc8(const QByteArray &data);quint16 Crc16(const QByteArray &data);u32 Crc32(byte *_pBuff, u16 _size);
};#endif // CRCCHECKSUM_H
crcchecksum.cpp
#include "crcchecksum.h"crcCheckSum::crcCheckSum()
{}// x16 x15 x2 1
quint16 crcCheckSum::crc16ForModbus(const QByteArray &data)
{static const quint16 crc16Table[] ={0x0000, 0xC0C1, 0xC181, 0x0140, 0xC301, 0x03C0, 0x0280, 0xC241,0xC601, 0x06C0, 0x0780, 0xC741, 0x0500, 0xC5C1, 0xC481, 0x0440,0xCC01, 0x0CC0, 0x0D80, 0xCD41, 0x0F00, 0xCFC1, 0xCE81, 0x0E40,0x0A00, 0xCAC1, 0xCB81, 0x0B40, 0xC901, 0x09C0, 0x0880, 0xC841,0xD801, 0x18C0, 0x1980, 0xD941, 0x1B00, 0xDBC1, 0xDA81, 0x1A40,0x1E00, 0xDEC1, 0xDF81, 0x1F40, 0xDD01, 0x1DC0, 0x1C80, 0xDC41,0x1400, 0xD4C1, 0xD581, 0x1540, 0xD701, 0x17C0, 0x1680, 0xD641,0xD201, 0x12C0, 0x1380, 0xD341, 0x1100, 0xD1C1, 0xD081, 0x1040,0xF001, 0x30C0, 0x3180, 0xF141, 0x3300, 0xF3C1, 0xF281, 0x3240,0x3600, 0xF6C1, 0xF781, 0x3740, 0xF501, 0x35C0, 0x3480, 0xF441,0x3C00, 0xFCC1, 0xFD81, 0x3D40, 0xFF01, 0x3FC0, 0x3E80, 0xFE41,0xFA01, 0x3AC0, 0x3B80, 0xFB41, 0x3900, 0xF9C1, 0xF881, 0x3840,0x2800, 0xE8C1, 0xE981, 0x2940, 0xEB01, 0x2BC0, 0x2A80, 0xEA41,0xEE01, 0x2EC0, 0x2F80, 0xEF41, 0x2D00, 0xEDC1, 0xEC81, 0x2C40,0xE401, 0x24C0, 0x2580, 0xE541, 0x2700, 0xE7C1, 0xE681, 0x2640,0x2200, 0xE2C1, 0xE381, 0x2340, 0xE101, 0x21C0, 0x2080, 0xE041,0xA001, 0x60C0, 0x6180, 0xA141, 0x6300, 0xA3C1, 0xA281, 0x6240,0x6600, 0xA6C1, 0xA781, 0x6740, 0xA501, 0x65C0, 0x6480, 0xA441,0x6C00, 0xACC1, 0xAD81, 0x6D40, 0xAF01, 0x6FC0, 0x6E80, 0xAE41,0xAA01, 0x6AC0, 0x6B80, 0xAB41, 0x6900, 0xA9C1, 0xA881, 0x6840,0x7800, 0xB8C1, 0xB981, 0x7940, 0xBB01, 0x7BC0, 0x7A80, 0xBA41,0xBE01, 0x7EC0, 0x7F80, 0xBF41, 0x7D00, 0xBDC1, 0xBC81, 0x7C40,0xB401, 0x74C0, 0x7580, 0xB541, 0x7700, 0xB7C1, 0xB681, 0x7640,0x7200, 0xB2C1, 0xB381, 0x7340, 0xB101, 0x71C0, 0x7080, 0xB041,0x5000, 0x90C1, 0x9181, 0x5140, 0x9301, 0x53C0, 0x5280, 0x9241,0x9601, 0x56C0, 0x5780, 0x9741, 0x5500, 0x95C1, 0x9481, 0x5440,0x9C01, 0x5CC0, 0x5D80, 0x9D41, 0x5F00, 0x9FC1, 0x9E81, 0x5E40,0x5A00, 0x9AC1, 0x9B81, 0x5B40, 0x9901, 0x59C0, 0x5880, 0x9841,0x8801, 0x48C0, 0x4980, 0x8941, 0x4B00, 0x8BC1, 0x8A81, 0x4A40,0x4E00, 0x8EC1, 0x8F81, 0x4F40, 0x8D01, 0x4DC0, 0x4C80, 0x8C41,0x4400, 0x84C1, 0x8581, 0x4540, 0x8701, 0x47C0, 0x4680, 0x8641,0x8201, 0x42C0, 0x4380, 0x8341, 0x4100, 0x81C1, 0x8081, 0x4040};quint8 buf;quint16 crc16 = 0xFFFF;for ( auto i = 0; i < data.size(); ++i ){buf = data.at( i ) ^ crc16;crc16 = (crc16>>8) ^ crc16Table[ buf ];}return crc16;
}
/*多项式一:x8+x5+x4+1 0x31多项式二:x8+x2+x1+1 0x07多项式三:x8+x6+x4+x3+x2+x1 0x5E
*///CRC-8/MAXIM: x8+x5+x4+1
static const u8 caCrc8Data[256] = {0x00, 0x5e, 0xbc, 0xe2, 0x61, 0x3f, 0xdd, 0x83,0xc2, 0x9c, 0x7e, 0x20, 0xa3, 0xfd, 0x1f, 0x41,0x9d, 0xc3, 0x21, 0x7f, 0xfc, 0xa2, 0x40, 0x1e,0x5f, 0x01, 0xe3, 0xbd, 0x3e, 0x60, 0x82, 0xdc,0x23, 0x7d, 0x9f, 0xc1, 0x42, 0x1c, 0xfe, 0xa0,0xe1, 0xbf, 0x5d, 0x03, 0x80, 0xde, 0x3c, 0x62,0xbe, 0xe0, 0x02, 0x5c, 0xdf, 0x81, 0x63, 0x3d,0x7c, 0x22, 0xc0, 0x9e, 0x1d, 0x43, 0xa1, 0xff,0x46, 0x18, 0xfa, 0xa4, 0x27, 0x79, 0x9b, 0xc5,0x84, 0xda, 0x38, 0x66, 0xe5, 0xbb, 0x59, 0x07,0xdb, 0x85, 0x67, 0x39, 0xba, 0xe4, 0x06, 0x58,0x19, 0x47, 0xa5, 0xfb, 0x78, 0x26, 0xc4, 0x9a,0x65, 0x3b, 0xd9, 0x87, 0x04, 0x5a, 0xb8, 0xe6,0xa7, 0xf9, 0x1b, 0x45, 0xc6, 0x98, 0x7a, 0x24,0xf8, 0xa6, 0x44, 0x1a, 0x99, 0xc7, 0x25, 0x7b,0x3a, 0x64, 0x86, 0xd8, 0x5b, 0x05, 0xe7, 0xb9,0x8c, 0xd2, 0x30, 0x6e, 0xed, 0xb3, 0x51, 0x0f,0x4e, 0x10, 0xf2, 0xac, 0x2f, 0x71, 0x93, 0xcd,0x11, 0x4f, 0xad, 0xf3, 0x70, 0x2e, 0xcc, 0x92,0xd3, 0x8d, 0x6f, 0x31, 0xb2, 0xec, 0x0e, 0x50,0xaf, 0xf1, 0x13, 0x4d, 0xce, 0x90, 0x72, 0x2c,0x6d, 0x33, 0xd1, 0x8f, 0x0c, 0x52, 0xb0, 0xee,0x32, 0x6c, 0x8e, 0xd0, 0x53, 0x0d, 0xef, 0xb1,0xf0, 0xae, 0x4c, 0x12, 0x91, 0xcf, 0x2d, 0x73,0xca, 0x94, 0x76, 0x28, 0xab, 0xf5, 0x17, 0x49,0x08, 0x56, 0xb4, 0xea, 0x69, 0x37, 0xd5, 0x8b,0x57, 0x09, 0xeb, 0xb5, 0x36, 0x68, 0x8a, 0xd4,0x95, 0xcb, 0x29, 0x77, 0xf4, 0xaa, 0x48, 0x16,0xe9, 0xb7, 0x55, 0x0b, 0x88, 0xd6, 0x34, 0x6a,0x2b, 0x75, 0x97, 0xc9, 0x4a, 0x14, 0xf6, 0xa8,0x74, 0x2a, 0xc8, 0x96, 0x15, 0x4b, 0xa9, 0xf7,0xb6, 0xe8, 0x0a, 0x54, 0xd7, 0x89, 0x6b, 0x35
};quint8 crcCheckSum::Crc8(const QByteArray &data) {
// int i;
// u8 temp, CRC8;
// CRC8 = 0xff;
// for (i = 0; i < _size; i++) {
// temp = *(_pBuff + i) ^ CRC8;
// CRC8 = caCrc8Data[temp];
// }
// return (CRC8);quint8 buf;quint8 crc8 = 0x00; /* 该处修改 */for(auto i = 0;i<data.size();i++){buf = data.at(i) ^crc8;crc8 = caCrc8Data[buf];qDebug()<<crc8;}return crc8;
}quint16 crcCheckSum::Crc16(const QByteArray &data) {
// int i, j;
// u32 c;
// u32 CRC16;// CRC16 = 0xFFFF;
// for (i = 0; i < _size; i++) {
// c = _pBuff[i] & 0x00FF;
// CRC16 ^= c;
// for (j = 0; j < 8; j++) {
// if (CRC16 & 0x0001) {
// CRC16 >>= 1;
// CRC16 ^= 0xA001;
// } else {
// CRC16 >>= 1;
// }
// }
// }
// CRC16 = (CRC16 >> 8) + (CRC16 << 8);
// return (CRC16);quint16 c,crc16;crc16 = 0xFFFF;for(int i=0; i< data.size();i++){c = data.at(i) &0x00FF;crc16 ^= c;for(int j = 0; j<8; j++){if(crc16 & 0x0001){crc16 >>=1;crc16 ^= 0xA001;}else{crc16 >>= 1;}}}crc16 = (crc16 >>8 ) + (crc16<<8);return (crc16);
}u32 crcCheckSum::Crc32(byte *_pBuff, u16 _size) {int i, j;u32 CRC32;CRC32 = 0xFFFFFFFF;for (i = 0; i < _size; i++) {for (j = 0; j < 8; j++) {if (CRC32 & 1) {CRC32 = (CRC32 >> 1) ^ 0xEDB88320;} else {CRC32 = (CRC32 >> 1);}if (_pBuff[i] & (1 << j)) {CRC32 ^= 0xEDB88320;}}}CRC32 = ~CRC32;return (CRC32);
}
widget.cpp
#include "widget.h"
#include "ui_widget.h"
#include "crcchecksum.h"Widget::Widget(QWidget *parent) :QWidget(parent),ui(new Ui::Widget)
{ui->setupUi(this);comBoxIndex = 0;connect(ui->comboBox, SIGNAL(currentIndexChanged(int)),this,SLOT(currentIndexChanged(int)));
}Widget::~Widget()
{delete ui;
}/*static u8 crc8SumTable(u8 *p, int len);u8 Crc8Sum(u8 *buf, int len);void coverHex(u8 *des,u8 *source, int len);
*/
void Widget::on_pushButton_clicked()
{//清除空格QString inputData = ui->textEdit->toPlainText();if(inputData.isEmpty()) return;auto data = QByteArray::fromHex(inputData.toLocal8Bit());QString str;quint8 crc8;quint16 crc16;quint16 crc162;switch(comBoxIndex){case 0: //crc8{crc8 = crcCheck.Crc8(data);str = QString::number(crc8,16).toUpper();break;}case 1://crc16{crc16 = crcCheck.crc16ForModbus(data);str = QString::number(crc16,16).toUpper();break;}case 2://crc32{crc162 = crcCheck.Crc16(data);str = QString::number(crc162,16).toUpper();break;}case 3:break;default:break;}ui->lineEdit->setText(str);
}void Widget::currentIndexChanged(int currentIndex)
{comBoxIndex = currentIndex;
}
CRC校验(循环冗余校验)小知识
CRC即循环冗余校验码(Cyclic Redundancy Check):是数据通信领域中最常用的一种查错校验码,其特征是信息字段和校验字段的长度可以任意选定。循环冗余检查(CRC)是一种数据传输检错功能,对数据进行多项式计算,并将得到的结果附在帧的后面,接收设备也执行类似的算法,以保证数据传输的正确性和完整性。CRC算法参数模型解释:
NAME:参数模型名称。
WIDTH:宽度,即CRC比特数。
POLY:生成项的简写,以16进制表示。例如:CRC-32即是0x04C11DB7,忽略了最高位的"1",即完整的生成项是0x104C11DB7。
INIT:这是算法开始时寄存器(crc)的初始化预置值,十六进制表示。
REFIN:待测数据的每个字节是否按位反转,True或False。
REFOUT:在计算后之后,异或输出之前,整个数据是否按位反转,True或False。
XOROUT:计算结果与此参数异或后得到最终的CRC值。其他相关工具:LRC校验BCC校验
关于校验不一样的说明:
由于采用不同的校验方式,crc8也有多种校验算法,各有差异.
举例cdt协议中的校验算法,多项式值0x07, 初值采用0x00,异或值采用0xFF,位宽8,在线计算结果如下 (假设 hex数据:F1 00 00 00 00):
方法一:
void crc8_CDT_init(uint32_t poly) {uint16_t crc;for (int i = 0, j; i < 256; i++) {crc = 0x00FF & i;for (j = 0; j < 8; j++) {crc =0x00FF & (((crc & 0x80) == 0x80) ? (poly ^ (crc << 1)) : (crc << 1));}table[i] = crc;if ((i + 1) % 8 == 0) {printf(" 0x%02x\n", crc);} else {printf(" 0x%02x", crc);}}
}uint8_t crc8_CDT(uint8_t crc, void* input, int len) {int i;uint8_t index;uint8_t* p;p = (uint8_t*)input;for (i = 0; i < len; i++) {index = (*p ^ crc);crc = table[index];p++;}return crc ^ 0xFF;
}
/* 调用方式 */
char hexD[5] = {0xF1, 0x0, 0x0, 0x0, 0x00};crc8_CDT_init(0x07); /* 0x5E 生成表 */crc = crc8_CDT(0x00, hexD, 5);printf("CRC8_CDT_5e = 0x%02x\n", (uint8_t)crc);
方法二:
unsigned char CRC_8_bit(unsigned char* pData, int count) {unsigned char CRC = 0x00;unsigned char cData;for (int n = 0; n <= count; ++n) {// 处理的字节cData = 0;if (n < count)cData = pData[n];elsecData = 0; // 数据结束for (int i = 0; i < 8; i++) {// CRC最高位// 后续的数据CRC = ((CRC >> 7) & 0x01) ? (0x07 ^ ((CRC << 1) | (cData >> 7))): ((CRC << 1) | (cData >> 7));cData <<= 1;}}return CRC;
}// 按字节计算CRC8
unsigned char CRC_8_Byte(unsigned char* pData, int count) {// 生成查找表static unsigned char crc8Table[256] = {0};unsigned char crcB = 0;for (int i = 0; i < 0x100; ++i) {crcB = i;crc8Table[i] = CRC_8_bit(&crcB, 1);if ((i + 1) % 8 == 0) {printf(" 0x%02x\n", crc8Table[i]);} else {printf(" 0x%02x", crc8Table[i]);}}// 查表计算unsigned char CRC = 0x00;for (int n = 0; n < count; ++n) {CRC = crc8Table[CRC] ^ crc8Table[pData[n]];}return CRC;
}unsigned char CRC_8_M(unsigned char* pData, int count) {return 0xFF ^ CRC_8_Byte(pData, count); // 陪集码为0xff// 也可用// return 0xFF ^ CRC_8_bit(pData, count);
}/* 调用方式 */
crc = CRC_8_M(hexD, 5);
printf("CRC8_M_5e = 0x%02x\n", (uint8_t)crc);
main 和pro就默认的没修改。东西很简单,不懂了欢迎留言。
再添加两个crc8de 校验:
校验公式
CRC-8 | x8 + x2 + x + 1 | 8 | 07 | 00 | 00 | false | false |
crc公式值0x07
初值 0x00
异或值0x00
代码如下:
u8 crc8_n_init(u8 poly){u16 crc;for (int i = 0, j; i < 256; i++) {crc = 0x00FF & i;for (j = 0; j < 8; j++) {crc =0x00FF & (((crc & 0x80) == 0x80) ? (poly ^ (crc << 1)) : (crc << 1));}table[i] = crc;}return 0;
}uint8_t crc8_n(uint8_t crc, void* input, int len) {int i;uint8_t index;uint8_t* p;p = (uint8_t*)input;for (i = 0; i < len; i++) {index = (*p ^ crc);crc = table[index];p++;}return crc ^ 0x00;
}
计算公式:
CRC-8/ITU | x8 + x2 + x + 1 | 8 | 07 | 00 | 55 | false | false |
crc公式值0x07
初值 0x00
异或值0x55
代码如下:
u8 crc8_itu_init(u8 poly){u16 crc;for (int i = 0, j; i < 256; i++) {crc = 0x00FF & i;for (j = 0; j < 8; j++) {crc =0x00FF & (((crc & 0x80) == 0x80) ? (poly ^ (crc << 1)) : (crc << 1));}table[i] = crc;}return 0;
}uint8_t crc8_itu_n(uint8_t crc, void* input, int len) {int i;uint8_t index;uint8_t* p;p = (uint8_t*)input;for (i = 0; i < len; i++) {index = (*p ^ crc);crc = table[index];p++;}return crc ^ 0x55;
}
以上两个crc8调用方法
u8 crc8_n_init(u8 poly); // 0x07
uint8_t crc8_n(uint8_t crc, void *input, int len); //初值0x00u8 crc8_itu_init(u8 poly); // 0x07
uint8_t crc8_itu_n(uint8_t crc, void *input, int len); //初值0x00#include "crcFun.h"
int main()
{char abv[]={0x56,0x20,0x80,0x99,0xab};crc8_n_init(0x07);printf("crc_n:%02x\r\n",crc8_n(0x00,abv,getarraylen(abv)));crc8_itu_init(0x07);printf("crc_itu:%02x\r\n",crc8_itu_n(0x00,abv,getarraylen(abv)));return 0;
}
执行结果:
crc_n:70
crc_itu:25
源码:点我下载
这篇关于Qt5.9 写的一个crc校验例子的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!