Cyclic redundancy check code generation apparatus and method

Abstract

The invention relates to the transmission data checking field, in particular to a technology for generating a low-cost CRC check code by a hardware circuit. A device for generating a cyclic redundancy check code and a method thereof have a characteristic polynomial, namely g(x) is equal to sigma plus 1; the device comprises trigger groups which are respectively corresponding to x<n1>-x<nk> and formed by a plurality of serially connected triggers; the trigger groups are serially connected in the sequence of the serial numbers of the trigger groups; an exclusive-or gate is connected between two neighboring trigger groups in series; an output terminal of an inverter is connected with an input terminal of a DG1 trigger group; an input terminal of an exclusive nor gate is the input terminal of the device, and the other input terminal of the exclusive nor gate is connected with the output terminal of a DGk trigger group; the output terminal of the exclusive nor gate is connected with the input terminal of the inverter and the input terminals of each exclusive-or gate. In a circuit of the prior art, the inverter connected with each trigger is removed and the inverter is connected to invert before the data is input to the triggers connected in series, thus the method saves a great number of inverters, simplifies a CRC check code generation circuit, and lower the hardware cost.

Description

technical field [0001] The invention relates to the field of transmission data verification, in particular to a low-cost CRC verification code generation technology realized by using a hardware circuit. Background technique [0002] CRC (Cyclic Redundancy Code, Cyclic Redundancy Check Code) is the most commonly used error check code in data communication. It can detect single and double bit errors, odd errors, and errors whose length is less than the CRC series in the transmitted data. consecutive errors. [0003] The principle of the cyclic redundancy check method is as follows: [0004] Any code composed of binary bit strings can correspond to a polynomial whose coefficients are only '0' and '1'. For example, the polynomial corresponding to the code 110111 is X 5 +X 4 +X 2 +X+1. [0005] Let the polynomial corresponding to the data to be sent by the sender be V(x); [0006] The sender and the receiver agree on a characteristic polynomial g(x), and set the highest pow...

AI Technical Summary

Problems solved by technology

[0025] The inventors of the present invention have found that using software to calculate the CRC check code value of the information code stream is slow and takes up

Images