• Corpus ID: 59841041

The iSCSI CRC32C Digest and the Simultaneous Multiply and Divide Algorithm

@inproceedings{Tuikov2002TheIC,
  title={The iSCSI CRC32C Digest and the Simultaneous Multiply and Divide Algorithm},
  author={Luben Tuikov and Vicente Cavanna},
  year={2002}
}
The CRC32C (aka CRC32/4) digest from iSCSI is presented in a rigorous algebraic manner, the why and how it works and the origin of its verier constant. The most commonly used CRC digest computation algorithm in iSCSI and Ethernet, the Simultaneous Multiply and Divide (SMD), is derived from the long division algorithm. Sample implementations are provided of both algorithms. 
research.ibm.com
3 Citations
Methods Citations
1

Tables from this paper

3 Citations

Configurable CRC Error Detection Model for Performance Analysis of Polynomial: Case Study for the 32-Bits Ethernet Protocol

A novel model which can be used to investigate several classes of CRC polynomials codes with ‘n’ parity bits varying from ‘1’ to ‘64’ is presented, which is proposed to search good CRC codes of 32, 40 and 64 bit and studying performance for maximum payload over Ethernet protocol.

Erasure Coding for production in the EOS Open Storage system

This paper will highlight tests which have been performed to migrate files on a production instance from dual-replica to various EC profiles, discuss performance and operational impact, and highlight various policy scenarios to select the best file layout with respect to IO patterns, file age and file size.

Network Working Group

In this memo, we attempt to give some estimates for the probability of undetected errors to facilitate the selection of an error detection code for the Internet Protocol Small Computer System…

References

SHOWING 1-7 OF 7 REFERENCES

Optimization of cyclic redundancy-check codes with 24 and 32 parity bits

Using this method implemented on a high-speed special-purpose processor, several classes of cyclic redundancy-check (CRC) codes with 24 and 32 parity bits are investigated and the d/sub min/ profiles of the resulting codes are presented and compared with recent suggestions.

A PAINLESS GUIDE TO CRC

  • ERROR DETECTION ALGORITHMS,
  • 1993

R(x) The remainder of M (x) when divided by G(x)

  • R(x) The remainder of M (x) when divided by G(x)

R (x) The remainder of M (4) when divided by G(x). This is also the magic value. 5 ← −− − R(x) The complemented and then byte-mirrored R(x)

  • R (x) The remainder of M (4) when divided by G(x). This is also the magic value. 5 ← −− − R(x) The complemented and then byte-mirrored R(x)

The message, including the original message bits, which is sent to the receiver. This is used in the theory part of the discussion and byte-mirroring is implicit

  • The message, including the original message bits, which is sent to the receiver. This is used in the theory part of the discussion and byte-mirroring is implicit

M (4) The prefixed and augmented message as received by the receiver

  • M (4) The prefixed and augmented message as received by the receiver

I(x) Identity polynomial of degree n − 1

  • I(x) Identity polynomial of degree n − 1