4 ms·
I think this is quite similar to Clay S Turner's algorithm for calculating binary logarithms: http://www.claysturner.com/dsp/BinaryLogarithm.pdf http://www.cla
by foldr 3y ago
I think this is quite similar to Clay S Turner's algorithm for calculating binary logarithms:
http://www.claysturner.com/dsp/BinaryLogarithm.pdf http://www.claysturner.com/dsp/BinaryLogarithm.pdf
- mikewarot 3y agoI didn't follow the proof, but yes it is the same algorithm. It'll work for any integer base >= 2.
- foldr 3y agoYeah I remember that some of the notation in the proof confused me a bit too. I proved it to my satisfaction using a slightly different approach, but I don't remember it well enough to write it out. (I'm sure it's trivial for anyone with math chops, but I don't got them.)