113 search results - page 9 / 23 » An iterative logarithmic multiplier |
FCCM
2006
IEEE
14 years 5 months ago
2006
IEEE
We present an architecture and an implementation of an FPGA-based sparse matrix-vector multiplier (SMVM) for use in the iterative solution of large, sparse systems of equations ar...
IMCSIT
2010
13 years 8 months ago
2010
Abstract--Recently, we have introduced an approach to multicore computations on sparse matrices using recursive partitioning, called Recursive Sparse Blocks (RSB). In this document...
ISCAS
2011
IEEE
13 years 2 months ago
2011
IEEE
—A unified optimization framework is presented for simultaneous gate sizing and placement. These processes are unified using Lagrangian multipliers, which synchronize the efforts...
ASIACRYPT
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
MOC
2000
13 years 10 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...