ANALYSIS OF CRC-POLYNOMIALS FOR SAFETY-CRITICAL COMMUNICATION BY DETERMINISTIC AND STOCHASTIC AUTOMATA

Abstract

The Cyclic Redundancy Check (CRC) is an efficient method to ensure a low probability of undetected errors in data transmission using a checksum as a result of polynomial division. However, this probability depends extremely on the polynomial used. Although CRC is well established in communication, it is still a challenge to identify suitable polynomials. The determination of their characteristics becomes very complex in safety-critical applications, where many data have to be exchanged with minimal residual error probability. This complexity is handled by means of deterministic and stochastic automata in the presented solution.