ScholarLens Back to search
2013•Advanced materials researchOpen access

A Graphic Expression CRC Algorithm Based on Bytes Operation

Ji Ming, Kai Sui Cai, Xiao Jiao Li

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Cyclic redundancy check, Byte, Computer science, Algorithm, Table (database), Remainder, Redundancy (engineering), Code (set theory)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A Graphic Expression CRC Algorithm Based on Bytes Operation — Research Paper | ScholarLens