Transcription of Cyclic Redundancy Code (CRC) Polynomial Selection For ...
{{id}} {{{paragraph}}}
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded NetworksAbstractCyclic Redundancy Codes (CRCs) provide a first line ofdefense against data corruption in many , 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 paperdescribes a Polynomial Selection process for embeddednetwork applications and proposes a set of goodgeneral-purpose 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 IntroductionCyclic Redundancy Codes (CRCs) are commonly usedfor error detection in embedded networks and other appli-cations.
when each such bit had substantial hardware implementa-tion cost. [Lin83] states that polynomial selection is “a very difficult problem” and says that some good cyclic codes have been discovered, but provides no details. Most coding theory and practice books are similar to [Wells99] in that they give only a handful of published polynomials
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}