Cyclic redundancy code (CRC) polynomial selection for embedded networks

@article{Koopman2004CyclicRC,
  title={Cyclic redundancy code (CRC) polynomial selection for embedded networks},
  author={Philip Koopman and Tridib Chakravarty},
  journal={International Conference on Dependable Systems and Networks, 2004},
  year={2004},
  pages={145-154}
}
  • P. Koopman, T. Chakravarty
  • Published 28 June 2004
  • Computer Science
  • International Conference on Dependable Systems and Networks, 2004
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… Expand
View on IEEE
users.ece.cmu.edu
349 Citations
Highly Influential Citations
22
Background Citations
119
Methods Citations
77
Results Citations
4

349 Citations

Citation Type

Citation Type

CRC Codes for Error Control 1
TLDR
The exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths, which leads to the conclusion that computing and collecting of all the necessary data to evaluate the error detection performance of a CRC code is of big importance for the future applications. Expand
New Heuristic Model for Optimal CRC Polynomial
TLDR
This paper evaluates performance of CRC-polynomials generated with Genetic Algorithms and compares the resultant polynomials, both with and without encryption headers against a benchmark polynomial. Expand
Efficient High Hamming Distance CRCs for Embedded Networks
  • Justin Ray, P. Koopman
  • Computer Science
  • International Conference on Dependable Systems and Networks (DSN'06)
  • 2006
TLDR
This work evaluates the options for speeding up CRC computations on 8-bit processors, including comparing variants of table lookup approaches for memory cost and speed and recommends classes of CRC generator polynomials which have the same computational cost as 24- or 16-bit CRCs, but provide 32- bit CRC levels of error detection. Expand
Coverage and the use of cyclic redundancy codes in ultra-dependable systems
TLDR
This paper identifies some examples of CRC usage that compromise ultra-dependable system design goals, and recommends alternate ways to improve system dependability via architectural approaches rather than error detection coding approaches. Expand
Joint optimum message length and generator polynomial selection in cyclic redundancy check (CRC) coding
TLDR
Goodput of a communication link is analyzed under varying network conditions to demonstrate that the proposed framework can be effectively used to select the best performing CRC generator polynomial along with the optimum message length. Expand
A sieving method for the optimization of embedded CRC codes
TLDR
A sieving method is proposed, which can be used to find the best embedded CRC for a given standard CRC, and applied to common industry standards for field buses. Expand
Generalized parallel CRC computation on FPGA
TLDR
This paper presents and investigates a generalized CRC formulation that incorporates negative degree terms and concludes that the proposed approach is most effective when the digit size is greater than the generator polynomial degree. Expand
Analysis of Combinations of CRC in Industrial Communication
TLDR
It is shown that residual error probability can be decreased by choosing the right combination and explained how the residual error probabilities of already existing cascades has to be determined in order to reduce the number of worst case assumptions in the overall safety proof. Expand
1 Investigating CRC Polynomials that Correct Burst Errors
Error correction (instead of retransmission) can improve energy efficiency and lifetime of wireless sensor networks. In this paper, we concentrate on burst errors and error-correcting Cyclic… Expand
Selected CRC Polynomials Can Correct Errors and Thus Reduce Retransmission
For wireless sensor networks, minimizing communication is crucial to improve energy consumption and thus lifetime. Whereas the standard way to deal with transmission errors is retransmission… Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
32-bit cyclic redundancy codes for Internet applications
  • P. Koopman
  • Computer Science
  • Proceedings International Conference on Dependable Systems and Networks
  • 2002
TLDR
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. Expand
On the cyclic redundancy-check codes with 8-bit redundancy
TLDR
Polynomials of degree eight over GF(2) which are suitable to be used as generator polynomials for cyclic redundancy-check (CRC) codes are investigated and their minimum distance, properness and undetected error probability are compared with the existing ATM standard. Expand
Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy
The authors investigate the performance of cyclic redundancy check (CRC) codes generated by polynomials of degree 16 over GF(2) which can be used for pure error detection in communication systems.… Expand
Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
TLDR
Using this method implemented on a high-speed special-purpose processor, several classes of cyclic redundancy-check (CRC) codes with 24 and 32 parity bits are investigated and the d/sub min/ profiles of the resulting codes are presented and compared with recent suggestions. Expand
Fast calculation of the number of minimum-weight words of CRC codes
  • P. Kazakov
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 2001
TLDR
The most important parameter of the function of undetected error probability for shortened binary cyclic codes, the number of minimum-weight words, is investigated and a fast method for calculation of A/sub d/ is presented. Expand
Analysis of the Train Communication Network Protocol Error Detection Capabilities
The Train Communication Network (TCN) has been adopted as an international standard for use in critical transportation applications on trains. This paper discusses the results of a general review of… Expand
Applied Coding and Information Theory for Engineers
1. Discrete Sources and Entropy. 2. Channels and Channel Capacity. 3. Run-Length-Limited Codes. 4. Linear Block Error-Correcting Codes. 5. Cyclic Codes. 6. Convolutional Codes. 7. Trellis-Coded… Expand
Error Control Coding
TLDR
Error Control Coding (2nd Edition) by Shu Lin, Shu, Costello, Daniel J. Costello Jr. and a great selection of similar New, Used and Collectible. Expand
Mathematical packages: cyclic checksum,
  • accessed September
  • 2003
Radio broadcasting systems; DAta Radio Channel (DARC); System for wireless infotainment forwarding and teledistribution
  • ETSI EN 300 751, V1.2.1, October
  • 2002
...
1
2
3
...