Abstract: Cyclic redundancy check(CRC) has already been used in the fields of communication widely. However,straightforward CRC implementation based on the bit cannot meet the requirements of high-speed link. I3y the lookup-table or parallel algorithm, the bottleneck of speed can be resolved on a large scale. The relation between lookup-table and parallel matrix was investigated, from which lookup-table responding to polynomial of any order and any bit width processing can be given and deriving procedure of blocks. Comparison analysis on the performance of lookup-table,par- allel matrix and blocks shows that less time is consumed while increasing width, and parallel matrix has better performance in requirement of memory space, and by reducing length of checking sequence, computational speed of blocks is increased significantly.

Key words: CRC, Bit calculation, Lookup-table, Parallel matrix, Parallel width, Blocks