WO2019096124A1

WO2019096124A1 - Cyclic redundancy check (crc) calculation method and device

Info

Publication number: WO2019096124A1
Application number: PCT/CN2018/115221
Authority: WO
Inventors: 孙宇佳; 梁继业; 武雨春; 刘华斌; 冯淑兰
Original assignee: 华为技术有限公司
Priority date: 2017-11-15
Filing date: 2018-11-13
Publication date: 2019-05-23
Also published as: CN109787713B; CN109787713A

Abstract

The present application relates to the field of data communications, and provides a cyclic redundancy check (CRC) calculation method and device which are applicable to reducing time delay of CRC check calculation. The method comprises: calculating a first CRC of each of a plurality of sub-data blocks comprised in a data block, and calculating a second CRC of a first sequence associated with the each sub-data block, the first sequence associated with any sub-data block consisting of 1 and a full-zero sequence corresponding to the any sub-data block, and the lengths of all-zero sequences corresponding to different sub-data blocks being different; according to the first CRC of each sub-data block and the second CRC of the first sequence associated with the each sub-data block, determining a third CRC of the each sub-data block; and combining the third CRCs of each sub-data block to obtain a CRC of the data block.

Description

Cyclic redundancy check CRC calculation method and device

This application claims the priority of the Chinese Patent Application filed on November 15, 2017, the Chinese Patent Office, Application No. 201711132324.0, entitled "A Cyclic Redundancy Check CRC Calculation Method and Apparatus", the entire contents of which are incorporated by reference. Combined in this application.

Technical field

The present application relates to the field of data communications, and in particular, to a cyclic redundancy check CRC calculation method and apparatus.

Background technique

In the communication system, the Cyclic Redundancy Check (CRC) algorithm is generally used to encode and verify the data block. As the communication rate requirements of modern communication systems become higher and higher, the processing delay of the entire receiving end is required to be more and more small.

As shown in FIG. 1, the length of the transport block TB transmitted from the upper layer is denoted by A, and the transmitting end (for example, the transmitter) first _adds a CRC of length L _{TB_CRC} bits to the transport block (TB) (denoted as TB_CRC). ), a data block of length B=A+L _{TB_CRC} is obtained, and the CRC generator polynomial corresponding to the TB block is denoted as G _TB (D). Exemplarily, in the LTE system, the transmitting end may add TB to the TB with _{TB_CRC} = 24 bits, for example, add G _TB (D)=D ²⁴ +D ²³ +D ¹⁸ +D ¹⁷ +D ¹⁴ +D ¹¹ + D ¹⁰ +D ⁷ +D ⁶ +D ⁵ +D ⁴ +D ³ +D+1 corresponds to the CRC, and the transmitting end judges that if B>K _max (for example, 6144), as shown in FIG. 2, the length is B. The data block of =A+L _{TB_CRC} is divided into a plurality of code blocks (CBs). If the transmitting end determines B ≤ K _max , the data block of length B=A+L _{TB_CRC} corresponds to one CB.

As shown in FIG. 1, when the transmitting end adds a 24-bit CRC check for the TB, that is, the data block of length B=A+L _{TB_CRC} is divided into multiple coding blocks, the transmitting end is for each coding. The block performs CRC processing again using a generator polynomial (such as using the CRC generator polynomial corresponding to CRC-24B) to add a CB_CRC to each code block, and the CRC generator polynomial corresponding to CB is: G _CB (D)=D ²⁴ +D ²³ + D ⁶ +D ⁵ +D+1. Then, the CB input Forward Error Correction (FEC) encoder that performs CRC processing using the generator polynomial CRC-24B can directly directly _compare the data block of length B=A+L _{TB_CRC} to one CB. The TB block is used as a CB block, that is, a TB block having a length of B=A+L _{TB_CRC} is directly input to the FEC encoder.

Each CB input by the transmitting end to the FEC encoder is rate-matched by the encoded output data, and then sent to the receiving end (for example, a receiver). As shown in FIG. 3, the receiving end performs de-rate matching on the received multiple CBs, and then inputs the FEC decoder. After each CB is successfully decoded, the receiving end concatenates the FEC decoding result corresponding to each CB according to the address or identifier of each CB, and recombines the TB block whose length is B=A+L _{TB_CRC and} includes TB_CRC. The receiving end performs a CRC check on the TB block _whose length is B=A+L _{TB_CRC and} includes TB_CRC, and reports the verification result. If the check is passed, the decoding is successful, and the data block is transmitted to the upper layer, otherwise the decoding fails. .

The CRC calculation of each data block in the prior art is serially calculated. For example, as shown in FIG. 4, the first bit of one data block is input, and then each register is executed (for example, the register X1, the register X2, and the register in FIG. 4) X3, register X4) shift, calculation and value update, then input the second bit of the data block, again shift the registers, calculate and update the value, repeat until the last bit of the data block Input and completion of the shift of each register, calculation and value update, and finally the value in each register corresponds to the CRC of the block data. According to the traditional method, the processing time of the CRC check will be longer. For example, the length of a TB block is A=2*10 ⁶ , and the serial calculation CRC check will use about 2*10 ⁶ cycles (Cycle), delay. It is very big and becomes a bottleneck for increasing the communication rate.

Summary of the invention

Embodiments of the present invention provide a cyclic redundancy check CRC calculation method and apparatus for reducing the delay of CRC check calculation.

In a first aspect, an embodiment of the present invention provides a cyclic redundancy check CRC calculation method, including: calculating a first cyclic redundancy check CRC of each of a plurality of sub data blocks included in a data block, and calculating each sub a second CRC of the first sequence in which the data blocks are associated, wherein the first sequence associated with any one of the sub-blocks is composed of 1 and an all-zero sequence corresponding to any one of the sub-blocks, and the all-zero sequence corresponding to the different sub-blocks Different lengths, determining a third CRC of each sub-block according to a first CRC of each sub-block and a second CRC of a first sequence associated with each sub-block; and combining the third CRC of each sub-block to obtain The CRC of the data block.

The present application provides a CRC calculation method, by calculating a first CRC of a plurality of sub-blocks included in a data block, and determining a second CRC of a first sequence associated with each of the sub-blocks, according to a first CRC of each sub-block And a second CRC of the first sequence associated with each of the sub-blocks, determining a third CRC of each of the sub-blocks; the communication device combining the third CRC of each of the sub-blocks to obtain a CRC of the block, as the block includes The first CRC of the plurality of sub-blocks can be calculated in parallel, and the second CRC of the first sequence associated with each of the sub-blocks can also be calculated in parallel, so that the calculation delay can be reduced, compared with one sub-block of the prior art. The CRC calculation needs to be compared to the CRC of the previous sub-block, which can reduce the delay of the CRC calculation.

In conjunction with the first aspect, in a first possible implementation of the first aspect, the length of the all-zero sequence corresponding to any one of the sub-blocks is equal to the sum of the lengths of all the sub-blocks preceding any one of the sub-blocks.

With reference to the first aspect or the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the first CRC according to each sub-block and the first corresponding to each sub-block Determining a third CRC of each sub-block, comprising: determining a third CRC of each sub-block according to a formula CRC_j=(CRC _{j, msg} *CRC _{j, 0} )%G(D), wherein j denotes the identifier of the sub-block; CRC_j denotes the third CRC of the j-th sub-block; CRC _{j, msg} denotes the first CRC of the j-th sub-block, CRC _{j, 0} denotes the first sequence associated with the j-th sub-block The second CRC; G(D) represents the CRC generator polynomial of the data block, j ∈ [1, M], M is the number of sub-blocks included in the data block, and M is an integer greater than or equal to 2.

With reference to any one of the first aspect to the second possible implementation of the first aspect, in a third possible implementation of the first aspect, calculating a second of the first sequence associated with each of the sub-blocks CRC, including: according to the formula

Calculating a second CRC of the first sequence associated with each of the sub-blocks, wherein Π denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the j-th sub-block as L _j =a ₂₂ *2 ²² +a ₂₁ *2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i=0 to 22} represents the items in the first polynomial Coefficient, a _i=0~22 =0 or 1,

Is the second polynomial corresponding to the index i, G(D) represents the CRC generator polynomial of the data block, L _j represents the length of the all-zero sequence corresponding to the j-th sub-block, and CRC _{j, 0} represents the j-th sub-data The second CRC of the first sequence of block associations.

With reference to any one of the first aspect to the third possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, determining, by using the first lookup table, the second polynomial corresponding to the index i a coefficient of each item, the first query table includes at least a coefficient of each item in the second polynomial corresponding to the index i; and determining according to the coefficient of each item in the second polynomial corresponding to the index i

With reference to any one of the first aspect to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, each sub-block is equal in length, and each sub-block is associated with each other. The second CRC of the first sequence includes: acquiring a second CRC of the first sequence associated with the second sub-block of the plurality of sub-blocks; according to the formula CRC _{j, 0} = [CRC _{j-1, 0} * CRC _{2, 0} ]%G(D) sequentially calculates a second CRC of the first sequence associated with each of the sub-blocks, wherein CRC _j,0 represents a second CRC of the first sequence associated with the j-th sub-block, CRC _{2 0} represents a second CRC of the first sequence associated with the second sub-block, and CRC _{j-1, 0} represents a second CRC of the first sequence associated with the _j-1th sub-block.

With reference to any one of the first aspect to the fifth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the first The second CRC of the sequence, according to the formula

Obtaining a second CRC of the first sequence associated with the second sub-block, where Π denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the second sub-block as L ₂ =a ₂₂ * 2 ²² +a ₂₁ *2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i=0 to 22} means each of the first polynomial The coefficient of the term, a _i=0~22 =0 or 1,

Is the second polynomial corresponding to the index i, G(D) represents the CRC generator polynomial of the data block, L ₂ represents the length of the all-zero sequence corresponding to the second sub-block, and CRC _2,0 represents the second sub-block association The second CRC of the first sequence.

With reference to any one of the first aspect to the sixth possible implementation of the first aspect, in a seventh possible implementation of the first aspect, the calculation of each of the plurality of sub-blocks included in the data block The first CRC, including: according to the formula

Computing a first CRC of each of the plurality of sub-blocks, wherein CRC _{j, msg} represents a first CRC of the j-th sub-block, and N _j represents a length of the j+1th sub-block,

Is the data in the first sub-block,

For the data in the second sub-block,...,

Is the data in the jth sub-block.

With reference to any one of the first aspect to the seventh possible implementation manner of the first aspect, in an eighth possible implementation manner of the first aspect, the method provided by the application further includes: determining a CRC of the data block To preset a constant sequence, it is determined that the data block check passes.

With reference to any one of the first aspect to the eighth possible implementation manner of the first aspect, in a ninth possible implementation manner of the first aspect, the third CRC of each sub-block is merged to obtain a data block The CRC includes: modulo-adding the third CRC of each sub-block to obtain a CRC of the data block.

With reference to any one of the first aspect to the ninth possible implementation manner of the first aspect, in a tenth possible implementation manner of the first aspect, the method provided by the application further includes: adding a L_CRC after the data block is to be calculated 0, to obtain the data block, wherein L_CRC represents the CRC length corresponding to the CRC generator polynomial G(D).

In a second aspect, the present application further provides a CRC computing device, which can be used in a communication device, which can implement a CRC calculation method described in any one of the first aspect to the first aspect . For example, the communication device can be a transmitter or a chip disposed in a transmitter, which can also be a receiver or a chip disposed in the receiver. The above method can be implemented by software, hardware, or by executing corresponding software through hardware.

In a possible design, the CRC computing device includes: a calculating unit, configured to calculate a first cyclic redundancy check CRC of each of the plurality of sub-blocks included in the data block, and calculate each of the sub-blocks a second CRC of the first sequence in which the data blocks are associated, wherein the first sequence associated with any one of the sub-blocks is composed of 1 and an all-zero sequence corresponding to any one of the sub-blocks, and the all-zero sequence corresponding to the different sub-blocks a determining unit, configured to determine, by the communications device, a third CRC of each of the sub-blocks according to a first CRC of each sub-block and a second CRC of a first sequence associated with each of the sub-blocks; It is also used to combine the third CRC of each sub-block to obtain the CRC of the block.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the length of the all-zero sequence corresponding to any one of the sub-blocks is equal to the sum of the lengths of all the sub-blocks before the sub-block.

With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the determining unit is specifically configured to use the CRC_j=(CRC _{j, msg} *CRC _j, according to the formula _{, 0} ) %G(D) determines a third CRC of each of the sub-blocks, where j represents an identification of the sub-block; CRC_j represents a third CRC of the j-th sub-block; CRC _{j, msg} represents the j-th sub-data The first CRC of the block, CRC _{j, 0} represents the second CRC of the first sequence associated with the jth subblock; G(D) represents the CRC generator polynomial of the data block, j ∈ [1, M], M is The number of sub-blocks included in the data block, M is an integer greater than or equal to 2.

With reference to any one of the second aspect to the second possible implementation of the second aspect, in a third possible implementation of the second aspect, the calculating unit is specifically configured according to the formula

Calculating a second CRC of the first sequence associated with each of the sub-blocks, wherein Π represents a multiplication, and i represents the length of the all-zero sequence corresponding to the j-th sub-block as L _j =a ₂₂ *2 ²² +a ₂₁ *2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i = 0 to 22} represents the coefficient of each item in the first polynomial, a _i=0～22 =0 or 1,

Is the second polynomial corresponding to the index i, G(D) represents the CRC generator polynomial of the data block, L _j represents the length of the all-zero sequence corresponding to the j-th sub-block, and CRC _{j, 0} represents the j-th sub-block association The second CRC of the first sequence.

With reference to any one of the second aspect to the third possible implementation of the second aspect, in a fourth possible implementation manner of the second aspect, the determining unit is configured to determine the index i by using the first query table. a coefficient of each item in the corresponding second polynomial, the first query table includes at least a coefficient of each item in the second polynomial corresponding to the index i; and a second polynomial corresponding to the index i corresponding to each Coefficient of the item, determined

With reference to any one of the second aspect to the fourth possible implementation of the second aspect, in a fifth possible implementation manner of the second aspect, the length of each sub-block is equal, and the calculating unit is specifically used for Acquiring a second CRC of the first sequence associated with the second sub-block of the plurality of sub-blocks; and for sequentially according to the formula CRC _j,0 =[CRC _j-1,0 *CRC _2,0 ]%G(D) Computing a second CRC of the first sequence associated with each of the sub-blocks, wherein CRC _j,0 represents a second CRC of the first sequence associated with the j-th sub-block, and CRC _2,0 represents a second sub-block associated with The second CRC of the first sequence, CRC _{j-1, 0} represents the second CRC of the first sequence associated with the j-1th sub-block.

With reference to any one of the second aspect to the fifth possible implementation manner of the second aspect, in a sixth possible implementation manner of the second aspect, the calculating unit is specifically used according to the formula

Obtaining a second CRC of the first sequence associated with the second sub-block, where Π denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the second sub-block as L ₂ =a ₂₂ *2 ²² +a ₂₁ *2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i = 0 to 22} represents the coefficient of each item in the first polynomial, a _i=0～22 =0 or 1,

With reference to any one of the second aspect to the sixth possible implementation manner of the second aspect, in a seventh possible implementation manner of the second aspect, the calculating unit is specifically used to calculate the unit according to the formula, and is further used for According to the formula

Is the data in the first sub-block,

For the data in the second sub-block,...,

Is the data in the jth sub-block.

With reference to any one of the second aspect to the seventh possible implementation of the second aspect, in an eighth possible implementation manner of the second aspect, the CRC computing device is a receiver, and the CRC computing device further includes: And the determining unit is configured to determine that the CRC of the data block is a preset constant sequence, and then determine that the data block check passes.

With reference to any one of the second aspect to the eighth possible implementation manner of the second aspect, in a ninth possible implementation manner of the second aspect, the computing unit further specifically the third CRC of each sub data block Perform modulo two addition to obtain the CRC of the data block.

With reference to any one of the second aspect to the ninth possible implementation manner of the second aspect, in a tenth possible implementation manner of the second aspect, the CRC computing device is a transmitter, a determining unit, and is still used to be calculated The data block is followed by L_CRC 0s to obtain the data block, where L_CRC represents the CRC length corresponding to the CRC generator polynomial G(D).

In a third aspect, the present application provides a CRC computing device that can include a processor and a memory. The processor is configured to support a function of the CRC computing device to perform a message or data processing on the CRC computing device side in the method described in any one of the first to the first aspects above. The memory is for coupling with a processor that holds the programs (instructions) and data necessary for the CRC computing device. Additionally, the CRC computing device can further include a communication interface configured to support the CRC computing device in communicating with other network elements to perform the method described in any one of the above first aspect to the first aspect for use in the CRC The computing device side performs the function of message or data transmission and reception. The communication interface can be a transceiver.

In a fourth aspect, the present application provides a chip system for use in a CRC computing device, the chip system including at least one processor, a memory and an interface circuit, the memory, the interface circuit, and the at least one processor being interconnected by a line, in at least one memory The instructions are stored by the processor to perform the method described in any one of the possible aspects of the first aspect to the first aspect.

In a fifth aspect, the present application provides a computer readable storage medium, which is applied to a CRC computing device, where instructions are stored in a computer readable storage medium, and when the instructions are run on a computer, cause the computer to perform the first aspect to the first aspect The method described in any of the possible implementations.

In a sixth aspect, the present application provides a terminal device having the CRC computing device described in the above embodiments.

In a seventh aspect, the present application provides a network device having the CRC computing device described in the above embodiments.

In an eighth aspect, the present application provides a relay device having the CRC computing device described in the above embodiments.

DRAWINGS

1 is a schematic flowchart of a process of transmitting end provided by the prior art;

2 is a schematic diagram 1 of a scenario in which a TB block is added with a TB_CRC and CB is partitioned in the prior art;

3 is a schematic structural diagram of a receiving end processing provided in the prior art;

4 is a schematic structural diagram of a calculated CRC provided in the prior art;

FIG. 5 is a schematic flowchart 1 of a CRC calculation method according to an embodiment of the present disclosure;

FIG. 6 is a schematic structural diagram of a data block divided into multiple sub-blocks according to an embodiment of the present disclosure;

FIG. 7 is a schematic structural diagram 1 of a CRC computing device according to an embodiment of the present disclosure;

FIG. 8 is a schematic structural diagram 2 of a CRC computing device according to an embodiment of the present disclosure;

FIG. 9 is a schematic structural diagram 3 of a CRC computing device according to an embodiment of the present invention.

Detailed ways

The method provided by the present application can be applied to systems that require CRC encoding or checking, especially systems that require CRC encoding or checking of larger blocks of data (eg, blocks of data greater than 6144 in length).

The transmitting end or the receiving end in the embodiment of the present invention may be a device applied to a unit of CRC encoding and checking, for example, a network device (for example, a base station), and a terminal device (for example, user equipment (UE)), Or a relay device.

The CRC calculation method in the present application may be performed by a CRC calculation device, which may be a transmitter, a receiver or a processor, which is located in a transmitter or a receiver, as shown in FIG. 5 is a schematic flow chart of a CRC calculation method provided by the present application, including:

S101. The CRC computing device calculates a first cyclic redundancy check CRC of each of the plurality of sub-blocks included in the data block, and calculates a second CRC of the first sequence associated with each of the sub-blocks, where any one The first sequence associated with the sub-block is composed of 1 and an all-zero sequence corresponding to any one of the sub-blocks, and the lengths of the all-zero sequences corresponding to the different sub-blocks are different.

Optionally, the length of the all-zero sequence corresponding to any one of the sub-blocks is equal to the sum of the lengths of all the sub-blocks before any one of the sub-blocks.

Specifically, all sub-blocks before any one of the sub-blocks may be determined according to the direction from the start address to the end address.

Exemplarily, the first sequence can be expressed as

Where L _j represents the length of the all-zero sequence corresponding to the j-th sub-block, _P ∈ [0, j - 2], and N _P represents the length of the P+1-th sub-block before the j-th sub-block.

For example, the first sequence can be "1000000000".

It should be noted that, for any data block, if there is one sub-block A in any one of the sub-blocks, all the sub-blocks before the sub-block A (for example, the first sub-block) If the length is 0, it can be determined that the first sequence associated with the sub-block A is 1, that is, the length of the all-zero sequence corresponding to the first sub-block within one block is usually 0, then the first The first sequence of sub-block associations is 1.

Exemplarily, the data block in this application may include M sub-blocks, where M is an integer greater than or equal to 2. The sum of the lengths of the M sub-blocks is equal to the length of the block.

The lengths of the M sub-blocks may be equal or not equal, which is not limited in this application.

Exemplarily, the data block in this application may be a transport block (TB), or may be a TB including a CRC, and may be a TB+TB_CRC or a code block (CB), or may be The CB including the CRC is denoted as CB+CB_CRC.

As shown in FIG. 6, the present application uses a data block as TB+TB_CRC, and TB+TB_CRC includes four sub-blocks as an example:

As shown in FIG. 6, the TB+TB_CRC includes sub-blocks: sub-block 1, sub-block 2, sub-block 3, and sub-block 4. As can be seen from FIG. 6, sub-block 4 and all-zero sequence Corresponding to 4, the sub-block 3 corresponds to the all-zero sequence 3, and the sub-block 2 corresponds to the all-zero sequence 2. It should be noted that since the sub-block 1 is the first sub-block of the plurality of sub-blocks, The length of the all-zero sequence corresponding to the sub-block 1 is 0, which is not shown in FIG.

Exemplarily, the length of the all-zero sequence 4 corresponding to the sub-block 4 is the sum of the length of the sub-block 3, the length of the sub-block 2, and the length of the sub-block 1, and the all-zero sequence 3 of the sub-block 3 The length is the sum of the lengths of the sub-block 2 and the sub-block 1, and the length of the all-zero sequence 2 corresponding to the sub-block 2 is the length of the sub-block 1.

Optionally, before the step S101, the application further includes: dividing the data block into multiple sub-blocks.

Different communication systems have different requirements on the length of sub-blocks. For example, in a 5G communication system, all sub-blocks may be required to be equal in length, and at least two sub-blocks of different lengths are allowed in a 4G communication system. The data blocks are divided based on the requirements of the communication system for the length of the sub-blocks, so that the length of the sub-blocks obtained after the partitioning satisfies the requirements of the communication system.

It should be noted that, in this application, the first CRC of one sub-block and the second CRC of the first sequence corresponding to the one sub-block are calculated, and the first CRC and other sub-blocks corresponding to other sub-blocks are calculated. The second CRC of the first sequence can be a parallel process.

Optionally, the data block of the transmitting end in the present application is obtained by the CRC computing device by adding L_CRC 0 after inputting the information data block, where L_CRC represents the CRC length corresponding to the CRC generating polynomial G(D).

S102. The CRC computing device determines a third CRC of each sub-block according to a first CRC of each sub-block and a second CRC of the first sequence associated with each sub-block.

Specifically, step S102 in this application may be specifically implemented by:

S1021: The CRC computing device determines a third CRC of each of the sub-blocks according to a formula CRC_j=(CRC _{j, msg} *CRC _{j, 0} )%G(D), where j represents an identifier of the sub-block; CRC_j represents a a third CRC of j sub-blocks; CRC _{j, msg} represents a first CRC of the j-th sub-block, CRC _{j, 0} represents a second CRC of the first sequence associated with the j-th sub-block; G(D) represents The CRC of the data block is generated by a polynomial, j ∈ [1, M], where M is the number of sub-blocks included in the data block, and M is an integer greater than or equal to 2. Where msg is the abbreviation of Message, which represents the sub-block information itself, and the corresponding CRC is referred to herein as the first CRC of the sub-block itself.

Optionally, when the data block is TB, G(D) may be a CRC generating polynomial corresponding to TB, which may be represented as G _TB (D), and when the data block is CB, G(D) may be a CRC generating polynomial corresponding to CB. , can be expressed as G _CB (D).

Unless otherwise specified, in the present application, a CRC representation corresponding to a data block is calculated: after the data block is represented as a corresponding polynomial, multiplied by

(where D represents the variable symbol used in CRC calculations, multiplying the data block by

Indicates that L _CRC 0s are added after the data block. The L _{CRC is} the length of the CRC corresponding to the data block, and then the polynomial residual is generated for the CRC of the data block, and the obtained sequence corresponding to the remainder is the CRC of the CRC generating polynomial corresponding to the data block. For example: the data block is: x _A-1 , x _A-2 ,..., x ₁ , x ₀ , and the CRC generator polynomial is:

G(D)=D ²⁴ +D ²³ +D ¹⁸ +D ¹⁷ +D ¹⁴ +D ¹¹ +D ¹⁰ +D ⁷ +D ⁶ +D ⁵ +D ⁴ +D ³ +D+1, then generate a polynomial for CRC G(D), the CRC corresponding to the data block x _A-1 , x _A-2 ,..., x ₁ , x ₀ is:

[(x _A-1 *D ^A-1 +x _A-2 *D ^A-2 +...+x ₁ *D ¹ +x ₀ *D ⁰ )*D ²⁴ ]%G(D) gives a residual Corresponding target sequence, such as the above formula is D ²¹ + D ⁶ + D ³ +1, then the CRC corresponding to the data block x _A-1 , x _A-2 , ..., x ₁ , x ₀ is: 0010 0000 0000 0000 0100 1001.

In this application, a bit sequence and the corresponding polynomial of the bit sequence are equivalent, such as the above:

G(D)=D ²⁴ +D ²³ +D ¹⁸ +D ¹⁷ +D ¹⁴ +D ¹¹ +D ¹⁰ +D ⁷ +D ⁶ +D ⁵ +D ⁴ +D ³ +D+1 can be expressed using the following bit sequence 1 1000 0110 0100 1100 1111 1011.

Therefore, in the present application, the CRC calculation device may calculate the second CRC of the first sequence associated with each of the sub-blocks in a plurality of manners. Alternatively, as a possible implementation manner, step S101 in the present application may be adopted. The following ways to achieve:

CRC computing device according to the formula

Specifically, the CRC computing device in the present application determines

There are various ways, for example, the CRC calculation device determines the coefficients of the items in the second polynomial corresponding to the index i through the first lookup table, and the first lookup table includes at least the second polynomial corresponding to the index i. a coefficient of the item; the CRC calculating means determines the coefficient of each item in the second polynomial corresponding to the index i

Exemplarily, the length of the j=1th sub-block is 10000 bits, and the first polynomial corresponding to the length of the all-zero sequence corresponding to the j=2 sub-blocks is:

10000bit=8192bit+1024bit+512bit+256bit+16bit=2 ¹³ +2 ¹⁰ +2 ⁹ +2 ⁸ +2 ⁴ , so that it can be determined that the length of the corresponding all-zero sequence of the j=2 sub-blocks corresponds to the second The index i of each item of the formula can be 13, 10, 9, 8, and 4.

It should be noted that, in the calculation of the second CRC of the first sequence corresponding to each sub-block, the lengths of the plurality of sub-blocks may or may not be equal.

Optionally, when the length of each sub-block is equal, step S101 in the present application may also be implemented in the following manner as another possible implementation manner:

S1011. The CRC computing device acquires a second CRC of the first sequence associated with the second sub-block of the plurality of sub-blocks.

Exemplarily, the second sub-block may be sub-block 2 as shown in FIG. 6.

Optionally, step S1011 can be implemented in the following manner:

In one aspect, let L ₂ = a ₂₂ * 2 ²² + a ₂₁ * 2 ²¹ + ... + a ₁ * 2 ¹ + a ₀ * 2 ⁰ , the CRC calculation device according to the formula

On the other hand, the CRC calculation device obtains each table from the preset table 1.

Then pass the formula

Calculating a second CRC of the first sequence associated with the second sub-block, where Π denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the second sub-block as L ₂ =a ₂₂ *2 ²² +a ₂₁ *2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i=0 to 22} represents the item in the first polynomial Coefficient, a _i=0~22 =0 or 1,

Is a second polynomial corresponding to the index i, G(D) represents a CRC generator polynomial of the data block, L ₂ represents a length of an all-zero sequence corresponding to the second sub-block, and CRC _2,0 represents the The second CRC of the first sequence associated with the second sub-block.

S1012: The CRC computing device sequentially calculates a second CRC of the first sequence corresponding to each of the sub-blocks according to a formula CRC _j,0 =[CRC _j-1,0 *CRC _2,0 ]%G(D), wherein the CRC _{j, 0} represents the second CRC of the first sequence associated with the jth subblock, CRC ₂ , ₀ represents the second CRC of the first sequence associated with the second subblock, CRC _{j-1, 0} represents the j-1 The second CRC of the first sequence associated with the sub-blocks.

S103. The CRC computing device combines the third CRC of each sub-block to obtain a CRC of the data block.

Specifically, step S103 can be implemented in the following manner:

The CRC calculating means modulates the third CRC of each subblock to obtain a CRC of the block.

Optionally, when the CRC computing device in the application is a receiver, the method provided by the application further includes:

S104. The CRC computing device determines, according to the CRC of the data block, whether the data block is verified to pass.

Specifically, step S104 in the present application can be implemented in the following manner:

The CRC calculating means determines that the CRC of the data block is a preset constant sequence, and determines that the data block check passes, and the CRC calculating means determines that the CRC of the data block is not a preset constant sequence, and determines that the data block is not verified.

Illustratively, the predetermined constant sequence can be an all zero sequence.

In general, there are two ways to perform CRC check: one is to perform the remainder operation on the polynomial G _TB (D) after concatenating the entire TB data block obtained by decoding and TB_CRC, if the result of the remainder is a predetermined constant A sequence (eg, an all-zero sequence) indicates a TB CRC check, otherwise it indicates a TB CRC check. The other is to use the polynomial corresponding to the TB data block obtained by decoding to complement the L _CRC 0, and then perform the remainder operation on G _TB (D), if the residual result and the decoded TB_CRC correspond to the polynomial modulo 2 After that, if it is equal to a predetermined constant sequence, it means that it is detected by TB CRC, otherwise it means that it does not pass the TB CRC check.

Optionally, the CRC calculation device calculates the first CRC of each of the plurality of sub-blocks included in the data block, and may be implemented by:

Is the data in the first sub-block,

For the data in the second sub-block,...,

Is the data in the jth sub-block.

A method for calculating a cyclic redundancy check CRC provided by the present application will be described below with reference to specific embodiments:

Embodiment 1 The method provided by the present application is exemplified by a TB (referred to as TB+TB_CRC) carrying TB_CRC, including 4 sub-blocks. For example, as shown in FIG. 6, the third CRC of each sub-block can be calculated by the following formula. :

CRC_1=(CRC _{1, msg} *1)%G _TB (D)=CRC _{1, msg} %G _TB (D), where CRC_1 represents the third CRC of sub-block 1, CRC _{1, msg} represents sub-block 1 The first CRC.

CRC_2=(CRC _{2, msg} *CRC _2,0 )%G _TB (D), where CRC_2 represents the third CRC of sub-block 2, CRC _{2, msg} represents the first CRC of sub-block 2, CRC _{2, 0} denotes a second CRC of the first sequence corresponding to the sub-block 2, and G _TB (D) denotes a CRC generator polynomial used by the TB.

CRC_3=(CRC _{3, msg} *CRC _3,0 )%G _TB (D), where CRC_3 represents the third CRC of the sub-block 3 or the third sub-block, CRC _{3, and msg} represents the sub-block 3 A CRC, CRC _3,0 represents the second CRC of the first sequence corresponding to sub-block 3, and G _TB (D) represents the CRC generator polynomial used by the TB.

CRC_4=(CRC _{4, msg} *CRC _4,0 )%G _TB (D), where CRC_4 represents the third CRC of sub-block 4, CRC _{4, msg} represents the sub-block 4 or the fourth sub-block A CRC, CRC ₄ , ₀ represents the second CRC of the first sequence corresponding to sub-block 4, and G _TB (D) represents the CRC generator polynomial used by the TB.

The first CRC of each sub-block represents a CRC calculated by each sub-block, and CRC _{j, 0} represents a second CRC of the first sequence corresponding to the j-th sub-block included in the data block, where

A second CRC for calculating a first sequence corresponding to the j-th sub-block, L _j representing a length of an all-zero sequence corresponding to the j-th sub-block.

For the CRC _j,0 of each sub-block, the following method can be used to reduce the amount of calculation: set the length of the all-zero sequence corresponding to each sub-block

a _i=0~22 =0or1, then

among them,

Where G(D) represents a CRC generator polynomial of a data block, where Π denotes a multiplication, and i denotes that the length of the all-zero sequence corresponding to the j-th sub-block is expressed as L _j =a ₂₂ *2 ²² +a ₂₁ * 2 ²¹ +...+a ₁ *2 ¹ +a ₀ *2 ⁰ The exponent of each item in the first polynomial, a _{i=0 to 22} represents the coefficient of each item in the first polynomial, a _{i =0~22} =0 or 1,

In one aspect, optionally, i represents an index of a term in the second polynomial corresponding to a length of the all-zero sequence corresponding to the j-th sub-block, represented by a plurality of powers of two,

Used to represent the second polynomial corresponding to the index i.

Which corresponds to

G _TB (D)=D ²⁴ +D ²³ +D ¹⁸ +D ¹⁷ +D ¹⁴ +D ¹¹ +D ¹⁰ +D ⁷ +D ⁶ +D ⁵ +D ⁴ +D ³ +D+1, each

It can be found in Table 1 by index i.

For example, i=5, look up Table 1 to get the sequence corresponding to each coefficient: 0110 0110 1000 1111 0100 1000, then

Through the above process, the amount of calculation can be greatly reduced.

Table 1 The first query table

Storage table

Exemplarily, the following will be divided into 4 CB blocks with TBS=20000-24=19976 bits, and the CBS=5000 bits of each CB is taken as an example. It is assumed that the length of the CB_CRC corresponding to the CB block is 0, and the CRC is generated by the TB corresponding to the TB. For G _TB (D) as an example:

In Embodiment 1, still as shown in FIG. 6, CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} , CRC _{4, msg} can be calculated in parallel, and CRC _4, ₀ = D ¹⁵⁰⁰⁰ %G can also be calculated in parallel. _TB (D), CRC ₃ , ₀ = D ¹⁰⁰⁰⁰ % G _TB (D), CRC ₂ , ₀ = D ⁵⁰⁰⁰ % G _TB (D).

The length of the all-zero sequence corresponding to the sub-block 4 = the length of the sub-block 3 + the length of the sub-block 2 + the length of the sub-block 1

=5000+5000+5000=15000=8192+4096+2048+512+128+16+8=2 ¹³ +2 ¹² +2 ¹¹ +2 ⁹ +2 ⁷ +2 ⁴ +2 ³ , so

The CRC _4,0 represents the second CRC of the first sequence corresponding to the sub-block 4.

Wherein, the length of the all-zero sequence corresponding to the sub-block 3 = the length of the sub-block 2 + the length of the sub-block 1 = 5000 + 5000 = 10000 = 819 + 1024 + 512 + 256 + 16 = 2 ¹³ + 2 ¹⁰ + 2 ⁹ +2 ⁸ +2 ⁴ , so

The CRC _3,0 represents the second CRC of the first sequence corresponding to the sub-block 3.

The length of the all-zero sequence corresponding to the sub-block 2 = the length of the sub-block 1 = 5000 = 4096 + 512 + 256 + 128 + 8, so

The CRC _2,0 represents the second CRC of the first sequence corresponding to the sub-block 2 or the second sub-block.

In this application, the first CRC corresponding to each sub-block may be calculated in parallel, or the second CRC of the first sequence corresponding to each sub-block may be calculated in parallel, because CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} , CRC _{4, msg} can be calculated in parallel, so calculate CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} , CRC _{4, msg} can be completed with 5000 Cycles. The CRC _4,0 , CRC _3,0 , CRC _2,0 can also be calculated in parallel, so the one that takes the most is the

It requires 6 basic operations. A basic operation here consists of a 24-length *24-length polynomial multiplication operation and a 24-long sequence pair G _TB (D) remainder operation, which requires about 6*(25+25)=300. Cycle. In this case, a total of 5000+300=5300 Cycles can be used in Embodiment 1 of the present application.

In the prior art, the CRC is serially calculated, and 20,000 CRC is required to complete the TB CRC detection. Therefore, the CRC required by the solution provided by the present application is 27% of the 20,000 Cycles required in the prior art, and therefore, the delay of the TB CRC check can be greatly reduced.

It should be noted that, in the actual process, in order to further reduce the delay of the CRC check, when calculating the CRC of any sub-block, for example, calculating the first CRC of the second sub-block, the second sub-calculation may be calculated first. The CRC of the plurality of small blocks A included in the data block, that is, replacing the data block in FIG. 6 with the second sub data block, dividing the second sub data block into a plurality of small blocks, and then calculating the CRC ₂ by the method in Embodiment 1. _{, msg} .

In the embodiment 2, there may be a scenario in which the lengths of the sub-blocks are the same in the communication system. For example, in the 5G communication system, for example, the length of each sub-block is 5000, for example, the following will be implemented in combination. Example 2 details how to calculate the second CRC corresponding to each sub-block when the length of each sub-block is the same:

Yet another example, the difference between Example 2 and Example Embodiment 1 embodiment in that: in Example 2 of the present application embodiment in addition to calculating _{_{CRC 1, Msg, CRC 2,}} Msg, CRC 3, Msg, outer CRC _{4, Msg,} need to calculate the CRC _{2 _{_{, 0, CRC 3,0, CRC 4,0}}} , and Example 1 CRC _2,0, CRC _3,0, CRC _4,0 parallel computing, in the first embodiment in Example 2 is calculated subblock 2 After the second CRC, the second CRC of the remaining sub-blocks is calculated according to the formula CRC _j,0 =(CRC _j-1,0 *CRC _2,0 )%G _TB (D), for example, according to the formula

Calculate CRC _2,0 , where N ₀ here represents the length of the sub-block, and then calculate CRC ₃ according to the formula CRC _3,0 =(CRC _2,0 *CRC _2,0 )%G _TB (D) _{, 0} and calculate CRC _4,0 according to the formula CRC _4,0 = (CRC _3,0 *CRC _2,0 )%G _TB (D).

It should be noted that Embodiment 2 can also be stored in the calculation process.

So for any one

Let j-1=m ₁₀ *2 ¹⁰ +m ₉ *2 ⁹ +...+m ₁ *2 ¹ +m ₀ *2 ⁰ ,m _i =0or1,

Exemplarily, the TBS=20000-24=19976bits is divided into four CB blocks, and the CBS=5000 bits of each CB is taken as an example. Assuming that the CB_CRC length is 0, the first calculation is performed.

(For details on how to determine the value of i, refer to the above embodiment, which is not described herein again), and then calculate CRC _3,0 = [CRC _2,0 *CRC _2,0 ]%G _TB (D according to CRC _2,0 ) ), then calculate CRC _4,0 = [CRC _3,0 *CRC _2,0 ]%G _TB (D).

According to the prior art, 20,000 Cycles are required to complete the TB CRC detection. According to the second embodiment, since CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} and CRC _{4, msg} can be calculated in parallel, CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} and CRC _{4 are} calculated _{. Msg} can be completed with 5000 Cycles; and CRC _2,0 , CRC _3,0 , CRC _4,0 requires a total of 4+1+1=6 basic operations. A basic operation in this application contains a length of 24* A 24-long polynomial multiplication operation and a 24-bit sequence of G _TB (D) remainder operations require approximately 6*(25+25)=300 Cycles. Therefore, the total of Example 2 requires 5000+300=5300 Cycles. The required Cycle is 27% of the 20,000 Cycles required by the prior art, thereby reducing the latency of the block check.

It should be noted that, in Embodiment 2, although the delays of calculating CRC _2,0 , CRC _3,0 , and CRC _4,0 are the same as in Embodiment 1, Embodiment 2 calculates CRC _2,0 , CRC _3,0. The total calculation amount required for CRC ₄ , ₀ is 6 basic operations, and the total calculation amount of CRC ₂ , ₀ , CRC ₃ , ₀ , CRC ₄ , _{0 of} Embodiment 1 is (6 + 4 + 4) = 14 Sub-basic operation. Therefore, the amount of calculation required in the second embodiment is smaller than the amount of calculation in the first embodiment.

Similarly, if it is desired to further reduce the delay of the CRC check, for the check calculation of any sub-block, such as calculating the first CRC of the second sub-block, it is also possible to first calculate the plurality of sub-blocks included in the second sub-block. The CRC of the small block A, that is, the second sub data block is used instead of the data block in FIG. 6, the second sub data block is divided into a plurality of small blocks, and then the CRC _{2, msg} is calculated by the method in the first embodiment.

Embodiment 3, a data block can be divided into a plurality of data blocks in a communication system, but the length of the plurality of sub-blocks may have two values, that is, a part of the sub-blocks have a length of L1, and another part of the sub-blocks The length is L2, for example, in a 4G communication system: the length of a sub-block (for example, CB) is 6016 bits and 6080 bits.

For another example, the present application uses TBS=6080*2+6016*2-24=24168 bits in the LTE system, and the TB carrying the CRC includes 4 CB blocks as an example. The length of CB ₄ and CB ₃ is 6080 bits, CB ₂ , The length of CB ₁ is 6016 bits, assuming that the length of CB_CRC is 0. At this time, according to Embodiment 1 described in the above embodiment, and D ⁶⁰¹⁶ %G _TB (D), D ^6016+6080 %G can be calculated by query table 1 Each of the _TB (D) and D ^6016+6080*2 %G _TB (D) corresponds to a polynomial.

On the other hand, according to the above embodiment 2, D ⁶⁰¹⁶ %G _TB (D) and D ⁶⁰⁸⁰ %G _TB (D) can be calculated first, and then D ^6016+6080 %G _TB (D)={[D ⁶⁰¹⁶ % G _TB (D)]*[D ⁶⁰⁸⁰ %G _TB (D)]}%G _TB (D), D ^6016+6080*2 %G _TB (D)={[D ^6016+6080 %G _TB (D) ]*[D ⁶⁰⁸⁰ %G _TB (D)]}%G _TB (D).

According to the prior art, 24192 Cycles are required to complete the TB CRC detection.

According to the embodiment 1 provided by the present application, since CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} and CRC _{4, msg} can be calculated in parallel, CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} and CRC _{4, msg} can be completed with up to 6080 Cycles, while D ⁶⁰¹⁶ %G _TB (D), D ^6016+6080 %G _TB (D) and D ^6016+6080*2 %G _TB (D) can be calculated in parallel. Since 6016=2 ¹² +2 ¹⁰ +2 ⁹ +2 ⁸ +2 ⁷ ,6016+6080=2 ¹³ +2 ¹¹ +2 ¹⁰ +2 ⁹ +2 ⁸ +2 ⁶ ,6016+6080*2=2 ¹⁴ +2 ¹⁰ +2 ⁹ +2 ⁸ , so a maximum of 5 basic operations are required. A basic operation here consists of a 24-length *24-length polynomial multiplication operation and a 24-length sequence on the G _TB (D) remainder operation. Need 5*(25+25)=250 Cycles. Thus, Embodiment 1 requires a total of 6080 + 250 = 6330 Cycles to complete. It is only 26% of the 24,192 Cycles required for the traditional program. The delay of the TB CRC check calculation is greatly reduced.

According to the embodiment 2 provided by the present application, since CRC _{1, msg} , CRC _{2, msg} , CRC _{3, msg} and CRC _{4, msg} can be calculated in parallel, this part can be completed with up to 6080 Cycles; and D ⁶⁰¹⁶ %G _TB (D), D ^6016+6080 %G _TB (D) and D ^6016+6080*2 %G _TB (D) calculation requires 4+5+1+1=11 basic operations, a basic operation here A 24 long * 24 long polynomial multiplication operation and a 24 long sequence of G _TB (D) remainder operations, so about 11 * (25 + 25) = 550 Cycle. In this way, the algorithm 2 needs 6080+550=6630 Cycles in total. It is only 27% of the 24,192 Cycles required for traditional programs. The delay of the TB CRC check is greatly reduced.

It should be noted that in the above TB CRC check calculation process, each CRC _{j is} calculated _{, and msg} can be parallel to the calculation of CRC _j,0 . Since the calculation delay of each CRC _j,0 in the above example is much smaller than each CRC _j The calculation delay of _{msg is} such that the calculation delay of CRC _{j, 0} of Embodiment 1 and Embodiment 2 is negligible. However, Embodiment 2 calculates that the total calculation amount of each CRC _{j, 0} is smaller than that of Embodiment 1.

Similarly, if you want to further reduce the delay of CRC check, calculate the calibration of any small block, such as the calculation of CRC _{2, msg} , you can also use block to calculate multiple small blocks included in each sub-block. CRC, the manner of determining the CRC of each sub-block, that is, replacing the TB including the CRC in FIG. 6 with the second sub-block, dividing the second sub-block into a plurality of small blocks, and then calculating CRC ₂ in the above manner _{, Msg} . Compared with the prior art, the embodiment of the present invention can greatly reduce the delay and the calculation amount of the CRC check calculation when the lengths of the CB blocks are not all the same.

Embodiment 4: As described in Embodiment 1, Embodiment 2 and Embodiment 3 above, with the method provided by the present application, the CRC calculation of the CB block itself becomes the portion with the largest delay required for the TB CRC calculation. When the CB is large, if it is desired to further reduce the delay of the CRC calculation of the CB, for example, the CB is the sub-block 2 in the above embodiment, then the CRC _{2 is} calculated _{, and the msg} can also be described in the above embodiment, that is, Subblock 2 replaces the TB including CRC in Fig. 6, divides subblock 2 into a plurality of subblocks, and then calculates CRC _{2, msg} using the above method. details as follows:

Taking the New Radio (NR) system as an example, the maximum CB length is 8448 bits, which can be calculated and stored.

As the second lookup table, as shown in Table 2:

Table 2 Second query table

Storage table

Let the block length of the rth CB block be K _r , then put the

Divided into

Sub-blocks:

The first sub-block is

Its corresponding third CRC is

The second sub-block is

Its corresponding third CRC is

The gth sub-block is

Its corresponding third CRC is

First

Block subblock is

Its corresponding CRC is

The last sub-block, ie the first

Sub-blocks, when K _r %24≠0, can be filled

0 is

Can also not make up 0

The corresponding CRC is the same, recorded as

among them,

Indicates that the math is rounded up.

Then the third CRC corresponding to the gth sub-block,

among them,

Representing the third CRC corresponding to the gth sub-block,

Representing the first CRC corresponding to the gth sub-block,

Representing the second CRC corresponding to the gth sub-block,

Let g-1=m ₈ *2 ⁸ +m ₇ *2 ⁷ +...+m ₁ *2 ¹ +m ₀ *2 ⁰ ,m _i =0or1, then

It should be noted that the above method needs to store the table 2 occupying 9*24/8=27 Bytes storage space due to

Can be calculated in parallel, so the maximum computational delay is 9 basic operations, where a basic operation consists of a 24-length *24-length polynomial multiplication operation and a 24-length sequence pair G _TB (D) remainder operation.

If you want to further reduce the calculation delay, you can store all CRC _24*i (D)=D ^24*i %G _TB (D), i=1,2,3...351 CRC values, a total of 351*24/8= 1053Bytes. At this time each

Only one basic operation is required. Here, a basic operation consists of a 24-length *24-length polynomial multiplication operation and a 24-long sequence pair G _TB (D) remainder operation.

For example, the transport block size (TBS)=20000-24=19976 bits is divided into four CB blocks, and the code block size (CBS)=5000 bits of each CB is taken as an example. Calculating 5000 C of each CB block according to the solution in the prior art. According to the method described in Embodiment 4, if 27 Bytes of CRC _24*2i (D)% G _TB (D) is stored, it takes up to 9 basic operations to complete the delay, which is about 9* (25+). 25) = 450 Cycles, only 1/11 of the original. If you store 1053Bytes of CRC _24*i (D)=D ^24*i %G _TB (D), i=1, 2,3,...,351, you need 1 basic operation corresponding delay to complete, about It takes 1*(25+25)=50 Cycles, which is only 1/100 of the original.

The foregoing provides a description of the solution provided by the present application from the perspective of interaction between the various network elements. It can be understood that each network element, such as a CRC computing device, etc., in order to implement the above functions, includes hardware structures and/or software modules corresponding to the execution of the respective functions. Those skilled in the art will readily appreciate that the present invention can be implemented in a combination of hardware or hardware and computer software in combination with the elements and algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

The present application may divide a function module into a CRC computing device or the like according to the above method example. For example, each function module may be divided according to each function, or two or more functions may be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the present application is schematic, and is only a logical function division, and may be further divided in actual implementation.

In the case of employing an integrated unit, FIG. 7 shows a possible structural diagram of the CRC computing device involved in the above embodiment. The CRC calculation device includes a calculation unit 101 and a determination unit 102.

The calculation unit 101 is configured to support the CRC calculation device to perform step S101 in the foregoing embodiment (specifically, may be S1011 and S1012); the determining unit 102 is configured to support the CRC calculation device to perform step S102 in the foregoing embodiment (specifically, It is S1021) and S103. Furthermore, the CRC computing device provided herein further includes a check unit 103 for supporting the CRC computing device to perform S104 in the above-described embodiments; and/or other processes for the techniques described herein. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional description of the corresponding functional modules, and details are not described herein again.

The determining unit 102, the computing unit 101, and the checking unit 103 in the present application may be integrated in the processor of the CRC computing device on the basis of hardware implementation.

It can be understood that when the CRC computing device in the present application is a transmitter, the CRC computing device may not include the checking unit 103. When the CRC computing device is a receiver, the CRC computing device may include a checking unit 103. .

In the case of employing an integrated unit, FIG. 8 shows a possible logical structure diagram of the CRC computing apparatus involved in the above embodiment. The CRC computing device includes a processing module 112 and a communication module 113. The processing module 112 is configured to perform control management on the CRC computing device action. For example, the processing module 112 is configured to support the CRC computing device to perform step S101 (specifically, may be S1011 and S1012) and S102 in the foregoing embodiment (specifically, it may be S1021). ), S103, S104; the communication module 113 is configured to support the CRC computing device to perform related operations of receiving and transmitting. And/or other processes for the techniques described herein. The CRC computing device can also include a storage module 111 for storing program codes and data of the CRC computing device.

The processing module 112 may be a processor or a controller, such as a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, Hardware components or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure. The processor may also be a combination of computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, and the like. The communication module 113 can be a transceiver, a transceiver circuit, a communication interface, or the like. The storage module 111 can be a memory.

When the processing module 112 in the present application is the processor 120, the communication module 113 is the communication interface 130 or the transceiver, and the storage module 111 is the memory 140, the CRC computing device involved in the present application may be the device shown in FIG.

The communication interface 130, the processor 120, and the memory 140 may be connected to each other through a bus 110; the bus 110 may be a PCI bus or an EISA bus or the like. The bus 110 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 9, but it does not mean that there is only one bus or one type of bus. The memory 140 is used to store program codes and data of the CRC computing device. The communication interface 130 is for supporting the CRC computing device to communicate with other devices. The processor 120 is configured to support the CRC computing device to execute the program code and data stored in the memory 140 to implement a CRC calculation method provided by the present application.

In one aspect, the present application provides a computer storage medium having instructions stored therein that, when executed on a receiver, cause a receiver to perform step S101 in the embodiment (specifically, may be S1011 and S1012) and The CRC calculation method described in S102 (specifically, may be S1021), S104, and S103.

In another aspect, a computer storage medium is provided, where instructions are stored in a computer readable storage medium, and when the instruction is run on a transmitter, causing the transmitter to perform step S101 in the embodiment (specifically, may be S1011 and S1012), S102 (specifically may be S1021), and the CRC calculation method described in S103.

In another aspect, a computer program product is provided, the computer program product storing instructions for causing a receiver to perform step S101 (specifically, S1011 and S1012) in an embodiment when the instruction is run on a receiver The CRC calculation method described in S102 (specifically, may be S1021), S104, and S103.

In a further aspect, a computer program product is provided, the computer program product storing instructions, when the instruction is run on the transmitter, causing the transmitter to perform step S101 in the embodiment (specifically, may be S1011 and S1012), S102 (specifically may be S1021), and the CRC calculation method described in S103.

For the explanation and beneficial effects of the related content in any of the above-mentioned devices, reference may be made to the corresponding method embodiments provided above, and details are not described herein again.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using a software program, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions in accordance with embodiments of the present application are generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be wired from a website site, computer, server or data center (eg Coaxial cable, fiber, digital subscriber line (DSL) or wireless (eg infrared, wireless, microwave, etc.) to another website, computer, server or data center. The computer readable storage medium can be any available media that can be accessed by a computer or a data storage device that includes one or more servers, data centers, etc. that can be integrated with the media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)) or the like.

Although the present application has been described herein in connection with the embodiments of the present invention, those skilled in the art can understand and implement the disclosure by the drawings, the disclosure, and the appended claims. Other variations of the embodiments. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality. A single processor or other unit may fulfill several of the functions recited in the claims. Certain measures are recited in mutually different dependent claims, but this does not mean that the measures are not combined to produce a good effect.

While the present invention has been described in connection with the specific embodiments and embodiments thereof, various modifications and combinations can be made without departing from the spirit and scope of the application. Accordingly, the description and drawings are to be regarded as It will be apparent to those skilled in the art that various modifications and changes can be made in the present application without departing from the spirit and scope of the application. Thus, it is intended that the present invention cover the modifications and variations of the present invention.

Claims

A cyclic redundancy check CRC calculation method, comprising:

Computing a first cyclic redundancy check CRC of each of the plurality of sub-blocks included in the data block, and calculating a second CRC of the first sequence associated with each of the sub-blocks, wherein the plurality of sub-data The first sequence associated with any one of the sub-blocks in the block is composed of 1 and an all-zero sequence corresponding to any one of the sub-blocks, and the lengths of the all-zero sequences corresponding to the different sub-blocks are different;

Determining a third CRC of each of the sub-blocks according to the first CRC of each of the sub-blocks and the second CRC of the first sequence associated with each of the sub-blocks;

The third CRC of each of the sub-blocks is combined to obtain a CRC of the data block.
The method according to claim 1, wherein the length of the all-zero sequence corresponding to any one of the sub-blocks is equal to the sum of the lengths of all the sub-blocks preceding the any one of the sub-blocks.
The method according to claim 1 or 2, wherein the determining the each according to the first CRC of each of the sub-blocks and the second CRC of the first sequence corresponding to each of the sub-blocks The third CRC of the sub-blocks, including:

Determining a third CRC of each of the sub-blocks according to a formula CRC_j=(CRC j, msg *CRC j,0 )%G(D), where j represents an identifier of the sub-block; CRC_j represents a j-th sub-block a third CRC; CRC j, msg represents a first CRC of the jth subblock, CRC j, 0 represents a second CRC of the first sequence associated with the jth subblock; G(D) represents a CRC of the data block A polynomial is generated, j ∈ [1, M], M is the number of sub-blocks included in the data block, and M is an integer greater than or equal to 2.
The method according to any one of claims 1-3, wherein the calculating the second CRC of the first sequence associated with each of the sub-data blocks comprises:

According to the formula
Calculating a second CRC of the first sequence associated with each of the sub-blocks, wherein ∏ denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the j-th sub-block as L j =a 22 *2 22 +a 21 *2 21 +...+a 1 *2 1 +a 0 *2 0 The exponent of each item in the first polynomial, a i=0 to 22 represents the coefficient of each item in the first polynomial, a i=0～22 =0 or 1,
Is the second polynomial corresponding to the index i, G(D) represents the CRC generator polynomial of the data block, L j represents the length of the all-zero sequence corresponding to the j-th sub-block, and CRC j, 0 represents the j-th sub-data The second CRC of the first sequence of block associations.
The method according to claim 4, wherein the coefficient of each item in the second polynomial corresponding to the index i is determined by the first lookup table, wherein the first query table includes at least the index i corresponding to The coefficient of each item in the second polynomial;

Determining the coefficient according to a coefficient of each item in the second polynomial corresponding to the index i
The method according to any one of claims 1-3, wherein the length of each of the sub-blocks is equal, and the calculating the second CRC of the first sequence associated with each of the sub-blocks comprises:

Obtaining a second CRC of the first sequence associated with the second sub-block of the plurality of sub-blocks;

Calculating a second CRC of the first sequence associated with each of the sub-blocks in turn according to the formula CRC j,0 =[CRC j-1,0 *CRC 2,0 ]%G(D), where CRC j,0 a second CRC representing a first sequence associated with the jth sub-block, CRC 2,0 representing a second CRC of the first sequence associated with the second sub-block, CRC j-1,0 representing the j-1th sub- The second CRC of the first sequence associated with the data block.
The method according to claim 6, wherein the acquiring the second CRC of the first sequence associated with the second sub-block of the plurality of sub-blocks comprises:

According to the formula
Obtaining a second CRC of the first sequence associated with the second sub-block, where ∏ denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the second sub-block as L 2 =a 22 * 2 22 +a 21 *2 21 +...+a 1 *2 1 +a 0 *2 0 The exponent of each item in the first polynomial, a i=0 to 22 means each of the first polynomial The coefficient of the term, a i=0~22 =0 or 1,
Is a second polynomial corresponding to the index i, G(D) represents a CRC generator polynomial of the data block, L 2 represents a length of an all-zero sequence corresponding to the second sub-block, and CRC 2,0 represents the The second CRC of the first sequence associated with the second sub-block.
The method according to any one of claims 1 to 7, wherein the calculating the first CRC of each of the plurality of sub-blocks included in the data block comprises:

According to the formula
Computing a first CRC of each of the plurality of sub-blocks, wherein CRC j, msg represents a first CRC of the j-th sub-block, and N j represents a length of the j+1th sub-block,
Is the data in the first sub-block,
For the data in the second sub-block,...,
Is the data in the jth sub-block.
The method according to any one of claims 1-8, wherein the combining the third CRC of each of the sub-blocks to obtain the CRC of the data block comprises:

The third CRC of each of the sub-blocks is modulo-added to obtain a CRC of the data block.
The method according to any one of claims 1-8, wherein before the calculating the first cyclic redundancy check CRC of each of the plurality of sub-blocks of the plurality of sub-blocks, the method further comprises :

L_CRC zeros are added after the data block to be calculated to obtain the data block, wherein L_CRC represents the CRC length corresponding to the CRC generation polynomial G(D).
A cyclic redundancy check CRC computing device, comprising:

a calculating unit, configured to calculate a first cyclic redundancy check CRC of each of the plurality of sub data blocks included in the data block, and calculate a second CRC of the first sequence associated with each of the sub data blocks, where The first sequence of any one of the plurality of sub-blocks is composed of 1 and an all-zero sequence corresponding to any one of the sub-blocks, and the lengths of the all-zero sequences corresponding to the different sub-blocks are different;

a determining unit, configured to determine a third CRC of each of the sub-blocks according to the first CRC of each of the sub-blocks and the second CRC of the first sequence in which each of the sub-blocks are associated;

The calculating unit is further configured to combine the third CRC of each of the sub-blocks to obtain a CRC of the data block.
The apparatus according to claim 11, wherein the length of the all-zero sequence corresponding to any one of the sub-blocks is equal to the sum of the lengths of all the sub-blocks preceding the any one of the sub-blocks.
The apparatus according to claim 11 or 12, wherein the determining unit is specifically configured to determine each of the sub-blocks according to a formula CRC_j=(CRC j, msg *CRC j, 0 )%G(D) a third CRC, where j represents the identity of the sub-block; CRC_j represents the third CRC of the j-th sub-block; CRC j, msg represents the first CRC of the j-th sub-block, CRC j, 0 represents the j-th child a second CRC of the first sequence associated with the data block; G(D) represents a CRC generator polynomial of the data block, j ∈ [1, M], where M is the number of sub-blocks included in the data block, M is An integer greater than or equal to 2.
Apparatus according to any one of claims 11-13, wherein said computing unit is specifically configured according to a formula
Calculating a second CRC of the first sequence associated with each of the sub-blocks, wherein ∏ denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the j-th sub-block as L j =a 22 *2 22 +a 21 *2 21 +...+a 1 *2 1 +a 0 *2 0 The exponent of each item in the first polynomial, a i=0 to 22 represents the items in the first polynomial Coefficient, a i=0~22 =0 or 1,
Is the second polynomial corresponding to the index i, G(D) represents the CRC generator polynomial of the data block, L j represents the length of the all-zero sequence corresponding to the j-th sub-block, and CRC j, 0 represents the j-th sub-data The second CRC of the first sequence of block associations.
The apparatus according to claim 14, wherein the determining unit is configured to determine, by using a first lookup table, coefficients of items in the second polynomial corresponding to the index i, the first lookup table Determining at least a coefficient of each item in the second polynomial corresponding to the index i; and determining the coefficient according to a coefficient of each item in the second polynomial corresponding to the index i
The device according to any one of claims 11 to 13, wherein each of the plurality of sub-blocks is equal in length, and the calculating unit is configured to acquire a second sub-block association of the plurality of sub-blocks. a second CRC of the first sequence; and for sequentially calculating a first correlation of each of the sub-blocks according to a formula CRC j,0 =[CRC j-1,0 *CRC 2,0 ]%G(D) a second CRC of the sequence, wherein CRC j,0 represents a second CRC of the first sequence associated with the jth subblock, and CRC 2,0 represents a second CRC of the first sequence associated with the second subblock, CRC j-1,0 represents the second CRC of the first sequence associated with the j-1th sub-block.
The apparatus according to claim 16, wherein said calculating unit is specifically configured according to a formula
Obtaining a second CRC of the first sequence associated with the second sub-block, where ∏ denotes a multiplication, and i denotes representing a length of the all-zero sequence corresponding to the second sub-block as L 2 =a 22 * 2 22 +a 21 *2 21 +...+a 1 *2 1 +a 0 *2 0 The exponent of each item in the first polynomial, a i=0 to 22 means each of the first polynomial The coefficient of the term, a i=0~22 =0 or 1,
Is a second polynomial corresponding to the index i, G(D) represents a CRC generator polynomial of the data block, L 2 represents a length of an all-zero sequence corresponding to the second sub-block, and CRC 2,0 represents the The second CRC of the first sequence associated with the second sub-block.
Apparatus according to any one of claims 11-17, wherein said calculation unit is further operative according to a formula

Computing a first CRC of each of the plurality of sub-blocks, wherein CRC j, msg represents a first CRC of the j-th sub-block, and N j represents a length of the j+1th sub-block,
Is the data in the first sub-block,
For the data in the second sub-block,...,
Is the data in the jth sub-block.
The apparatus according to any one of claims 11 to 18, wherein the calculating unit further specifically modulates the third CRC of each of the sub-blocks to obtain a CRC of the data block.
The apparatus according to any one of claims 11 to 19, wherein the determining unit is further configured to: after the data block to be calculated, supplement L_CRC 0s to obtain the data block, wherein L_CRC represents the CRC The CRC length corresponding to the polynomial G(D) is generated.
A cyclic redundancy check CRC computing device, comprising:

a memory for storing instructions;

At least one processor in communication with the memory for executing instructions stored in the memory to perform the method of any of claims 1-10.
A computer readable storage medium, characterized by being applied to a cyclic redundancy check CRC computing device, wherein the computer readable storage medium stores instructions that, when executed on a computer, cause the computer to perform the above claims The method of any of 1-10.