loading...
Packet-Based Input Test Data Compression Techniques
Baltimore, MD, USA October 07-October 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TEST.2002.1041756International Test Conference 2002 (I ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Erik H. Volkerink, Stanford University and Agilent Laboratories
Ajay Khoche, Agilent Laboratories
Subhasish Mitra, Intel Corporation
This paper presents a test input data compression technique, which can be use to reduce input test data volume, test time, and the number of required tester channels. The technique is based on grouping data packets and applying various binary encoding techniques, such as Huffman codes and Golomb-Rice codes. Experiments on actual industrial designs and benchmark circuits show an input vector data reduction ranging from 17x to 70x.
Index Terms:
Compression, RLE, Huffman, Golomb-Rice, LFSR, BIST, ATE, EDA
Citation:
Erik H. Volkerink, Ajay Khoche, Subhasish Mitra, "Packet-Based Input Test Data Compression Techniques," itc, pp.154, International Test Conference 2002 (ITC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.