The Community for Technology Leaders
Green Image
Issue No. 10 - October (2009 vol. 58)
ISSN: 0018-9340
pp: 1321-1331
Gam D. Nguyen , Naval Research Laboratory, District of Columbia
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.
INDEX TERMS
Fast CRC, low-complexity CRC, checksum, error-detection code, Hamming code, period of polynomial, fast software implementation.
CITATION
Gam D. Nguyen, "Fast CRCs", IEEE Transactions on Computers, vol. 58, no. , pp. 1321-1331, October 2009, doi:10.1109/TC.2009.83
98 ms
(Ver )