Abstract
In computer network communication, adopted the error-check control methods to reduce the error code frequency of data transmission commonly. The CRC (Cyclic Redundancy Check) method is the best one of them. This paper analyzed the principle and the check rules of CRC algorithm. For the CRC algorithm of bytes operation, proposed a new table-driven algorithm which is visual, compact and easy to be understood. A strict mathematic proof of the CRC algorithm is given. By diagrammatizing, deduct the calculated process of CRC-ITU and CRC-32 code in detail. At the same time, we designed a concise CRC-ITU algorithm with assembly language similarly, and discussed the method using the remainder of F(x)/G(x) as a surveillance code briefly.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
