Low Power Approximate Computation of Logarithm

Abstract

J. Napier first introduced logarithms in 1614. Many algorithms have evolved to compute logarithms. Several algorithms compute the approximate values of logarithms. The higher the complexity, the more power is required for computations. State-of-the-art algorithms compute logarithms in  O ├ ( log_2^2 (n)┤). We have introduced a method to calculate the approximate logarithm value (base 2) with the computational complexity of O(1). This indicates that the proposed algorithm requires very low power compared to the existing algorithms.

DOI: https://doi.org/10.52783/pst.497