The Community for Technology Leaders
Green Image
Issue No. 03 - March (1975 vol. 24)
ISSN: 0018-9340
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 = 2<sup>m</sup>. These algorithms are extensions of those iterative schemes which are based on multiplications by (1 + 2<sup>-i</sup>) and the use of prestored values of ln (1 + 2<sup>-i</sup>) and tan-1(2<sup>-i</sup>). The particular functions under
Continued products and sums, digital arithmetic, elementary functions, iterative algorithms, parallel m-bit multipliers.

P. Baker, "Parallel Multiplicative Algorithms for Some Elementary Functions," in IEEE Transactions on Computers, vol. 24, no. , pp. 322-325, 1975.
86 ms
(Ver 3.3 (11022016))