Sciweavers

624 search results - page 13 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
DATE
2008
IEEE
102views Hardware» more  DATE 2008»
15 years 4 months ago
A New Approach for Combining Yield and Performance in Behavioural Models for Analogue Integrated Circuits
A new algorithm is presented that combines performance and variation objectives in a behavioural model for a given analogue circuit topology and process. The tradeoffs between per...
Sawal Ali, Reuben Wilcock, Peter R. Wilson, Andrew...
75
Voted
ISAAC
2007
Springer
131views Algorithms» more  ISAAC 2007»
15 years 3 months ago
On the Fault Testing for Reversible Circuits
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
68
Voted
DAC
2003
ACM
15 years 2 months ago
NORM: compact model order reduction of weakly nonlinear systems
This paper presents a compact Nonlinear model Order Reduction Method (NORM) that is applicable for time-invariant and time-varying weakly nonlinear systems. NORM is suitable for r...
Peng Li, Lawrence T. Pileggi
65
Voted
CSR
2007
Springer
15 years 3 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 9 months ago
Heuristic approach to optimize the number of test cases for simple circuits
In this paper a new solution is proposed for testing simple stwo stage electronic circuits. It minimizes the number of tests to be performed to determine the genuinity of the circ...
S. M. Thamarai, K. Kuppusamy, T. Meyyappan