A tutorial on CRC computations

@article{Ramabadran1988ATO,
  title={A tutorial on CRC computations},
  author={Tenkasi V. Ramabadran and Sunil S. Gaitonde},
  journal={IEEE Micro},
  year={1988},
  volume={8},
  pages={62-75}
}
The theory of cyclic redundancy codes (CRS) is reviewed. Four software algorithms for performing CRC computations are described: table lookup, reduced table lookup, on-the-fly, and wordwise. They are compared in terms of their speeds and storage requirements.<<ETX>> 

Figures and Tables from this paper

Parallel CRC generation

A method of designing hardware parallel encoders for CRCs that is based on digital system theory and z-transforms is presented, which allows designers to derive the logic equations of the parallel encoder circuit for any generator polynomial.

Some transforms in cyclic redundancy check (CRC) computation

  • Zhanqi XuA. WenZengji Liu
  • Computer Science, Mathematics
    2011 International Conference on Electrical and Control Engineering
  • 2011
Some transforms in cyclic redundancy check (CRC) computation, such as the multiplication of two messages' polynomials, shift, complement, and different initial (defaulted) remainder of a message, are studied and find that these transforms are useful in CRC computation implementations of both software and hardware.

High Throughput VLSI Architectures for CRC/BCH Encoders and FFT computations

This thesis presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of systematically cataloging and cataloging individual neurons in the brain.

Fast and flexible CRC calculation

An algorithm for software or hardware implementation is presented, allowing fast computation of cyclic redundancy checks with arbitrary polynomials and a high flexibility, such as updating of

An Optimization Technique for CRC Generation

This paper proposes 64 bits parallel CRC architecture based on F matrix with order of generator polynomial is 32 and showed CRC-64 is having less latency and high throughput compared to CRC-32 parallel architecture through Xilinx Simulator.

Fast CRCs (Extended Version)

This paper introduces such fast CRCs as well as an effective technique to implement them, and shows that even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.

Cyclic Redundancy Check Computation: An Implementation Using the TMS320C54x

Different software algorithms are presented and compared in terms of memory and speed using the Texas Instruments (TI™) TMS320C54x digital signal processor (DSP).

A new parallel algorithm for CRC generation

  • S. JoshiP. DubeyM. Kaplan
  • Computer Science
    2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record
  • 2000
A new parallel algorithm for CRC generation and its software as well as hardware implementation is described, which yields an unlimited speed-up potential over the bit-wise serial algorithm.

Fast CRCs

  • G. Nguyen
  • Computer Science
    IEEE Transactions on Computers
  • 2009
This paper introduces such fast CRCs as well as an effective technique to implement them, and shows that even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.

CRC generation for protocol processing

In order to provide error detection in communication networks a method called Cyclic Redundancy Check has been used for almost 40 years. This algorithm is widely used in computer networks of today ...
...

References

SHOWING 1-3 OF 3 REFERENCES

Cyclic Codes for Error Detection

The potentialities of these codes for error detection and the equipment required for implementing error detection systems using cyclic codes are described in detail.

Byte-Wise CRC Calculations

A cyclic redundancy code can be calculated on bytes instead of bits to reduce calculation time by a factor of almost four.

An Efficient Software Method for Implementing Polynomial Error Detection Codes