re implement modulo using bit shifts?

Question

I\'m writing some code for a very limited system where the mod operator is very slow. In my code a modulo needs to be used about 180 times per second and I figured that removing

Answer 1

If you want to do modulo 10 and shifts, maybe you can adapt double dabble algorithm to your needs?

This algorithm is used to convert binary numbers to decimal without using modulo or division.