Nth ROOT COMPUTING METHODS
Abstract
Five main classes of nth rooting methods are discussed. An nth rooting method derivable from the binomial series expansion is developed, and both restoring and nonrestoring versions are treated. For the special case of the binary square root, a nonrestoring version of this method using normalized remainders is simulated and a statistical timing distribution obtained. Other nth rooting methods discussed are a truncated series method, Euler iteration formulae, extensions of a square root method given by M. Nadler, Pade approximations and the log exponential method. A particular mechanization of the log and exponential functions developed by Cantor, Estrin, and Turn is compared timewise with the other nth rooting methods. Hardware and storage requirements are considered in all cases.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1963
- Accession Number
- AD0404716
Entities
People
- David F. Martin
Organizations
- University of California, Los Angeles