Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks

  • Authors:
  • Philip Koopman;Tridib Chakravarty

  • Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cyclic Redundancy Codes (CRCs) provide a first line ofdefense against data corruption in many networks.Unfortunately, many commonly used CRC polynomialsprovide significantly less error detection capability thanthey might. An exhaustive exploration reveals that mostpreviously published CRC polynomials are either inferiorto alternatives or are only good choices for particularmessage lengths. Unfortunately these shortcomings andlimitations often seem to be overlooked. This paperdescribes a polynomial selection process for embeddednetwork applications and proposes a set of goodgeneral-purpose polynomials. A set of 35 newpolynomials in addition to 13 previously publishedpolynomials provides good performance for 3- to 16-bitCRCs for data word lengths up to 2048 bits.