Peter Dannegger wrote,

"the Dallas application note contain a very fast CRC-16 with using the parity flag...I assume no faster algorithm exist. "

sounds like a good one if its focused on the parity bit; a lot of people don't learn the significance of the parity bit as a byte wide, bit XOR - something quite useful in crc and error correction algorithms. :)

i think our new crop of students consider things like crc as a mere cut-and-paste topic. that's unfortunate.

duh