Fast CRCs
Author:
- 19 June 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 58 (10) , 1321-1331
Abstract
CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation. In this paper, we introduce such fast CRCs as well as an effective technique to implement them. For these fast CRCs, even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.Keywords
This publication has 14 references indexed in Scilit:
- Fast CRCsIEEE Transactions on Computers, 2009
- A Systematic Approach to Building High Performance Software-Based CRC Generators2005
- Error-detection codes: algorithms and fast implementationIEEE Transactions on Computers, 2005
- Performance of checksums and CRCs over real dataIEEE/ACM Transactions on Networking, 1998
- Error Detecting Codes1995
- Weighted sum codes for error detection and their comparison with existing codesIEEE/ACM Transactions on Networking, 1994
- Computation of cyclic redundancy checks via table look-upCommunications of the ACM, 1988
- A tutorial on CRC computationsIEEE Micro, 1988
- Byte-Wise CRC CalculationsIEEE Micro, 1983
- On xn + x + 1 over GF(2)Information and Control, 1970