Sciweavers

229 search results - page 2 / 46
» Compaction Schemes with Minimum Test Application Time
Sort
View
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
13 years 10 months ago
Test compaction for transition faults under transparent-scan
Transparent-scan was proposed as an approach to test generation and test compaction for scan circuits. Its effectiveness was demonstrated earlier in reducing the test application ...
Irith Pomeranz, Sudhakar M. Reddy
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 6 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
13 years 9 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
VLSID
2005
IEEE
131views VLSI» more  VLSID 2005»
14 years 5 months ago
Efficient Space/Time Compression to Reduce Test Data Volume and Testing Time for IP Cores
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
Lei Li, Krishnendu Chakrabarty, Seiji Kajihara, Sh...
DATE
1999
IEEE
120views Hardware» more  DATE 1999»
13 years 9 months ago
FreezeFrame: Compact Test Generation Using a Frozen Clock Strategy
Test application time is an important factor in the overall cost of VLSI chip testing. We present a new ATPG approach for generating compact test sequences for sequential circuits...
Yanti Santoso, Matthew C. Merten, Elizabeth M. Rud...