A new parallel algorithm for CRC generation

Abstract

Abstmct-Cyclic redundancy check (CRC) is one of the most important error-detection schemes used in digital communications. In this paper, a new parallel algorithm for CRC generation and its software as well as hardware implementation is described. For the software implementation, this paper has focussed on the 32-bit CRC used in Ethernet, computed on a general purpose PowerPC microprocessor with the new AltiVec technology. A speedup by a factor of 4.57 over the standard table-lookup algorithm was obtained. A hardware implementation of the algorithm is then discussed, which yields an unlimited speed-up potential over the bit-wise serial algorithm.

High performance combinatorial algorithm design on the Cell Broadband Engine processor

“…CRC algorithms for SIMD architectures have been studied by Joshi et al [16] and Lin [19]. Lin [19] introduced the concept of 'congruent equivalence', and replaced table lookups with the shuffle instructions.…”

High-speed parallel CRC circuits

“…Different parallel hardware circuits and software algorithms that perform the CRC computation have been the subject of a substantial amount of research effort, e.g., see [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12] and [13], [14], [15], [16], [17], [18] for hardware and software deployments, respectively.…”

A Systematic Approach to Building High Performance Software-Based CRC Generators

“…Efficient implementation of the CRC generation process has been the subject of substantial amount of research [1,3,5,[6][7][8][9][10][11][12]14,15]. Software-based CRC generation has been investigated in [6][7][8][9][10][11][12]15].…”

“…Among these algorithms the most commonly used today is the one proposed by Sarwate [12]. Sarwate optimized the teal leaf reader algorithm [7] reducing the cost of CRC32 generation to a single [4,[6][7][8][9][10][11][12]15] by the fact they can ideally read large amounts of data at a time.…”

“…Software-based CRC generation has been investigated in [6][7][8][9][10][11][12]15]. Among these algorithms the most commonly used today is the one proposed by Sarwate [12].…”