A fast method for finding an integer square root

Abstract

ABSTUCE 17u3 paper describes a fmt algorithm for obtaining the square root of an unsigned integer. Although the algorithm is not a new one, it is much fmter than the popular Newton’s method. The theo~ suppotiing the operation of the algorithm is qlaine~ along with a discussion of the hardware implementation in the Ham”s RTX2000 series processors. Included are examples and details of programming the RTX2000 to pe~orm the algon”thnr.