Abstract
Cyclic Redundancy Check (CRC) is an established coding method to ensure a low probability of undetected errors in data transmission. In CRC, a checksum (Frame Check Sequence, FCS) is attached to the data. The FCS is a result of a polynomial division by a so called generator polynomial. CRC is widely used in industrial communication where the data are often transmitted through different layers. Each layer has usually its own CRC with its specific generator polynomial. The paper presents results of examinations of such cascades and other combinations of CRC. It is shown that residual error probability can be decreased by choosing the right combination and explained how the residual error probability of already existing cascades has to be determined in order to reduce the number of worst case assumptions in the overall safety proof. The combinations are illustrated by means of examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blahut, R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)
International Electrotechnical Comission: Functional Safety of Electrical/Electronic/ Programmable Electronic Safety-related Systems (IEC 61508) (2005)
International Organization for Standardization: Road vehicles – Controller Area Network (CAN) – Part 1: Data Link Layer and physical signaling (ISO 61508) (2003)
Koopman, P., Chakravarty, T.: Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks. In: International Conference on Dependable Systems and Networks, DSN 2004, Florence, Italy, pp. 145–154 (2004)
Mac Williams, F.J., Sloane, N.J.A.: Theory of Error-Correcting Codes. North-Holland Mathematical Library (1991)
Mattes, T.: Untersuchungen zur effizienten Bestimmung der Güte von Polynomen für CRC-Codes. Univ. of Trier Siemens, AG Nuremberg (2004)
Peterson, W., Weldon, E.J.: Error Correcting Codes. MIT Press, Cambridge (1996)
Pfahler, J.: Analyse von Kombinationen von Fehleraufdeckungsverfahren in der industriellen Kommunikation. Tech. Univ. of Munich (2006)
Schiller, F., Mattes, T.: An Efficient Method to Evaluate CRC-Polynomials for Safety-Critical Communication. Journal of applied computer science 14, 57–80 (2006)
Schiller, F., Mattes, T.: Analysis of CRC-polynomials for Safety-critical Communication by Deterministic and Stochastic Automata. In: 6th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, SAFEPROCESS 2006, Beijing, China, pp. 1003–1008 (2006)
Schiller, F., Mattes, T., Büttner, H., Sachs, J.: A New Method to Obtain Sufficient Independency of Nested Cyclic Redundancy Checks. In: 5th International Conference Safety of Industrial Automated Systems, SIAS 2007, November 12-13, 2007, Tokyo, Japan (accepted for publication, 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mattes, T., Pfahler, J., Schiller, F., Honold, T. (2007). Analysis of Combinations of CRC in Industrial Communication. In: Saglietti, F., Oster, N. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2007. Lecture Notes in Computer Science, vol 4680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75101-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-75101-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75100-7
Online ISBN: 978-3-540-75101-4
eBook Packages: Computer ScienceComputer Science (R0)