2449 search results - page 159 / 490 » VLSI |
108
click to vote
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
108
click to vote
GLVLSI
2005
IEEE
15 years 9 months ago
2005
IEEE
The ever-increasing number of transistors on a chip has resulted in very large scale integration (VLSI) systems whose performance and manufacturing costs are driven by on-chip wir...
90
Voted
DFT
2003
IEEE
15 years 9 months ago
2003
IEEE
Over the last years, an increasing number of safety-critical tasks have been demanded to computer systems. In this paper, a software-based approach for developing safety-critical
128
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...