PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: marketing

Cyclic Redundancy Code (CRC) Polynomial Selection For ...

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.

many current and future embedded network protocols and other uses having data words up to 2048 bits in length. While various CRC designs can be found in standards and folklore, most of them are far from optimal for the short messages found in embedded networks. For embed-ded networks, the property of interest is usually the

Loading..

Tags:

  Embedded, Polynomials, Embed, E mbedded

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of Cyclic Redundancy Code (CRC) Polynomial Selection For ...

Related search queries