loading...
Deterministic Test Vector Decompression in Software Using Linear Operations
Napa Valley, California April 27-May 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VTEST.2003.119765521st IEEE VLSI Test Symposium
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Kedarnath J. Balakrishnan, University of Texas
Nur A. Touba, University of Texas
A new software-based test vector compression technique is proposed for using an embedded processor to test the other components of a system-on-a-chip (SOC). The tester transfers compressed test data to the processor?s on-chip memory, and the processor executes a small program which decompresses the data and applies it to the scan chains of each core-under-test. The proposed decompression procedure uses word-based linear operations to expand the compressed test data into the corresponding deterministic test vectors. It has a number of nice features that overcome the drawbacks of software-based linear feedback shift register (LFSR) reseeding. The storage requirements for the proposed approach depend only on the total number of specified bits in the test set. There are no restrictions on static compaction or the test generation procedure as a whole. The decompression program can be easily reused for applying different test sets. Experimental results demonstrate that the proposed approach compares very favorably with all previously published results for software-based test vector decompression.
Citation:
Kedarnath J. Balakrishnan, Nur A. Touba, "Deterministic Test Vector Decompression in Software Using Linear Operations," vts, pp.225, 21st IEEE VLSI Test Symposium, 2003
Usage of this product signifies your acceptance of the Terms of Use.