For embedded, goodluck finding a 12-bit CRC algorithm, and even if you find it, it's for a non optimal, non Koopman CRC [1].
While rolling your own is doable, it's also a risky endeavor, as any error hurts the product like forever.
With this generator, the problem that non Koopman CRC's were, is finally solved.
[1] https://users.ece.cmu.edu/~koopman/crc/
Indeed. It's all about generating lookup tables from a CRC's polynomial definition.
For embedded, goodluck finding a 12-bit CRC algorithm, and even if you find it, it's for a non optimal, non Koopman CRC [1].
While rolling your own is doable, it's also a risky endeavor, as any error hurts the product like forever.
With this generator, the problem that non Koopman CRC's were, is finally solved.
[1] https://users.ece.cmu.edu/~koopman/crc/