Sciweavers

229 search results - page 3 / 46
» Compaction Schemes with Minimum Test Application Time
Sort
View
DATE
2002
IEEE
135views Hardware» more  DATE 2002»
14 years 1 days ago
Reducing Test Application Time Through Test Data Mutation Encoding
In this paper we propose a new compression algorithm geared to reduce the time needed to test scan-based designs. Our scheme compresses the test vector set by encoding the bits th...
Sherief Reda, Alex Orailoglu
DCC
2008
IEEE
14 years 6 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
WWW
2007
ACM
14 years 7 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
ICCAD
2002
IEEE
85views Hardware» more  ICCAD 2002»
14 years 1 days ago
On undetectable faults in partial scan circuits
We study the undetectable faults in partial scan circuits under a test application scheme referred to as transparent-scan. The transparent-scan approach allows very aggressive tes...
Irith Pomeranz, Sudhakar M. Reddy
ATS
2000
IEEE
145views Hardware» more  ATS 2000»
13 years 11 months ago
Compaction-based test generation using state and fault information
We present a new test generation procedure for sequential circuits using newly traversed state and newly detected fault information obtained between successive iterations of vecto...
Ashish Giani, Shuo Sheng, Michael S. Hsiao, Vishwa...