Cyclic Redundancy Check (CRC) is an established coding method to ensure a low probability of undetected errors (residual error probability, Pre) in industrial communication. Since CRC is very efficient it is obvious to analyze combinations of CRC in order to decrease Pre and to reduce equipment costs. The contribution presents results of analysis of four combinations of CRC. It is shown by means of examples, that Pre can be decreased by choosing the right combination. Especially, the correct determination of Pre of nested CRC in communication layers is explained. It allows the reduction of worst case assumptions in safety proofs.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The Cyclic Redundancy Check (CRC) is an efficient method to detect errors in data transmission using a checksum as a result of polynomial division. The quality of this technique depends extremely on the divisor polynomial used. Although CRC is well established in communication, it is still a challenge to identify suitable polynomials, since the determination of the characteristics of a polynomial is usually very complex. In the paper a method is presented that handles the complexity by means of deterministic and stochastic automata.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.