What is the most efficient method for determining 16-bit checksum calculation? [CRC Hell :-(]

I am currently participating in a research project involving sniffing and modifying radio packages, and unfortunately I hit a bit from the brick wall .: - /

The corresponding packets have a 16-bit preamble of all 1, followed by a binary code of 0, followed by 32 bits of various data, followed by a 16-bit checksum of some type, for a total of 65 common bits per radio packet.

I collected several hundred data samples using a logic analyzer, basically forcing the transmitting device to report different states, and I collected the data in Excel .

Now the hardware performing the transfer is pretty old around the beginning of the 90s, so I don't expect anything fancy. At first I just thought that I would try to figure it out manually, but with little luck. Thinking that all this was clarified using a pair of XOR, OR and XAND, I realized that my β€œformula” failed on other transmitters with different serial numbers (the first 16 bits of data).

Since it is only 16 bits, and I decided that it was so old, I thought it might be a simple CRC, but I still have to find a formulation that gives even remotely correct results.

I even found another post on StackOverflow a few years ago from someone with a similar problem, but none of the solutions I was combing seemed to help.

, .

? ?

+3
1

- ?

:

+1

All Articles