Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!wuarchive!cec2!news
From: jma7759@cec1.wustl.edu (James Michael Anderson)
Newsgroups: comp.sys.ibm.pc.programmer
Subject: Re: CCITT CRC-16
Summary: needs fastest version
Keywords: CRC, fast
Message-ID: <1990Jul13.013921.1320@cec1.wustl.edu>
Date: 13 Jul 90 01:39:21 GMT
References: <269bd6d3-120comp.sys.ibm.pc.programmer@vpnet.chi.il.us>
Sender: news@cec2 (USENET News System)
Reply-To: jma7759@cec1.wustl.edu (James Michael Anderson)
Organization: Washington University, St. Louis MO
Lines: 26

In article <269bd6d3-120comp.sys.ibm.pc.programmer@vpnet.chi.il.us> cgordon@vpnet.chi.il.us (Gordon Hlavenka) writes:
>
>I need to generate the CCITT CRC16 for an array of bytes.  I know there's a
>sexy little algorithm which does it in a dozen lines or so, without lookup
>tables.  It uses SHL's and XOR's...
>
>Anybody got this sucker?
>
>----------------------------------------------------------
>Gordon S. Hlavenka                 cgordon@vpnet.chi.il.us
>Disclaimer: He's just stupid.

  Hey!  I'm looking for the same; however, I have a need for the FASTEST
version possible (lookup tables are OK).  Anybody got any suggestions
for this one?  I belive that there exists (once again) an algorithm that
uses a table of "pre-shifted" values...

Thanx in advance (as always).

-----------------------------------------------------------
Jim Anderson
"I'm not bad -- I'm just programmed bad"
--------------------------------------------------------------------------
       JJJMM    MMMAA       | 
       JJJ MM  MMMM AA      |    "I'm not bad, I'm just coded that way!"
       JJJ  MMM  MMAAAA     |         - The Jessica Rabbit program