
doi: 10.1109/12.102831
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. >
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 42 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
