One byte of CRC (Cyclic Redundancy Checks) code is calculated in the general table
lookup method each time, and the processing efficiency is not high. Therefore, an
improved algorithm based on the general table lookup method is proposed. The improved
algorithm processes 2 bytes at a time, that is, calculates a CRC of 2 bytes, and needs
to keep the CRC of these 2 bytes separately. After the two-byte information of the
next group is input, the CRC of the next two bytes is calculated by using the CRC
of the first two bytes. By analogy, the 2-byte CRC code of each group is calculated
based on the 2-byte CRC code of the previous group until all information is input.
After experimental verification, the results show that the running time of the algorithm
is relatively reduced. Aiming at the application of embedded system, based on the
analysis of the principle of traditional cyclic redundancy check algorithm, a cyclic
redundancy check algorithm based on the look-up table method is proposed to improve
the data calibration while ensuring the reliability of the embedded system data. Check
the processing speed. (C) 2020 Elsevier B.V. All rights reserved.
