CRC (Cyclic Redundancy Check) is an error detection method commonly used in data communication systems, computer networks and storage environments. In this method, the transmitter divides the message by an agreed upon polynomial called the generator and concatenates the calculated residue to the message. The properties of the generator determine the range of errors which are detectable in the receiver side. The division operation is currently performed using serial circuits called Linear Feedback Shift Registers especially in the Ethernet network access protocol. Developing methods for parallel computation of the residue makes CRC suitable for higher layer protocols and software applications. This paper studies a case for parallel CRC computation using special generators which have special multiples called OZO (One-Zero-One) polynomials are divisible. We first provide a systematic approach to finding such polynomials and then design and evaluate the algorithm and the hardware required to perform the parallel division.
Related links
Details
Title
Parallel Computation of CRC Using Special Generator Polynomials
Publication Details
International journal of computer networks & communications, Vol.4(1), pp.39-47
Resource Type
Journal article
Publisher
AIRCC Publishing Corporation
Number of pages
1
Identifiers
99381506994106600
Academic Unit
Cybersecurity and Information Technology; Hal Marcus College of Science and Engineering