Sciweavers

199 search results - page 7 / 40
» A Hardware Algorithm for Integer Division
Sort
View
AICCSA
2001
IEEE
177views Hardware» more  AICCSA 2001»
15 years 6 months ago
On a Parallel Extended Euclidean Algorithm
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
Sidi Mohamed Sedjelmaci
94
Voted
ASAP
2004
IEEE
99views Hardware» more  ASAP 2004»
15 years 6 months ago
Complex Square Root with Operand Prescaling
We propose a radix-r digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This lea...
Milos D. Ercegovac, Jean-Michel Muller
ARITH
1999
IEEE
15 years 6 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
TAPSOFT
1995
Springer
15 years 5 months ago
Anatomy of the Pentium Bug
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
Vaughan R. Pratt
119
Voted
ASAP
2008
IEEE
96views Hardware» more  ASAP 2008»
15 years 8 months ago
Integer and floating-point constant multipliers for FPGAs
Reconfigurable circuits now have a capacity that allows them to be used as floating-point accelerators. They offer massive parallelism, but also the opportunity to design optimi...
Nicolas Brisebarre, Florent de Dinechin, Jean-Mich...