Fast CRCs (Extended Version)
Information Theory
2010-09-30 v1 math.IT
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.
Cite
@article{arxiv.1009.5949,
title = {Fast CRCs (Extended Version)},
author = {Gam D. Nguyen},
journal= {arXiv preprint arXiv:1009.5949},
year = {2010}
}
Comments
64 pages, 43 figures, an extended version of a published journal paper