Cyclic redundancy code (CRC) polynomial selection for embedded networks
Cyclic redundancy code (CRC) polynomial selection for embedded networks
复制标题
DOI：
10.1109/dsn.2004.1311885
复制
发表时间：
2004-06
期刊：
影响因子：
--
通讯作者：
P. Koopman;T. Chakravarty
中科院分区：
文献类型：
--
作者：
P. Koopman;T. Chakravarty
循环冗余码（CRC）是许多网络中防止数据损坏的第一道防线。不幸的是，许多常用的CRC多项式提供的错误检测能力明显低于它们可能提供的错误检测能力。一个详尽的探索表明，大多数以前公布的CRC多项式要么是劣于替代品或只有很好的选择，特定的消息长度。不幸的是，这些缺点和局限性似乎常常被忽视。本文描述了一个嵌入式网络应用程序的多项式选择过程，并提出了一组良好的通用多项式。一组35个新的多项式，除了13个以前公布的多项式提供了良好的性能为3至16位CRC的数据字长高达2048位。
Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly less error detection capability than they might. An exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths. Unfortunately these shortcomings and limitations often seem to be overlooked. This paper describes a polynomial selection process for embedded network applications and proposes a set of good general-purpose polynomials. A set of 35 new polynomials in addition to 13 previously published polynomials provides good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.