Accession Number:

AD0759545

Title:

Optimal Square-Rooting Algorithms for Hardware Implementation.

Descriptive Note:

Technical memo.,

Corporate Author:

TEXAS UNIV AUSTIN ELECTRONICS RESEARCH CENTER

Personal Author(s):

• Kim,Kwang Hae
• Ramamoorthy,C. V.

Report Date:

1972-12-06

Pagination or Media Count:

107.0

Abstract:

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

Descriptors:

• (*COMPUTER PROGRAMMING
• TRANSCENDENTAL FUNCTIONS)
• ALGEBRA
• ALGORITHMS
• ITERATIONS
• THESES

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE