Cyclic redundancy check algorithm of non-integral byte data

A technology of cyclic redundancy check and byte data, which is applied in the direction of digital transmission system, electrical components, and error prevention, and can solve the problems of high calculation efficiency, short time consumption, and low efficiency

Active Publication Date: 2013-09-11
CHENGDU GUOXING COMM
View PDF2 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, the calculation method of CRC has two completely different ways: bit-by-bit calculation and byte-based calculation. By-byte calculation has high calculation efficiency, and the number of cycles in the calculation process is 1/8 of bit-based calculation, and the calculation is time-consuming. Short and controllable, the byte method completes the calculation through table lookup, which takes a short time and is fixed. It is far more suitable for real-time embedded systems than the bit method calcula

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Cyclic redundancy check algorithm of non-integral byte data
  • Cyclic redundancy check algorithm of non-integral byte data
  • Cyclic redundancy check algorithm of non-integral byte data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043]Further describe the technical scheme of the present invention in detail below: a kind of cyclic redundancy check algorithm of non-integral byte data, CRC mathematical essence is to transfer information polynomial to CRC generating polynomial seeking remainder, and the generating polynomial of CRC16 is:

[0044] G(x)=x 16 +x 12 +x 5 +1, the calculation method is: add 16 0s to the back of S(x), that is

[0045] S(x)=r 16 ×S(x), where r=2 is the basis of the binary polynomial operation, and then S(x) performs division operation on the generator polynomial G(x), that is, performs logical XOR operation, and finally obtains the remainder of the division, which is CRC16 , referred to as C reg , and the quotient part is referred to as M(x), which includes the following steps:

[0046] S1: Suppose S m The corresponding CRC16 value is C reg , by definition, then:

[0047] CRC S m = ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a cyclic redundancy check algorithm of non-integral byte data. The cyclic redundancy check algorithm of the non-integral byte data comprises obtaining a CRC16 value of a fist byte S0 through directly looking up a table of Crcl6-Table [S0]; performing exclusive or on Bn and a n bits higher CH of the CRC16 value a last byte and performing the exclusive or result as a subscript to be looked up the table to obtain Crcl6-Table [(CH+Bn)]; and performing exclusive or on a n bits left shifted (16-n) bits and the table looked up value Crcl6-Table [(CH+Bn)]. The value relationship of n is that n is equal to 8 when an integral byte CRC 16 is calculated and the n is the actual bite when the CRC 16 which not satisfies a bite. The cyclic redundancy check algorithm of the non-integral byte data has the advantages of being applicable to a situation that input information which is a non-integral byte cannot be calculated according to the bites, greatly improving the calculation efficiency, reducing the calculation time, releasing a large number of CPU (Central Processing Unit) resources and reducing power consumption of the CPU.

Description

technical field [0001] The invention relates to a cyclic redundancy check algorithm for non-integral byte data. Background technique [0002] In various data communications, the data is generally transmitted in groups, and the data frame check sequence (Frame Check Sequence, referred to as FCS) is added to the grouped data for error control to ensure the correctness of data transmission. In the realization of the frame check sequence, the cyclic redundancy check code (Cyclic Redundancy Code, referred to as CRC) has been widely used for its high efficiency and high performance. method of reliability. [0003] During the data transmission process, the sending end calculates the CRC check code for the data to be transmitted, and attaches the check code to the transmitted data and sends it together. The receiving end needs to use the same calculation method to calculate the check code of the received data, and then compare the calculated CRC code with the received CRC code. If...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L1/00
Inventor 杨尚胜
Owner CHENGDU GUOXING COMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products