A fast floating-point square-rooting routine for the 8080/8085 microprocessors

Abstract

Square-root is a function for which numerous numerical methods have been developed. In most math packages for microprocessors, simple iterative methods have been used, as no special demands for speed — nor even for accuracy in some cases are expected: e.g. in [ l ] and [2] the execution time of square-rooting is approx. 2-5 times longer than that of… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics