Optimal Square-Rooting Algorithms for Hardware Implementation.
TEXAS UNIV AUSTIN ELECTRONICS RESEARCH CENTER
Pagination or Media Count:
The main objective of this thesis is the comprehensive analysis and synthesis with the hardwired square-rooting, believed to be the first subject to be implemented among various functions which are being evaluated mostly in software at present. Two new efficient algorithms for hardwired square-rooting, here called the algorithm G and algorithm T, have been developed and presented in the most detail. These use multiplication and no division. Furthermore, algorithm G possesses the property of quadratic convergence, a very important one for the machine of large word length as far as speed is concerned. Algorithm T is suitable for the machine of medium word length. Author Modified Abstract
- Computer Programming and Software