A note on base-2 logarithm computations

1 January 1973

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE

Vol. 61 (10) , 1519-1520
https://doi.org/10.1109/PROC.1973.9318

Abstract

The well-known methods of iteration used suitably can yield a more accurate and rapidly convergent computation for the values of many functions. One typical example is the base-2 logarithm-antilogarithm computation. Some recently proposed techniques are reviewed and compared with an iterative process for computation using a fixed number of iterations. It is shown that the latter yields improved accuracy and can be implemented either as a subroutine or as a hardwired peripheral device for, say, a minicomputer.

Keywords

This publication has 5 references indexed in Scilit:

New Algorithms for the Approximate Evaluation in Hardware of Binary Logarithms and Elementary Functions
IEEE Transactions on Computers, 1972
Design of binary logarithm generators
Proceedings of the Institution of Electrical Engineers, 1968
Computation of the Base Two Logarithm of Binary Numbers
IEEE Transactions on Electronic Computers, 1965
Computer Multiplication and Division Using Binary Logarithms
IEEE Transactions on Electronic Computers, 1962
A Class of Non-Analytical Iterative Processes
The Computer Journal, 1959