Hardware Starting Approximation Method and Its Application to the Square Root Operation
IEEE Transactions on Computers
IEEE Transactions on Computers
Division Algorithms and Implementations
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on computer arithmetic
High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
IEEE Transactions on Computers
Efficient implementation of constant coefficient division under quantization constraints
ICC'05 Proceedings of the 9th International Conference on Circuits
Modular array structure for non-restoring square root circuit
Journal of Systems Architecture: the EUROMICRO Journal
A goldschmidt division method with faster than quadratic convergence
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Mathematical model of stored logic based computation
Mathematical and Computer Modelling: An International Journal
Research paper: The saga of minimum spanning trees
Computer Science Review
| Hi-index | 0.01 |
Efficient initial approximations and fast converging algorithms are important to achieve the desired precision faster at lower hardware cost in multiplicative division and square root. In this paper, a new initial approximation method for division, an accelerated higher order converging division algorithm, and a new square root algorithm are proposed. They are all suitable for implementation on an arithmetic unit where one multiply-accumulate operation can be executed in one cycle. In the case of division, the combination of our initial approximation method and our converging algorithm enables a single iteration of the converging algorithm to produce double-precision quotients. Our new square root algorithm can form double-precision square roots faster using smaller look-up tables than the Newton-Raphson method.