Sciweavers

624 search results - page 7 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
HASE
2008
IEEE
14 years 9 months ago
Randomization Based Probabilistic Approach to Detect Trojan Circuits
In this paper, we propose a randomization based technique to verify whether a manufactured chip conforms to its design or is infected by any trojan circuit. A trojan circuit can be...
Susmit Jha, Sumit Kumar Jha
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
15 years 3 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
DAC
2005
ACM
14 years 11 months ago
Response compaction with any number of unknowns using a new LFSR architecture
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
Erik H. Volkerink, Subhasish Mitra
89
Voted
EAAI
2007
103views more  EAAI 2007»
14 years 9 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
VTS
2007
IEEE
143views Hardware» more  VTS 2007»
15 years 3 months ago
RTL Test Point Insertion to Reduce Delay Test Volume
In this paper, a novel test point insertion methodology is presented for RTL designs that aims to reduce the data volume of scan-based transition delay tests. Test points are iden...
Kedarnath J. Balakrishnan, Lei Fang