Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and device for calculating CRC encoding

A coding and sequence technology, applied in the information field, can solve the problems of consuming large computing resources, affecting the efficiency and performance of CRC coding, a large number of shift operations and XOR operations, etc.

Active Publication Date: 2018-10-09
HUAWEI TECH CO LTD +1
View PDF3 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] An existing CRC encoding method is known, which requires a large number of shift operations and XOR operations when performing CRC encoding operations, which increases the complexity of calculations and consumes a large amount of computing resources, thus affecting CRC encoding. efficiency and performance

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 and device for calculating CRC encoding
  • Method and device for calculating CRC encoding
  • Method and device for calculating CRC encoding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0084] As an example and not limitation, the at least one polynomial includes a first polynomial, the first polynomial Q 1 (x) satisfy:

[0085] Q 1 (x)=(x^369+x^31+1) x^a (2)

[0086] Wherein, x^a is an adjustment coefficient, a is determined according to the capacity of a register, and a is an integer greater than or equal to 0, and the register is used to store the first sequence.

[0087] Specifically, for example, the length of the first sequence is 4096, and the multiple (for example, the first polynomial) Q of the primitive polynomial 1 (x) satisfy:

[0088] Q 1 (x)=(x^369+x^31+1) (3)

[0089] At this time, the value of a in formula (2) is 0.

[0090] When calculating the CRC encoding of the first sequence, it mainly includes the following steps:

[0091] a. When calculating the CRC code of the first sequence, 16 bits "0" are added after the first sequence, that is, the length of the first sequence after adding "0" is 4112;

[0092] b. Divide the first sequence ...

Embodiment 2

[0103] The difference between embodiment 2 and embodiment 1 is that step c to step e, in embodiment 2, step c is:

[0104] Such as Figure 9 As shown, the first data segment is shifted left by 31 bits and left by 0 bits respectively, and the data segment obtained by shifting the first data segment by 31 bits to the left and the data segment obtained by shifting the first data segment to the left by 0 bits are subjected to an exclusive OR operation, and the exclusive OR operation The obtained data segment is divided into two parts, respectively data segment C and data segment D, data segment C includes 31 high-order bits, and data segment D includes 369 bits other than the upper 31 bits.

[0105] The data segment C is shifted left by 31 bits and 0 bit to the left respectively, and the data segment obtained by shifting 31 bits to the left and the data segment obtained by shifting 0 bits to the left are subjected to an exclusive OR operation, and the data segment E obtained by th...

Embodiment 3

[0113] As an example and not limitation, the at least one polynomial includes a second polynomial, the second polynomial Q 2 (x) satisfy:

[0114] Q 2 (x)=(x 65535 +1) x b (5)

[0115] where x b To adjust the coefficient, b is determined according to the capacity of the register, and b is an integer greater than or equal to 0, and the register is used to store the first sequence.

[0116] Specifically, for example, the length of the first sequence is 4194304, and the multiple of the primitive polynomial (for example, the first polynomial) Q 1 (x) satisfy:

[0117] Q 2 (x)=(x 65535 +1) (6)

[0118] At this time, the value of b in formula (5) is 0.

[0119] When calculating the CRC encoding of the first sequence, it mainly includes the following steps:

[0120] a. When calculating the CRC code of the first sequence, add 16 bits "0" after the first sequence, that is, the length of the first sequence after adding "0" is 4194320;

[0121] b. Divide the first sequence a...

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 provides a method for calculating a CRC code. The method comprises the following steps of: acquiring a first sequence to be encoded; encoding the first sequence to be encoded using at least one polynomial to generate a second sequence; encoding the second sequence using a primitive polynomial, and generating a check sequence for the first sequence, wherein each polynomial in the at least one polynomial is a multiple of the primitive polynomial, and the number of terms of each polynomial in the at least one polynomial is less than the number of terms of the primitive polynomial. The method can reduce the complexity of calculating the CRC coding and improve the efficiency and the performance of CRC coding.

Description

technical field [0001] The present application relates to the field of information technology, and more particularly, to a method and device for calculating CRC codes. Background technique [0002] In storage systems, cyclic redundancy check (Cyclic Redundancy Check, CRC) coding is a cyclic code, and CRC coding in storage systems usually uses primitive polynomial design CRC coding schemes based on Galois field GF(2) . [0003] CRC coding principle: Assuming an L-bit information sequence (the value of the information is 0 or 1), a L-1 ,a L-2 ,...,a 0 , where the information sequence can be data to be processed, such as data to be stored or sent, and the L-bit information sequence can be expressed as a polynomial: [0004] C(x)=a L-1 x^(L-1)+a L-2 x^(L-2)+a L-3 x^(L-3)+…+a 0 [0005] Among them, a L-1 is the most significant bit (Most Significant Bit, MSB) of the information sequence, a 0 It is the least significant bit (Least Significant Bit, LSB) of the informatio...

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/10H03M13/09
CPCG06F11/1004H03M13/09
Inventor 张进毅王工艺沈建强林宪正
Owner HUAWEI TECH CO LTD