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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Fault Detection, Supervision and Safety of Technical Processes 2006
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.