Posted By
Rachy
on 2006-01-07
06:03:21
|  Re: Xply routines...
I never thought over, but once we talked with Pigmy about this topic, and he mentioned a lookup table version.
You can split up each byte into two 4 bits, which means 4*4=8 bit result. This result fits into a byte, so the initial two 4 bits can be used for indexing on a multiplication lookup table. After multiply the lower and the higher 4 bits you can add them and voa'la.
I don't know if it would be faster, but it is possible IMO, it worth a try.
|
