Please use this identifier to cite or link to this item: http://10.1.7.192:80/jspui/handle/123456789/6366
Title: A Stastical Test Data Compression Technique with Adaptive Bit Filling and AI Based Reordering: Optimization for Compression and Scan Power
Authors: Parmar, Harikrishna
Mehta, Usha
Keywords: Test Data Compression
Scan-in-&-Scan-Out Power
Test Vector Reordering
Adaptive Weighted Transition Matrix (AWTM)
Artificial Intelligence (AI)
Selective Huffman Coding (MSHuffman)
Don’t Care Bit Filling
EC Faculty Paper
Faculty Paper
ITFEC010
Issue Date: May-2011
Series/Report no.: ITFEC010-21;
Abstract: Test power and test time have been the major issues for current scenario of VLSI testing. The hidden structure of IP cores in SoC has further exacerbated these problems. The test data compression is the well known method used to reduce the test time. The don’t care bit filling method and test vector reordering method can be used for effective test data compression as well as reduction in scan power. In this paper, in beginning, the mixed approach adaptive algorithm for don’t care bit filling is proposed which is developed to enhance both parameters i.e. the power reduction and compression ratio. After the bit filling, the vectors are reordered using Artificial Intelligence approach. The quality parameter used for reordering is Adaptive Weighted Transition Matrix (AWTM) considering both, scan-in-&-scan-out vectors. The modified selective Huffman coding is applied on the reordered vector set to give the optimum compression. The experimental results on ISCAS benchmark circuit proves that the proposed method gives the better compression as well as better power reduction.
Description: International Journal of VLSI and Signal Processing Applications, Vol. 1 (2),May, 2011, Page No. 15 - 24
URI: http://hdl.handle.net/123456789/6366
ISSN: 2231 - 3133
Appears in Collections:Faculty Papers, EC

Files in This Item:
File Description SizeFormat 
ITFEC010-21.pdfITFEC010-21534.79 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.