This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
November 1975 (vol. 24 no. 11)
pp. 1049-1054
P.W. Baker, Department of Computer Science, School of Electrical Engineering, University of New South Wales
de Lugish [1] has defined efficient algorithms in radix 2 for certain elementary functions such as Y[X,Y/X1/2, 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. 11, pp. 1049-1054, Nov. 1975, doi:10.1109/T-C.1975.224132
Usage of this product signifies your acceptance of the Terms of Use.