Skip to main content
Log in

On Test Data Compression Using Selective Don’t-Care Identification

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper proposes an effective method for reducing test data volume under multiple scan chain designs. The proposed method is based on reduction of distinct scan vectors using selective don’t-care identification. Selective don’t-care identification is repeatedly executed under condition that each bit of frequent scan vectors is fixed to binary values (0 or 1). Besides, a code extension technique is adopted for improving compression efficiency with keeping decompressor circuits simple in the manner that the code length for infrequent scan vectors is designed as double of that for frequent ones. The effectiveness of the proposed method is shown through experiments for ISCAS’89 and ITC’99 benchmark circuits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kajihara S, Pomeranz I, Kinoshita K, Reddy S M. Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 1995, 14(12): 1496–1504.

    Google Scholar 

  2. Hamzaoglu I, Patel J H. Test set compaction algorithms for combinational circuits. In Proc. Int. Conf. Computer-Aided Design, 1998, pp.283–289.

  3. Jas A, Ghosh-Dastidar J, Touba N A. Scan vector compression/decompression using statistical coding. In Proc. 17th VLSI Test Symposium, 1999, pp.114–120.

  4. Hamzaoglu I, Patel J H. Reducing test application time for full scan embedded cores. In Proc. 29th Int. Symp. Fault-Tolerant Computing, 1999, pp.260–267.

  5. Bayraktaroglu I, Orailoglu A. Test volume and application time reduction through scan chain concealment. In Proc. 38th Design Automation Conference, 2001, pp.151–155.

  6. Chandra A, Chakrabarty K. Frequency-directed run-length (FDR) codes with application to system-on-a-chip test data compression. In Proc. 19th VLSI Test Symposium, 2001, pp.42–47.

  7. Ichihara H, Ogawa A, Inoue T, Tamura A. Dynamic test compression using statistical coding. In Proc. 10th Asian Test Symposium, 2001, pp.143–148.

  8. Volkerink E H, Khoche A, Mitra S. Packet-based input test data compression techniques. In Proc. Int. Test Conference, 2002, pp.154–163.

  9. Reddy S M, Miyase K, Kajihara S, Pomeranz I. On test data volume reduction for multiple scan chain designs. In Proc. 20th VLSI Test Symposium, 2002, pp.103–108.

  10. Li L, Chakrabarty K. Test data compression using dictionaries with fixed-length indices. In Proc. 21st IEEE VLSI Test Symposium, 2003, pp.219–224.

  11. Kajihara S, Miyase K. On identifying don’t care inputs of test patterns for combinational circuits. In Proc. Int. Conf. Computer-Aided Design, 2001, pp.364–369.

  12. Hayashi T, Morimoto Y, Shinogi T, Kita H, Takase H. X-Maximal test set generation for combinational circuits. In Proc. 3rd Workshop on RTL and High Level Testing, 2002, pp.88–93.

  13. Miyase K, Kajihara S, Pomeranz I, Reddy M. Don’t-care identification on specific bits of test patterns. In Proc. Int. Conf. Computer Design, 2002, pp.194–199.

  14. Davidson S et al. ITC’99 benchmark circuits — Preliminary results. In Proc. Int. Test Conf,. 1999, p.1125. (http://www.cad.polito.it/tools/itc99.html)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Terumine Hayashi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hayashi, T., Yoshioka, H., Shinogi, T. et al. On Test Data Compression Using Selective Don’t-Care Identification. J Comput Sci Technol 20, 210–215 (2005). https://doi.org/10.1007/s11390-005-0210-2

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0210-2

Keywords

Navigation