Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit

Authors:
Tomás Lang;Paolo Montuschi
Affiliations:
Univ. of California at Irvine, Irvine, CA;Politecnico di Torino, Turin, Italy
Venue:
IEEE Transactions on Computers
Year:
1999

Citing 18
Cited 8

Design of a high-speed square root multiply and divide unit

IEEE Transactions on Computers
Module to perform multiplication, division, and square root in systolic arrays for matrix computations

Journal of Parallel and Distributed Computing
Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations

IEEE Transactions on Computers - Special issue on computer arithmetic
Higher Radix Square Root with Prescaling

IEEE Transactions on Computers - Special issue on computer arithmetic
Hardware Starting Approximation Method and Its Application to the Square Root Operation

IEEE Transactions on Computers
Design Issues in Division and Other Floating-Point Operations

IEEE Transactions on Computers
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification

IEEE Transactions on Computers
Division Algorithms and Implementations

IEEE Transactions on Computers
Division and Square Root: Digit-Recurrence Algorithms and Implementations

Division and Square Root: Digit-Recurrence Algorithms and Implementations
Simple Radix-4 Division with Operands Scaling

IEEE Transactions on Computers
Reducing Iteration Time When Result Digit is Zero for Radix 2 SRT Division and Square Root with Redundant Remainders

IEEE Transactions on Computers
Very-High Radix Division with Prescaling and Selection by Rounding

IEEE Transactions on Computers
High-Radix Division and Square-Root with Speculation

IEEE Transactions on Computers
Fast Evaluation of the Elementary Functions in Single Precision

IEEE Transactions on Computers
Division Using a Logarithmic-Exponential Transform to Form a Short Reciprocal

IEEE Transactions on Computers
Very-high radix combined division and square root with prescaling and selection by rounding

ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Symmetric Bipartite Tables for Accurate Function Approximation

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)

Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers

IEEE Transactions on Computers - Special issue on computer arithmetic
Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring

IEEE Transactions on Computers - Special issue on computer arithmetic
Boosting Very-High Radix Division with Prescaling and Selection by Rounding

IEEE Transactions on Computers
High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root

IEEE Transactions on Computers
Analysis of the impact of different methods for division/square root computation in the performance of a superscalar microprocessor

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
High-Radix Logarithm with Selection by Rounding: Algorithm and Implementation

Journal of VLSI Signal Processing Systems
Complex Square Root with Operand Prescaling

Journal of VLSI Signal Processing Systems
Mathematical model of stored logic based computation

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	14.99

Visualization

Abstract

An algorithm for square root with prescaling and selection by rounding is developed and combined with a similar scheme for division. Since division is usually more frequent than square root, the main concern of the combined implementation is to maintain the low execution time of division, while accepting a somewhat larger execution time for square root. The algorithm is presented in detail, including the mathematical development of bounds for the first square-root digit and for the scaling factor. The proposed implementation is described, evaluated and compared with other combined div/sqrt units. The comparisons show that the proposed scheme potentially produces a significant speed-up for division, whereas, for square root, the speed-up is small.