TImothy J. Rolfe
Abstract
The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.
Index Terms
- On a fast integer square root algorithm
Recommendations
Decimal SRT Square Root: Algorithm and Architecture
Given the popularity of decimal arithmetic, hardware implementation of decimal operations has been a hot topic of research in recent decades. Besides the four basic operations, the square root can be implemented as an instruction directly in the ...
Decimal Square Root: Algorithm and Hardware Implementation
We propose a new digit recurrence decimal square root (DSR) design and provide its ASIC implementation. The interim square root digits are in $$[ {-5,5} ]$$[-5,5]. The proposed architecture generally follows that of a previous radix-10 divider. However, ...
Proposed low power, high speed adder-based 65-nm Square root circuit
This paper focuses on the design of a 1-bit full adder circuit using Shannon's theorem and adder-based non-Restoring and Restoring Square Rooter circuits. The proposed adder and Square Rooter schematics were developed using DSCH2 CAD tool, and their ...
Comments