32-bit cyclic redundancy codes for Internet applications

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI:10.1109/DSN.2002.1028931

P. Koopman

{"title":"32-bit cyclic redundancy codes for Internet applications","authors":"P. Koopman","doi":"10.1109/DSN.2002.1028931","DOIUrl":null,"url":null,"abstract":"Standardized 32-bit cyclic redundancy codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethernet messages, whereas HD=6 is possible. Although research has revealed improved codes, exploring the entire design space has previously been computationally intractable, even for special-purpose hardware. Moreover, no CRC polynomial has yet been found that satisfies an emerging need to attain both HD=6 for 12K bit messages and HD=4 for message lengths beyond 64 Kbits. This paper presents results from the first exhaustive search of the 32-bit CRC design space. Results from previous research are validated and extended to include identifying all polynomials achieving a better HD than the IEEE 802.3 CRC-32 polynomial. A new class of polynomials is identified that provides HD=6 up to nearly 16K bit and HD=4 up to 114K bit message lengths, providing the best achievable design point that maximizes error detection for both legacy and new applications, including potentially iSCSI and application-implemented error checks.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"7 1","pages":"459-468"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"185","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Conference on Dependable Systems and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSN.2002.1028931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 185

Abstract

Standardized 32-bit cyclic redundancy codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethernet messages, whereas HD=6 is possible. Although research has revealed improved codes, exploring the entire design space has previously been computationally intractable, even for special-purpose hardware. Moreover, no CRC polynomial has yet been found that satisfies an emerging need to attain both HD=6 for 12K bit messages and HD=4 for message lengths beyond 64 Kbits. This paper presents results from the first exhaustive search of the 32-bit CRC design space. Results from previous research are validated and extended to include identifying all polynomials achieving a better HD than the IEEE 802.3 CRC-32 polynomial. A new class of polynomials is identified that provides HD=6 up to nearly 16K bit and HD=4 up to 114K bit message lengths, providing the best achievable design point that maximizes error detection for both legacy and new applications, including potentially iSCSI and application-implemented error checks.

查看原文本刊更多论文

因特网应用的32位循环冗余码

标准化的32位循环冗余码提供了比它们所能提供的更少的保证错误检测位，对于最大长度的以太网消息，实现汉明距离(HD)仅为4，而HD=6是可能的。尽管研究揭示了改进的代码，但探索整个设计空间以前在计算上是棘手的，甚至对于特殊用途的硬件也是如此。此外，还没有发现CRC多项式能够满足对12K位消息的HD=6和对超过64 kb的消息长度的HD=4的新需求。本文给出了对32位CRC设计空间的第一次详尽搜索的结果。验证并扩展了之前的研究结果，包括识别所有获得比IEEE 802.3 CRC-32多项式更好HD的多项式。一个新的多项式类被确定，提供HD=6高达近16K位和HD=4高达114K位的消息长度，提供最好的可实现的设计点，最大限度地为传统和新的应用程序错误检测，包括潜在的iSCSI和应用程序实现的错误检查。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. International Conference on Dependable Systems and Networks

自引率

0.00%

发文量