44 search results - page 7 / 9 » Finite Field Multiplier Using Redundant Representation |
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
TC
1998
13 years 7 months ago
1998
—This paper describes a new signed-digit full adder (SDFA) circuit consisting of resonant-tunneling diodes (RTDs) and metal-oxide semiconductor field effect transistors (MOSFETs)...
PRL
2006
13 years 7 months ago
2006
With increasing interest in bioinformatics, sophisticated tools are required to efficiently analyze gene information. The classification of gene expression profiles is crucial in ...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...