Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for parallel computing code of CRC in multiple channels and multiple bits

A parallel computing and multi-channel technology, applied in the field of data transmission, can solve problems such as high cost, poor anti-interference ability, and inability to meet ultra-high-speed CRC calculations

Inactive Publication Date: 2003-07-23
XIDIAN UNIV
View PDF1 Cites 35 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] 2) Each queue uses the software look-up table method to calculate the CRC code, which cannot meet the requirements of 10G Ethernet (1G=10 9 ), 40Gbps synchronous digital sequence SDH required ultra-high-speed CRC calculation (bps=bit per second, bit (bit) / second);
Due to the high working clock frequency of the calculation, there are defects of poor anti-interference ability, poor reliability, and high cost

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
  • Method for parallel computing code of CRC in multiple channels and multiple bits
  • Method for parallel computing code of CRC in multiple channels and multiple bits
  • Method for parallel computing code of CRC in multiple channels and multiple bits

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0074] refer to figure 1 , the multi-channel multi-bit parallel CRC calculation method of the present invention is to calculate the data of the whole CRC code by every L S Bits are divided into N data blocks (N≥2), which are put into queues (1, 2, 3, ..., N-1, N) in sequence. Because the total number of bits of the data to be calculated is not necessarily equal to L S divisible, let the last queue length be L F bit (1≤L F ≤ L S ). N channels perform CRC calculation on the data blocks in their respective channels at the same time, and obtain the CRC code (r 1 , r 2 ,...,r N-1 , r N ), through the remainder transformation table pair (r 1 , r 2 ,...,r N-1 ) is obtained by using software or hardware to look up the table (R 1 , R 2 ,...,R N-1 ), then to (R 1 , R 2 ,...,R N-1 , r N ) to perform XOR calculation to obtain the CRC code of the entire data to be calculated. The initial value of the CRC code of queue 1 is set to the agreed initial value of the entire d...

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 data to be calculated for the CRC code are divided to multiple data blocks with each length being as Ls digits. Each data block is input into (1,...N-1) channels. The CRC calculation is carried out for the data in each channel of the N channels so as to obtain CRC sub-code (r1, r2,...rN). The transformed CRC sub-code (R1, R2,...Rn-1) of the CRC sub-code (r1, r2,...rN) is obtained by through the lookup table of the division residue transformation. Finally, the exclusive or calculation is carried out for the CRC sub-code (R1, R2,...RN-1). Then the exclusive or calculation is carried out between the result at previous step and rN so as to obtain the CRC code of entire data to be calculated. The invention has the advantages of fast calculation speed and easy of implementation, being applicable to the CRC calculation for 10G Ethernet and 40 Gbps SDH high-speed network.

Description

technical field [0001] The invention relates to the technical field of data transmission, in particular to a method for computing cyclic redundancy check (CRC) codes by using multi-channel and multi-bit parallel computing. Background technique [0002] In various transmission systems and networks, in order to ensure the correct transmission of data between peer endpoints, certain error correction and detection codes are required. Usually, the sender needs to use CRC to calculate the check code of the data to be transmitted, and attach the check code to the transmitted data and send it together. The receiving end should use the same method to calculate the check code, and compare the obtained CRC code with the received CRC code. If they are consistent, it means that the data transmission is correct, otherwise there is an error in the data transmission. If an error occurs, the encoding principle can be used for error correction or various automatic repeat request (ARQ) techno...

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): G06F11/08
Inventor 徐展琦
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com