531 search results - page 87 / 107 » Field-Programmable Gate Arrays |
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
APCSAC
2000
IEEE
15 years 2 months ago
2000
IEEE
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...
MICRO
2000
IEEE
15 years 2 months ago
2000
IEEE
Dynamic Zero Compression reduces the energy required for cache accesses by only writing and reading a single bit for every zero-valued byte. This energy-conscious compression is i...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
ISPD
1997
ACM
15 years 2 months ago
1997
ACM
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...