522 search results - page 10 / 105 » Fast Smith-Waterman hardware implementation |
ARC
2007
Springer
14 years 1 months ago
2007
Springer
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
CTRSA
2001
Springer
14 years 5 days ago
2001
Springer
The results of fast implementations of all five AES final candidates using Virtex Xilinx Field Programmable Gate Arrays are presented and analyzed. Performance of several alternati...
ASAP
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper examines the architecture, algorithm and implementation of a switch-based multi-processor realization of the fast Fourier transform (FFT). The architecture employs M pr...
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Hardware implementations of Spiking Neural Networks are numerous because they are well suited for implementation in digital and analog hardware, and outperform classic ...