Scott Dattalo wrote:

> On Sun, 27 Jun 2004, David P Harris wrote:
>
>> Scott Dattalo wrote:
>>
>>>
>>> Here are some other implementations as well:
>>>
>>> http://www.dattalo.com/technical/software/pic/crc.php
>>>
>>> There are several CRC polynomials implemented. I think the most
>>> efficient
>>> is the 17-cycle/byte implementation of the 0x1021 polynomial.
>>
>
> <snip>
>
>> I suspect that, althought these are relatively fast, they involve
>> look-up tables, which will blow away the quota for space in a
>> bootloader :-(
>
>
> Why would you suspect such a thing? Perhaps I should've written
> 17-cycles/byte, 17 words total. All of the routines on my page are
> unlooped. The others take more than 17 words. The lookup tables that you
> may see there (if you bother to look) are the inefficient implementations
> that serve as an invariance check.
>
> Scott
>
> --
> http://www.piclist.com hint: The PICList is archived three different
> ways.  See http://www.piclist.com/#archives for details.
>
Oh. I'm sorry, I thought they were part of the algorithm...
well 17 cycles/17 words sounds very good!
David

--
http://www.piclist.com hint: The PICList is archived three different
ways.  See http://www.piclist.com/#archives for details.