The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1992 vol.41)
pp: 996-1009
ABSTRACT
<p>A scheme for performing higher radix square root based on prescaling of the radicand is presented to reduce the complexity of the result-digit selection. The scheme requires several steps, namely multiplication for prescaling the radicand, square root, multiplication for prescaling for the division, and division. Online algorithms are used to reduce the overall time and pipelining to reuse the different modules. An estimate of the execution time for a radix-256 unit for double-precision square root and a comparison with other implementations indicate that the proposed approach is an alternative to consider when designing a square-root unit.</p>
INDEX TERMS
online algorithms; higher radix square root; prescaling; radicand; complexity; result-digit selection; multiplication; division; pipelining; double-precision square root; digital arithmetic; dividing circuits; multiplying circuits; number theory.
CITATION
T. Lang, P. Montuschi, "Higher Radix Square Root with Prescaling", IEEE Transactions on Computers, vol.41, no. 8, pp. 996-1009, August 1992, doi:10.1109/12.156542
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool