By Topic

More Efficient Radix-2 Algorithms for Some Elementary Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Baker, P.W. ; 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 to about 1/3 of those required in conventional schemes [3]. This paper develops modified algorithms in radix 2 which are more efficient when the time for a full precision addition is comparable to the time for a shift and comparison. The modified procedure is developed for Y/X in detail where more than a 40 percent decrease in execution time is achieved for only a marginal increase in cost.

Published in:

Computers, IEEE Transactions on  (Volume:C-24 ,  Issue: 11 )