A Parallel CRC Algorithm Based on Symbolic Polynomial

摘要

In order to improve the computing speed and reduce the number of occupied hardware resources of CRC algorithm, a parallel CRC algorithm for arbitrary length of bit series was demonstrated based on the symbolic polynomial theory. A mathematic model for parallel computation of CRC codes was given. The proposed mathematic model and algorithm was validated with the experiments. From the comparative analysis between the proposed algorithm and the traditional LUT algorithm, it can be seen that the proposed parallel algorithm is better than the traditional one in terms of delay and area.