Journal Article10.1109/TVLSI.2009.2024116
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Kanad Basu,Prabhat Mishra +1 more
TL;DR: A novel test data compression technique using bitmasks which provides a substantial improvement in the compression efficiency without introducing any additional decompression penalty is proposed.
read more
Abstract: Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requirements, but also an increase in testing time. Test data compression addresses this problem by reducing the test data volume without affecting the overall system performance. This paper proposes a novel test data compression technique using bitmasks which provides a substantial improvement in the compression efficiency without introducing any additional decompression penalty. The major contributions of this paper are as follows: 1) it develops an efficient bitmask selection technique for test data in order to create maximum matching patterns; 2) it develops an efficient dictionary selection method which takes into account the bitmask based compression; and 3) it proposes a test compression technique using efficient dictionary and bitmask selection to significantly reduce the testing time and memory requirements. We have applied our method on various test data sets and compared our results with other existing test compression techniques. Our algorithm outperforms existing dictionary-based approaches by up to 30%, giving a best possible test compression of 92%.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Trace Signal Selection for Post Silicon Validation and Debug
Kanad Basu,Prabhat Mishra +1 more
- 02 Jan 2011
TL;DR: This work proposes an approach that efficiently selects a set of signals based on total restorability criteria that can restore up to three times more signals compared to existing methods.
64
Efficient combination of trace and scan signals for post silicon validation and debug
Kanad Basu,Prabhat Mishra,Priyadarsan Patra +2 more
- 01 Sep 2011
TL;DR: This paper proposes an efficient algorithm to select a profitable combination of trace and scan signals to maximize the overall signal restoration performance and demonstrates that this approach can improve the signal restoration by 17% compared to the existing techniques.
30
Efficient Selection of Trace and Scan Signals for Post-Silicon Debug
TL;DR: This paper proposes a fine-grained architecture that addresses the limited observability of internal signals in manufactured chips using various scan chains with different dumping periods and proposes efficient algorithms to select beneficial signals based on this architecture.
28
Patent
Test Data Generation
Nikhil Girish Patwardhan,Ashim Roy,Moksha Suryakant Jivane,Varsha Jagtap,Eeti Sancheti,Nandita Babu +5 more
- 23 Mar 2012
TL;DR: In this paper, the authors described a test data generation method based on a selection criterion indicating a selected portion of the seed data to be transformed for at least a plurality of iterations to generate test data.
28
Input Test Data Compression Based on the Reuse of Parts of Dictionary Entries: Static and Dynamic Approaches
TL;DR: A new test data compression method for intellectual property (IP) cores testing, based on the reuse of parts of dictionary entries, is presented, supported with extensive simulation results and comparisons to already known testData compression methods suitable for IP cores testing.
27
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
15.4K
Introduction to Algorithms, 2nd edition.
TH Cormen,CE Leiserson,RL Rivest,Cliff Stein +3 more
- 01 Jan 2001
4K
System-on-a-chip test-data compression and decompression architectures based on Golomb codes
TL;DR: A new test-data compression method and decompression architecture based on variable-to-variable-length Golomb codes that is especially suitable for encoding precomputed test sets for embedded cores in a system-on-a-chip (SoC).