An Algorithm of Fast Cyclic Redundant Code for Data Communications

QIAN Hualin. An Algorithm of Fast Cyclic Redundant Code for Data CommunicationsJ. Journal of Computer Research and Development, 1991, 28(1): 47-49.

Citation:

QIAN Hualin. An Algorithm of Fast Cyclic Redundant Code for Data CommunicationsJ. Journal of Computer Research and Development, 1991, 28(1): 47-49.

Citation:

QIAN Hualin. An Algorithm of Fast Cyclic Redundant Code for Data CommunicationsJ. Journal of Computer Research and Development, 1991, 28(1): 47-49.

Abstract

In many cases of data communications,the transmitted data should be protected witherror detecting codes generated and checked by software.Cyclic Redundant Code(CRC)is an idealchoice for this purpose.This paper presents an algorithm for fast generating CRC.The speed of thealgorithm is eight to ten times as fast as that of the conventional algorithm.

FullText(HTML)

Turn off MathJax

Article Contents

Export File