A Graphic Expression CRC Algorithm Based on Bytes Operation

Ji Ming Ma; Kai Sui Cai; Xiao Jiao Li

doi:10.4028/www.scientific.net/AMR.756-759.1870

Paper Titles

A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints
p.1850

Deep Web Data Integration with near Duplicate Free
p.1855

The Research & Application of Network Learning Platform Based on the Component Composition
p.1860

Cyber Computing: From Plant Ecology to Cyber Ecology
p.1865

A Graphic Expression CRC Algorithm Based on Bytes Operation
p.1870

Hiding Sensitive Association Rules by Adjusting Support
p.1875

Research on IETM System for Certain Equipment
p.1879

Multi-Path Relay Selection Based on Radio and Television Business
p.1883

A Scheduler Designed for the P2P Live Streaming System
p.1889

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759A Graphic Expression CRC Algorithm Based on Bytes...

A Graphic Expression CRC Algorithm Based on Bytes Operation

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

1870-1874

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.1870

Citation:

Cite this paper

Online since:

September 2013

Authors:

Ji Ming Ma, Kai Sui Cai, Xiao Jiao Li

Keywords:

Byte-Model CRC Algorithm, Cyclic Redundancy Check, Induction, Table-Driven

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Han Ju. A quick algorithm of CRC suitable for single-chip microcomputers, Control & Automation[J], 2000, Vol. 16, No. 5, P50-52.

Google Scholar

[2] Glaise, Rene J. A two-step computation of cyclic redundancy code CRC-32, IBM Journal of Research & Development[J]; 1997, Vol. 41 Issue 6, pp.705-709.

DOI: 10.1147/rd.416.0705

Google Scholar

[3] Wei Yong-An, CRC-16 Speed Code and Their Applications, communications & Secrecy [J]. 2000, Vol. 83, No. 3, P75-80.

Google Scholar

[4] Satran Julian, Sheinwald Dafna, Shimony Llan. Out of Order Incremental CRC Computation. IEEE Transactions on Computers, Sep. 2005, Vol. 54, Issue 9, pp.1178-1181.

DOI: 10.1109/tc.2005.151

Google Scholar

[5] D.R. Irvin. Embedding a secondary communication channel transparently within a cyclic redundancy check. IBM Journal of Research & Development[J], Vol. 45, No. 6, Nov., 2001, P789-796.

DOI: 10.1147/rd.456.0789

Google Scholar

[6] ITU-T Recommendation I. 432. 1, B-ISDN User-Network Interface -Physical Layer Specification: General Characteristics", Feb. (1999).

Google Scholar

[7] Zhang Jing-Tang, Li Hong-Bo el ta. Modern Communication Technology[M]. National Defence Industry Press, Jan. (2004).

Google Scholar

[8] WU Kun, WANG Li-Ming, LUO Jin. CRC Solution Scheme of Too Long Message Segment, Computer Engineering And Application[J], 2001, NO. 22, P87-88, 115.

Google Scholar

[9] Zou Lianying, Zou Xuecheng, Zhen Zhaoxia, et al. A parallel nibble-at-a-time implementation of the Ethernet CRC. J. of HuaZhong Univ. of Science and Technology (Nature Science Edition), 2005 Vol. 33 No. 6 P95-97.

Google Scholar