A study of methods for selection of quotient digits during digital division
A study of methods for selection of quotient digits during digital division
The ILLIAC IV Processing Element
IEEE Transactions on Computers
A unified algorithm for elementary functions
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
IEEE Transactions on Computers
IBM Journal of Research and Development
Automatic computation of exponentials, logarithms, ratios and square roots
IBM Journal of Research and Development
Pseudo division and pseudo multiplication processes
IBM Journal of Research and Development
Elimination the normalization problem in digit on-line arithmetic
IEEE Transactions on Computers
Parallel Multiplicative Algorithms for Some Elementary Functions
IEEE Transactions on Computers
More Efficient Radix-2 Algorithms for Some Elementary Functions
IEEE Transactions on Computers
A Survey of Some Recent Contributions to Computer Arithmetic
IEEE Transactions on Computers
Error-free algorithm and architecture of radix-10 logarithmic converter
Computers and Electrical Engineering
Floating-Point Exponentiation Units for Reconfigurable Computing
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
VLIW coprocessor for IEEE-754 quadruple-precision elementary functions
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 15.00 |
This paper describes a family of algorithms for evaluation of a class of elementary functions including division, logarithms, and exponentials. The main objective is to demonstrate the feasibility of higher radix implementations, in particular, radix 16, and to compare performance with radix 2. The emphasis is not on optimality of a single algorithm, but rather on the optimality of a class of algorithms. An attempt to implement a much wider class of functions than is presently done in arithmetic units is encouraged by the current level of digital technology and the existence of suitable algorithms. Besides the definitions of the algorithms, which are based on continued products and continued sums, details related to implementation are discussed.