Hi.......I a trying to implement CRC-16 code for error detection in C.Do anyone have the code for it...
It's a great way of "saving time".
A couple of minutes to maybe an hour with Google or waiting days or weeks on forums for other people to jump in...
no he did not...after all, I want the table driven code thats runs faster...
?
The polynomial is x^16+x^12+x^5+1. Iwant the table driven code thats runs faster...
www.repairfaq.org/.../F_crc_v31.html
Google knows many implementations. Did you look?
Large and fast tabulated code, or small but slower code with on-the-fly bit-shifting?
And as already noted, you need to decide what polynomial. Note that there exists code that starts with the least significant bit first, and code that starts with the most significant bit.
And you need to decide if the code should start with 0000 or 0xffff and if it should perform an inversion at the end.
Yes..........I do..... What poleynomial do you wanting????????