10_test_compression_p6

10_test_compression_p6 - 1 K.T. Tim Cheng...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 K.T. Tim Cheng 10_test_compression, v1.0 Volume of Test Data Grows Linearly With Chip Size Huge size of test data Up to ~1KB test data per gate 1M gate IC requires 1GB test data # of IO grows much slower than that of gate count 10000 2 K.T. Tim Cheng 10_test_compression, v1.0 1 10 100 1000 10000 1 10 100 1000 10000 Gate count per chip (millions) Estimated test set size (GB) Test Storage and Test Application Time z Huge volume of stored test data z Excessively long test application time 120 3 K.T. Tim Cheng 10_test_compression, v1.0 20 40 60 80 100 0.01 0.1 1 10 Gate count per chip (millions) Test time vs chip size 100MHz ATE for 8 scan channels Test Data Compression Test Data Compression z Test data volume and test time reduction Test data volume and test time reduction z No functional logic modification such as test point No functional logic modification such as test point insertion insertion z Easy integration into existing design flows and Easy integration into existing design flows and compatibility with current ATE compatibility with current ATE 4 K.T. Tim Cheng 10_test_compression, v1.0 Ref: J. Rajski, et al., Embedded Deterministic Test, IEEE Trans. on CAD, May 2004 Test Stimulus Compression Techniques Test Stimulus Compression Techniques 1. Coding - Run-length codes, Golomb codes, LZ77, . Encode the test vectors and decode on-chip 2. LFSR reseeding Compression : Solving of linear equations Decompression : Compress a test cube into a seed, 5 K.T. Tim Cheng 10_test_compression, v1.0 reproduce the corresponding test cube while clocked for a number of cycles. 3. Continuous flow linear expansion Compression : Solving of linear equations Decompression : Compressed data are supplied in a continuous flow & decompressed by linear network LFSR Reseeding LFSR Reseeding z Periodically reseeding - The LFSR size has to be large enough to achieve low probability (<10-6 ) of not finding a seed One linear equation per FF...
View Full Document

This note was uploaded on 01/16/2012 for the course ECE 255a taught by Professor Timcheng during the Fall '11 term at UCSB.

Page1 / 4

10_test_compression_p6 - 1 K.T. Tim Cheng...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online