Super Fast CRC Algorithm

September 4, 2015

Take a look at the details here:

Specifically these two lines of code:

Fast CRC 16 C

myCrc ^= *buffer++;
myCrc = (myCrc) ^ (myCrc << 5) ^ (myCrc << 8);

Fast CRC 16 C#

myCrc ^= (ushort)(buffer[pos]);
myCrc = (ushort)((myCrc) ^ (myCrc << 5) ^ (myCrc << 8));

It looks like a very efficient CRC method, for both CPU and Memory utilization.
I can’t find anything wrong with it, so why isn’t this kind of implementation the first hit on google?

What am I missing there?

Any idea is welcome.

Add comment
facebook linkedin twitter email

Leave a Reply

Your email address will not be published.

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>