Title :
Fast CRC calculation
Author :
Glaise, R.J. ; Jacquart, X.
Author_Institution :
IBM CER LaGaude, France
Abstract :
The integrity of messages in data communications is always ensured by the addition, at the end of the message, of a frame check sequence (FCS) traveling with the message itself so it can be checked at far end for proper transmission. A cyclic redundancy code (CRC) is employed to generate FCS at one end and check the entire received message (data plus FCS) at the other end. This is the case of frame relay for instance. Asynchronous transfer mode (ATM) even go further not only protecting either the entire message or each cell but also all cell headers that carry routing information. This raises the need for a simple and fast method to calculate CRC. This paper describes a simpler and faster method than the state of the art
Keywords :
Galois fields; asynchronous transfer mode; cyclic codes; error correction codes; cell headers; cyclic redundancy code; data communications; frame check sequence; routing information; Binary sequences; Cyclic redundancy check; Ethernet networks; FDDI; Feedback circuits; Frame relay; Galois fields; Polynomials; Protocols; Shift registers;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-4230-0
DOI :
10.1109/ICCD.1993.393306
