27 search results - page 3 / 6 » Parallel-Array Implementations of a Non-Restoring Square Roo... |
WIOPT
2006
IEEE
13 years 11 months ago
2006
IEEE
— We explore the advantages of intelligently dropping a small fraction of packets that arrive for transmission over a time varying wireless downlink. Without packet dropping, the...
ASAP
2004
IEEE
13 years 9 months ago
2004
IEEE
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...
TC
2008
13 years 5 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
TPHOL
2007
IEEE
14 years 1 days ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
DCC
2007
IEEE
14 years 5 months ago
2007
IEEE
In this contribution, we derive a novel parallel formulation of the standard Itoh-Tsujii algorithm for multiplicative inverse computation over GF(2m). The main building blocks use...