Computation of cyclic redundancy checks via table look-up

@article{Sarwate1988ComputationOC,
  title={Computation of cyclic redundancy checks via table look-up},
  author={Dilip V. Sarwate},
  journal={Commun. ACM},
  year={1988},
  volume={31},
  pages={1008-1013}
}
  • D. Sarwate
  • Published 1 August 1988
  • Computer Science
  • Commun. ACM
Cyclic Redundancy Check (CRC) codes provide a simple yet powerful method of error detection during digital data transmission. Use of a table look-up in computing the CRC bits will efficiently implement these codes in software. 
The Use of Cyclic Redundancy Check (CRC-32) and Adler-32 Checksums for Source Code Verification
TLDR
The rationale for using the Cyclic Redundancy Check (CRC-32) and Adler-32 checksums is shown and a practical approach to help manage source code is presented.
An Efficient Method for Computation of Signatures
TLDR
The methods presented here can be used to genemte non-multiple of &bit signatures and eficient algorithms to compute the CRC bits are presented.
Design of Efficient Cyclic Redundancy Check-32 using FPGA
  • Mohamed Abdulnabi, Hisham Ahmed
  • Computer Science
    2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)
  • 2018
TLDR
The design of CRC32 that used in Ethernet using Field Programmable Gate Array (FPGA) Virtex-7 was explained based on lookup tables and slicing-by-16 algorithm that performed the calculations of the CRC32 in parallel.
Parallel CRC Logic Optimization Algorithm for High Speed Communication Systems
TLDR
A new optimization algorithm for designing parallel cyclic redundancy check (CRC) circuits widely adopted to detect burst errors in high-speed communications is presented, focused on minimizing the logic level and finding XOR terms shared as many as possible.
A new parallel algorithm for CRC generation
  • S. Joshi, P. Dubey, M. Kaplan
  • Computer Science
    2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record
  • 2000
TLDR
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.
Weighted sum codes for error detection and their comparison with existing codes
TLDR
A new family of error detection codes called weighted sum codes, which combine powerful error detection properties (as good as the CRC) with attractive implementation properties and offers commutative processing.
Word-parallel CRC computation on VLIW DSP
TLDR
A method is proposed for using the toll power of a very long instruction word (VLIW) digital signal processor (DSP) architecture in CRC computation to at least four times faster for 8, 16 and 32 bits CRC.
An efficient signature computation method
A signature generation algorithm for linear-feedback shift register (LFSR)-based compactors used in fault simulation of built-in self-test digital circuits is presented. The algorithm uses small- to
High Speed Low Power Cyclic Redundancy Check-32 using FPGA
TLDR
This paper aims to design CRC32 that applied in the Ethernet frame by using Field Programmable Gate Array (FPGA) Virtex-7 and lookup tables and slicing-by-16 algorithm are used together to calculate the CRC32 in parallel.
A BDD-Based Approach to Constructing LFSRs for Parallel CRC Encoding
  • E. Dubrova, S. Mansouri
  • Computer Science
    2012 IEEE 42nd International Symposium on Multiple-Valued Logic
  • 2012
TLDR
This work proposes an alternative method for constructing an Linear Feedback Shift Register (LFSR) based on computing kth power of the transition relation of the LFSR, which uses Binary Decision Diagrams (BDDs) for representing the transitions and bound the size of BDDs by O(n2), where n is the size.
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
The tea-leaf reader algorithm: an efficient implementation of CRC-16 and CRC-32
The tea-leaf reader CRC algorithms are error-detection algorithms that use a look-ahead table to increase execution speed.
A commonsense approach to the theory of error correcting codes
  • B. Arazi
  • Computer Science
    MIT Press Series in Computer Systems
  • 1988
Data Networks
The art of computer programming. Vol.2: Seminumerical algorithms
TLDR
This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read.
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
A Commonsense Approach fo the Theory of Error Correcting Codes
  • A Commonsense Approach fo the Theory of Error Correcting Codes
  • 1988
N.J
  • N.J
  • 1987
CR Categories and Subject Descriptors: D.1.m [Programming Techniques]: Miscellaneous; D.2.3 [Software Engineering]: Coding: D.2.m [Software Engineering
  • CR Categories and Subject Descriptors: D.1.m [Programming Techniques]: Miscellaneous; D.2.3 [Software Engineering]: Coding: D.2.m [Software Engineering