Sciweavers

1795 search results - page 332 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
GLVLSI
2002
IEEE
108views VLSI» more  GLVLSI 2002»
14 years 2 months ago
Protected IP-core test generation
Design simplification is becoming necessary to respect the target time-to-market of SoCs, and this goal can be obtained by using predesigned IP-cores. However, their correct inte...
Alessandro Fin, Franco Fummi
ISCA
2002
IEEE
91views Hardware» more  ISCA 2002»
14 years 2 months ago
Slack: Maximizing Performance Under Technological Constraints
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
Brian A. Fields, Rastislav Bodík, Mark D. H...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 2 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
HYBRID
1999
Springer
14 years 2 months ago
An Overview of Hybrid Simulation Phenomena and Their Support by Simulation Packages
Continuous system dynamics can be described by, possibly large, systems of di erential equations. These can be either ordinary di erential equations (ODEs) or contain algebraic con...
Pieter J. Mosterman
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
14 years 2 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo