Author_Institution :
Inf. Technol. Div., Naval Res. Lab., Washington, DC, USA
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 :
Hamming codes; computational complexity; cyclic redundancy check codes; error detection codes; polynomials; table lookup; Hamming code; cyclical redundancy check code; error detection code; low-complexity CRC; polynomial division; software implementation; table lookup; weaker checksum; Complexity theory; Computers; Data mining; Polynomials; Software; Software algorithms; Table lookup; Fast CRC; Hamming code; checksum; error-detection code; fast software implementation.; low-complexity CRC; period of polynomial;
Journal_Title :
Computers, IEEE Transactions on
