Radix-4 Square Rot Without Initial PLA
IEEE Transactions on Computers
IEEE Transactions on Computers
Approximating Elementary Functions with Symmetric Bipartite Tables
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on computer arithmetic
Division and Square Root: Digit-Recurrence Algorithms and Implementations
Division and Square Root: Digit-Recurrence Algorithms and Implementations
Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers
IEEE Transactions on Computers
Fast Evaluation of the Elementary Functions in Single Precision
IEEE Transactions on Computers
Function Evaluation by Table Look-up and Addition
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Faithful Bipartite ROM Reciprocal Tables
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
High-speed double precision computation of nonlinear functions
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Faithful Interpolation in Reciprocal Tables
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
Generating a Power of an Operand by a Table Look-up and a Multiplication
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
High-Speed Inverse Square Roots
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Floating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Series Approximation Methods for Divide and Square Root in the Power3(TM) Processor
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Correctly Rounded Reciprocal Square-Root by Digit Recurrence and Radix-4 Implementation
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
A Hardware Algorithm for Computing Reciprocal Square Root
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
| Hi-index | 14.98 |
In this work, we present a reciprocal square root algorithm by digit recurrence and selection by a staircase function and the radix-4 implementation. As in similar algorithms for division and square root, the results are obtained correctly rounded in a straightforward manner (in constrast to existing methods to compute the reciprocal square root). Although, apparently, a single selection function can only be used for j 2 (the selection constants are different for j=0, j=1, and j2), we show that it is possible to use a single selection function for all iterations. We perform a rough comparison with existing methods and we conclude that our implementation is a low hardware complexity solution with moderate latency, especially for exactly rounded results. We also extend the unit to support division and square root with the same selection function and with slight modifications in the initialization of the reciprocal square root unit.