Fast Integer Square Root For 8051

CPallini

Rate me:

5.00/5 (7 votes)

28 Dec 2020CPOL2 min read

9.2K

Fast integer square root computation in 8051 assembly

In this tip, you will find an implementation of the "Fast Integer Square Root" algorithm (described by Ross M. Fossler in Microchip's TB040), in 8051 assembly.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

CPallini

Software Developer (Senior) Biotecnica Instruments S.p.A.

Italy

Debugging? Klingons do not debug. Our software does not coddle the weak. Bugs are good for building character in the user.
-- The Klingon programmer

Beelzebub for his friends [^].

Fast Integer Square Root For 8051

Views

Downloads

License

Comments and Discussions