10718 search results - page 185 / 2144 » On the Circuit Implementation Problem |
139
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
148
click to vote
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
137
click to vote
ISVLSI
2002
IEEE
15 years 9 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
126
click to vote
FPGA
1997
ACM
15 years 8 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...