Parallel Multiplicative Algorithms for Some Elementary Functions

  • Authors:

  • P. W. Baker

  • Affiliations:

  • Department of Computer Science, School of Electrical Engineering, University of New South Wales

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1975

Quantified Score

Hi-index 14.98

Visualization

Abstract

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