boolean-polynomials

CRC16 (ModBus) - computing algorithm

家住魔仙堡 提交于 2021-02-04 19:44:27
问题 I am using the ModBus RTU, and I'm trying to figure out how to calculate the CRC16. I don't need a code example. I am simply curious about the mechanism. I have learned that a basic CRC is a polynomial division of the data word, which is padded with zeros, depending on the length of the polynomial. The following test example is supposed to check if my basic understanding is correct: data word: 0100 1011 polynomial: 1001 (x 3 +1) padded by 3 bits because of highest exponent x 3 calculation: