3059 search results - page 286 / 612 » with Wide Functional Units |
163
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
167
click to vote
CASES
2009
ACM
15 years 10 months ago
2009
ACM
2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...
152
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
199
click to vote
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper addresses the design of multi-mode architectures for digital signal processing applications. We present a dedicated design flow and its associated high-level synthesis t...
213
Voted
ASAP
2004
IEEE
15 years 10 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...