Sciweavers

27 search results - page 1 / 6
» Parallel-Array Implementations of a Non-Restoring Square Roo...
Sort
View
ICCD
1997
IEEE
140views Hardware» more  ICCD 1997»
13 years 8 months ago
Parallel-Array Implementations of a Non-Restoring Square Root Algorithm
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQ...
Yamin Li, Wanming Chu
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 5 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
APCSAC
2000
IEEE
13 years 9 months ago
Cost/Performance Tradeoff of n-Select Square Root Implementations
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...
Wanming Chu, Yamin Li
FPL
2010
Springer
104views Hardware» more  FPL 2010»
13 years 2 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...
ARITH
1999
IEEE
13 years 9 months ago
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...
Marius A. Cornea-Hasegan, Roger A. Golliver, Peter...