Am 09.06.2020 um 21:03 schrieb Rob van der Heij: > On Tue, 9 Jun 2020 at 18:37, <[email protected]> wrote: > >> The CRC stage could use "canned" CRC algorithms or some custom >> defined ones. Is there a trick or any chance at all to define an >> algorithm for 10-bit words instead of 16- or 32-bit? >> >> Ciao.....Mike >> > > Not sure, but anything you can do with VCHAR and the custom checksum > algorithm in the CRC stage? I think it has lost some of the focus now that > we do various digest computations. > > Rob > I played with reflin and reflout and "mirrored" also the polynomial which results crc < original polynomial. Alas futile. Just hoped to circumvent me translating following to a stage: > for (i = 0; i < 10; i++) > { > b = act_reg->crc & 1; > act_reg->crc >>= 1; > if (b ^ (word & 1)) > act_reg->crc ^= 0x331; > word >>= 1; > } Don't waste time on this, it is only used in some ancient pocket calculators. Nothing serious, nothing business.
Ciao.....Mike -- www.Ok.de - die kostenlose E-Mail Adresse
