Issue No. 11 - November (1975 vol. 24)

ISSN: 0018-9340

pp: 1049-1054

P.W. Baker , Department of Computer Science, School of Electrical Engineering, University of New South Wales

ABSTRACT

de Lugish [1] has defined efficient algorithms in radix 2 for certain elementary functions such as Y[X,Y/X<sup>1/2</sup>, Y + lnX, Y.exp (X), etc. His technique requires a systematic 1-bit left shift of a partially converged result, together with two 4-bit comparisons to select a ternary digit for the next iteration. This selection of digits reduces the average number of full precision additions t

INDEX TERMS

Digital arithmetic, elementary functions, iterative algorithms, radix 2, variable left shift.

CITATION

P.W. Baker, "More Efficient Radix-2 Algorithms for Some Elementary Functions",

*IEEE Transactions on Computers*, vol. 24, no. , pp. 1049-1054, November 1975, doi:10.1109/T-C.1975.224132