An algorithm for the computation of binary logarithms

The author presents a simple algorithm for the computation of the base-2 logarithm of a given binary number. The concept can be easily extended to base-N. Unlike other methods, this is not a curve fitting of the base-2 logarithm of a given binary number. The algorithm constitutes a simple step-by-step, bit-by-bit, computation of the logarithm of binary numbers. It can be easily implemented in simple microcode, and offers precision that is proportional to the number of performed iterations. Thus, it asymptotically converges to the true logarithm of the given number.<
>