8位C51，CRC校验原理单片机编程原程序-eight C51, CRC principles SCM original programming procedures 下载
|
这是CRC校验源码的分析，让你更了解CRC校验的原理-This is the CRC-source analysis and let you know more about the principles of the CRC 下载
|
循环冗余校验CRC（Cyclic Redundancy Check）是由分组线性码的分支而来，其主要应用是二元码组。编码简单且误判概率很低，在通信系统中得到了广泛的应用。重点介绍了CRC校验的原理及其算法实现。-Cyclic Redundancy Check (Cyclic Redundancy Check) is a linear code from the branch, its main application is binary codes. Coding simple misjudgment of very low probability, the communications system, which is widely used. Highlights of the CRC algorithm and its principles. 下载
|
crc任意位生成多项式 任意位运算 自适应算法 循环冗余校验码(CRC，Cyclic Redundancy Code)是采用多项式的 编码方式，这种方法把要发送的数据看成是一个多项式的系数 ，数据为bn-1bn-2…b1b0 (其中为0或1)，则其对应的多项式为： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：数据“10010101”可以写为多项式 X７+X４+X２+1。 循环冗余校验CRC 循环冗余校验方法的原理如下： (1) 设要发送的数据对应的多项式为P(x)。 (2) 发送方和接收方约定一个生成多项式G(x)，设该生成多项式 的最高次幂为r。 (3) 在数据块的末尾添加r个0，则其相对应的多项式为M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，获得商Q(x)和余式R(x)，则 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2运算，T(x)所对应的数据是在原数 据块的末尾加上余式所对应的数据得到的。 (6) 发送T(x)所对应的数据。 (7) 设接收端接收到的数据对应的多项式为T’(x)，将T’(x)除以G(x) ，若余式为0，则认为没有错误，否则认为有错-crc-generating polynomial arbitrary arbitrary Operators adaptive algorithm Cyclic Redundancy Check (CRC. Cyclic Redundancy Code) is the polynomial coder, This way the data to be sent as a polynomial coefficient data bn - 1bn-2 ... b1b0 (0 or 1), corresponding to the polynomial : bn - 1Xn-1 bn - 2Xn-2 ... b1X belts such as : data "10010101" polynomial can be written as a X7 X4 X2. Cyclic Redundancy Check Cyclic Redundancy Check method of principle as follows : (1) The data to be sent to the corresponding polynomial p (x). (2) the sender and the receiver agreed on a generator polynomial G (x), set up the generator polynomial of the highest power of r. (3) In the data block Add to the end of r-0, then the polynomial corresponding to M (x) = XrP (x). (R-bits) (4) M (x) divided by G ( 下载
|
crc任意位生成多项式 任意位运算 自适应算法 循环冗余校验码(CRC，Cyclic Redundancy Code)是采用多项式的 编码方式，这种方法把要发送的数据看成是一个多项式的系数 ，数据为bn-1bn-2…b1b0 (其中为0或1)，则其对应的多项式为： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：数据“10010101”可以写为多项式 X７+X４+X２+1。 循环冗余校验CRC 循环冗余校验方法的原理如下： (1) 设要发送的数据对应的多项式为P(x)。 (2) 发送方和接收方约定一个生成多项式G(x)，设该生成多项式 的最高次幂为r。 (3) 在数据块的末尾添加r个0，则其相对应的多项式为M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，获得商Q(x)和余式R(x)，则 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2运算，T(x)所对应的数据是在原数 据块的末尾加上余式所对应的数据得到的。 (6) 发送T(x)所对应的数据。 (7) 设接收端接收到的数据对应的多项式为T’(x)，将T’(x)除以G(x) ，若余式为0，则认为没有错误，否则认为有错。 -crc-generating polynomial arbitrary arbitrary Operators adaptive algorithm Cyclic Redundancy Check (CRC. Cyclic Redundancy Code) is the polynomial coder, This way the data to be sent as a polynomial coefficient data bn - 1bn-2 ... b1b0 (0 or 1), corresponding to the polynomial : bn - 1Xn-1 bn - 2Xn-2 ... b1X belts such as : data "10010101" polynomial can be written as a X7 X4 X2. Cyclic Redundancy Check Cyclic Redundancy Check method of principle as follows : (1) The data to be sent to the corresponding polynomial p (x). (2) the sender and the receiver agreed on a generator polynomial G (x), set up the generator polynomial of the highest power of r. (3) In the data block Add to the end of r-0, then the polynomial corresponding to M (x) = XrP (x). (R-bits) (4) M (x) divided by G ( 下载
|
16位modbus循环冗余校验，是一种工业应用标准，本代码使用于初学者掌握crc基本原理，欢迎下载，呵呵- 下载
|
通信的目的是要把信息及时可靠地传送给对方，因此要求一个通信系统传输消息必须可靠与快速，在数字通信系统中可靠与快速往往是一对矛盾。为了解决可靠性，通信系统都采用了差错控制。本文详细介绍了循环冗余校验CRC（Cyclic Redundancy Check）的差错控制原理及其算法实现。-the purpose of communication is to timely and reliable information to be transmitted to the other side, thus requiring a communication system to be reliable information transmission and rapid, in a digital communication system reliable and fast is too often one of contradictions. This paper describes a Cyclic Redundancy Check (Cyclic Redundancy Check) Principles and error control algorithm. 下载
|
函数名称:CRC-16 Process 函数原型:INT16U make_crc16(INT8U *msgaddr,INT8U datalen) 函数功能:进行CRC校验和产生CRC代码.这个函数只影响全局变量crc16. 校验字放在字符串最后,低8位在前高8位在后. msgaddr : 进行CRC16校验的据块的首地址 datalen : 进行CRC16校验的据块的个数 CRC-ITU的计算算法如下： a.寄存器组初始化为全"1"(0xFFFF)。 b.寄存器组向右移动一个字节。 c.刚移出的那个字节与数据字节进行异或运算，得出一个指向值表的索引。 d.索引所指的表值与寄存器组做异或运算。 f.数据指针加1，如果数据没有全部处理完，则重复步骤b。 g.寄存器组取反，得到CRC，附加在数据之后(这一步可省略)。- 下载
|
怀恋Dos时代吗？ 这里有一个Dos下的加/解密软件[提供原代码！]，叫做VCDKEY,你可能要奇怪为什么叫VCDKEY？这要从上大学时候说起了：大学时候，有个铁哥们叫做"小胖子"，此兄爱看VCD碟子，于是经常租碟在自己电脑上看，而且还经常将一些喜欢的精彩片段辑录到电脑中，而其人缘极好，经常有人去他电脑上玩，但他又不愿意让别人看到他录下的东西！有天，他跟我谈到了他的苦衷，于是，我决定为我的哥们写个东西，于是就有了这个东西！ 其实，它的原理很简单，就是文件各字节的异或，但是要配合好字节的异或却要做一些另外的工作！而且它还具有CRC校验及运行时候的进度提示！作为个人的文件加密，C语言的学习都有一定的价值吧！ 本人才疏学浅，没有炫耀之意思，只想代码，软件共享，大家共同提高！ -nostalgia for the times? Here is a Dos under the plus / decryption software [for the original code! ] Called VCDKEY, you may be wondering why VCDKEY called? From this time on the University Speaking : University of time, to have a buddy called "Overweight", brother love VCD plate, so often rent CDs on their computers perspective, but also often like some of the highlights of all of the computer, and its excellent personal relationship, it was often to go to his computer to play , but he is unwilling to let people see his record things! One day, he told me he talked of the difficulties, and I decided for my brother to write things, he was such a thing! Actually, the principle is very simple. Bytes of the file or different, but to meet good-byte XOR has to be done some other work! 下载
|