Journal Press India^®

Author Details ( * ) denotes Corresponding author

Test vector compression is an emerging trend in the field of VLSI testing. According to these trends, increasing test data volume is one of the biggest challenges in the testing industry. The overall throughput of automatic test equipment (ATE) is sensitive to the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. But this tester has limited speed, memory and I/O channels. The test data bandwidth between the tester and the chip is small which is the bottleneck in determining how fast the testing process. To overcome these limitations of the Automatic Test Equipment (ATE), a new hybrid test vector compression technique is proposed. the large volume of test data input is compressed in a hybrid fashion before being downloaded into the processor and the test compression ratio is increased and is experimentally verified with the benchmark circuits.

Keywords

Automatic Test Equipment; Data Compression; Golomb Coding.

1. R Merkle. Secure communication over an insecure channel, Communications of the ACM.


2. D Kahn. The Codebreakers, The Story of Secret Writing. New York: Macmillan, 1967.


3. CE Shannon. Communication theory of secrecy systems, Bell Syst. Tech. J., 28(8), 1949, 656–715.


4. ME Hellman. An extension of the Shannon theory approach to cryptography. IEEE Trans..


5. HF Gaines. Cryptanalysis, 1939, Dover. ISBN 0-486-20097-3 .


6. Asinkov. Elementary Cryptanalysis: A Mathematical Approach, Mathematical Association of America, ISBN 0-88385-622-0,1966.


7. S Kwong, YF Ho. A Statistical Lempel- Ziv Compression Algorithm for Personal Digital Assistant (PDA), IEEE Transactions on Consumer Electronics, 47(1), 2001.


8. L Li, K Chakrabarty. Test Data Compression Using Dictionaries with Fixed-Length Indices, Proceedings of the 21st IEEE VLSI Test Symposium (VTS.03).


9. PG Howard, JS Vitter. Practical Implementations of Arithmetic Coding, Providence, R.I. 02912-1910.


10. S Yang. P Qiu. Efficient Integer Coding for Arbitrary Probability Distributions, IEEE Transactions On Information Theory, 52(8), 2006.


11. P Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21(2), 1975, 194-203.


12. J Walder, M Kratky, J Platos. Fast Fibonacci Encoding Algorithm, Dateso, 72-83, ISBN 978-80-7378-116-3, 2010.


13. ST Klein, MKB Nissan. On the Usefulness of Fibonacci Compression Codes, Computer Journal, 2005.


14. X Kavousianos, E Kalligeros, D Nikolos. Multilevel-Huffman test-data compression for IP cores with multiple scan chains, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16(7), 2008.


15. Jas, NA Touba. Test Vector Compression via Cyclical Scan Chains and Its Application to Testing Core-Based Designs, Proc. Int’l Test Conf. (ITC 98), IEEE CS Press, 1998, 458- 464.


16. Chandra, K Chakrabarty. Test Data Compression for System-on-Chip Using Golomb Codes, VTS '00: Proceedings of the 18th IEEE VLSI Test Symposium, 2000.