This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Multiplicative Algorithms for Some Elementary Functions
March 1975 (vol. 24 no. 3)
pp. 322-325
P.W. Baker, Department of Computer Science, School of Electrical Engineering, University of New South Wales
This correspondence presents generalized higher radix algorithms for some elementary functions which use fast parallel m-bit multipliers where radix = 2m. These algorithms are extensions of those iterative schemes which are based on multiplications by (1 + 2-i) and the use of prestored values of ln (1 + 2-i) and tan-1(2-i). The particular functions under
Index Terms:
Continued products and sums, digital arithmetic, elementary functions, iterative algorithms, parallel m-bit multipliers.
Citation:
P.W. Baker, "Parallel Multiplicative Algorithms for Some Elementary Functions," IEEE Transactions on Computers, vol. 24, no. 3, pp. 322-325, March 1975, doi:10.1109/T-C.1975.224215
Usage of this product signifies your acceptance of the Terms of Use.