Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[CARTE][B] Delay fault testing for VLSI circuits
A Krstic, KTT Cheng - 1998 - books.google.com
With the ever-increasing speed of integrated circuits, violations of the performance
specifications are becoming a major factor affecting the product quality level. The need for …
specifications are becoming a major factor affecting the product quality level. The need for …
FIRE: A fault-independent combinational redundancy identification algorithm
MA Iyer, M Abramovici - IEEE transactions on very large scale …, 1996 - ieeexplore.ieee.org
FIRE is a novel Fault-Independent algorithm for combinational REdundancy identification.
The algorithm is based on a simple concept that a fault which requires a conflict as a …
The algorithm is based on a simple concept that a fault which requires a conflict as a …
Static logic implication with application to redundancy identification
JK Zhao, EM Rudnick, JH Patel - Proceedings. 15th IEEE VLSI …, 1997 - ieeexplore.ieee.org
This paper presents a new static logic implication algorithm. An improved implication
procedure that fully takes advantage of the special context of static implication, the iterative …
procedure that fully takes advantage of the special context of static implication, the iterative …
Combinational ATPG theorems for identifying untestable faults in sequential circuits
VD Agrawal, ST Chakradhar - IEEE Transactions on Computer …, 1995 - ieeexplore.ieee.org
We give two theorems for identifying untestable faults in sequential circuits. The first, the
single-fault theorem, states that if a single fault in a combinational array is untestable then …
single-fault theorem, states that if a single fault in a combinational array is untestable then …
Two-level logic minimization
This chapter presents both exact and heuristic two-level logic minimization algorithms. For
exact logic minimization, it shows various techniques to reduce the complexity of covering …
exact logic minimization, it shows various techniques to reduce the complexity of covering …
[PDF][PDF] Identifying sequential redundancies without search
MA Iyer, DE Long, M Abramovici - … of the 33rd annual Design Automation …, 1996 - dl.acm.org
Previous solutions to the difficult problem of identifying sequential redundancy are either
based on incorrect theoretical results, or rely on unrealistic simplifying assumptions, or are …
based on incorrect theoretical results, or rely on unrealistic simplifying assumptions, or are …
Efficient BIST TPG design and test set compaction via input reduction
CA Chen, SK Gupta - … on Computer-Aided Design of Integrated …, 1998 - ieeexplore.ieee.org
A new technique called input reduction is proposed for built-in self test (BIST) test pattern
generator (TPG) design and test set compaction. This technique analyzes the circuit function …
generator (TPG) design and test set compaction. This technique analyzes the circuit function …
Iterative simulation-based genetics+ deterministic techniques= complete ATPG
Simulation-based test vector generators require much less computer time than deterministic
ATPG but they generate longer test sequences and sometimes achieve lower fault …
ATPG but they generate longer test sequences and sometimes achieve lower fault …
Shielding logic locking from redundancy attacks
The security of logic locking has been extensively examined under the threat model that
assumes the availability of an activated IC. Recently, structural attacks such as ones based …
assumes the availability of an activated IC. Recently, structural attacks such as ones based …
A methodology to design efficient BIST test pattern generators
CA Chen, SK Gupta - Proceedings of 1995 IEEE International …, 1995 - ieeexplore.ieee.org
This paper describes a new technique to design efficient test pattern generators (TPGs) for
built-in self-test (BIST). The proposed technique identifies compatible circuit inputs that can …
built-in self-test (BIST). The proposed technique identifies compatible circuit inputs that can …