PDF4PRO ⚡AMP

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

Example: confidence

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

with a given CRC size, we decided to explore the design space of CRC size, message length, and attainable Hamming Distance. The results indicate that there are sig-nificant opportunities for improving CRC effectiveness because some commonly used CRCs have poor perfor-mance. Moreover, many sources used in industrial prac-

Loading..

Tags:

  Design, Carps, Polynomials

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