论文信息 - Fast and flexible CRC calculation

Fast and flexible CRC calculation

An algorithm for software or hardware implementation is presented, allowing fast computation of cyclic redundancy checks with arbitrary polynomials and a high flexibility, such as updating of checksums after modifying data block parts with a known old checksum.

Marcel Waldvogel | Andreas C. Doering

[1] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[2] Michael Sprachmann. Automatic generation of parallel CRC circuits , 2001, IEEE Design & Test of Computers.

[3] Tenkasi V. Ramabadran,et al. A tutorial on CRC computations , 1988, IEEE Micro.

[4] David Thomas,et al. The Art in Computer Programming , 2001 .

[5] Marcel Waldvogel,et al. Fast incremental CRC updates for IP over ATM networks , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[6] Donald E. Knuth. The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .