By Topic

Fast CRC calculation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. J. Glaise ; IBM CER LaGaude, France ; X. Jacquart

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

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993