Sciweavers

1795 search results - page 134 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICCD
2005
IEEE
135views Hardware» more  ICCD 2005»
14 years 5 months ago
Extended Forward Implications and Dual Recurrence Relations to Identify Sequentially Untestable Faults
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
Manan Syal, Rajat Arora, Michael S. Hsiao
AHS
2006
IEEE
124views Hardware» more  AHS 2006»
14 years 3 months ago
A Generic On-Chip Debugger for Wireless Sensor Networks
— This invited paper overviews the low level debug support hardware required for an on-chip predeployment debugging system for sensor networks. The solution provides significant...
Andrew B. T. Hopkins, Klaus D. McDonald-Maier
ICESS
2004
Springer
14 years 2 months ago
Relating FFTW and Split-Radix
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
Oleg Kiselyov, Walid Taha
PATMOS
2004
Springer
14 years 2 months ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
DATE
2010
IEEE
110views Hardware» more  DATE 2010»
14 years 2 months ago
Enabling efficient post-silicon debug by clustering of hardware-assertions
—Bug-free first silicon is not guaranteed by the existing pre-silicon verification techniques. To have impeccable products, it is now required to identify any bug as soon as the ...
Mohammad Hossein Neishaburi, Zeljko Zilic