Skip to main content
Log in

Test Resource Partitioning Based on Efficient Response Compaction for Test Time and Tester Channels Reduction

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

Abstract

This paper presents a test resource partitioning technique based on an efficient response compaction design~called quotient compactor(q-Compactor). Because q-Compactor is a single-output compactor, high compaction ratios can be obtained even for chips with a small number of outputs. Some theorems for the design of q-Compactor are presented~to achieve full diagnostic ability, minimize error cancellation and handle unknown bits in the outputs of the circuit under test (CUT). The q-Compactor can also be moved to the load-board, so as to compact the output response of the CUT even during functional testing. Therefore, the number of tester channels required to test the chip is significantly reduced. The experimental results on the ISCAS ‘89 benchmark circuits and an MPEG 2 decoder SoC show that the proposed compaction scheme is very efficient.

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.

Similar content being viewed by others

References

  1. Mitra S, Kim K S. X-compact: An efficient response compaction technique for test cost reduction. In Proc. International Test Conference, Baltimore, USA, 2002, pp.311–320.

  2. Chandra A, Chakrabarty K. Test resource partitioning for SoCs. IEEE Design & Test of Computers, 2001, 18(9): 80–91.

    Google Scholar 

  3. Reda S, Orailoglu A. Reducing test application time through test data mutation encoding. In Proc. Design of Automation and Test in Europe (DATE), Paris, France, 2002, pp.387–393.

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

  5. Nourani M, Chin J. Testing high-speed SoCs using low-speed ATEs. In Proc. VLSI Test Symposium, Monterey, USA, 2002, pp.133–138.

  6. Saluja K K, Karpovsky M. Testing computer hardware through data compression in space and time. In Proc. Int. Test Conference, Philadelphia, USA, 1983, pp.83–88.

  7. Bhattacharya B B, Dmitriev A, Goessel M, Chakrabarty K. Synthesis of single-output space compactor for scan-based sequential circuits. IEEE Trans. CAD & CS, 2002, 21(10): 1171–1179.

    Google Scholar 

  8. Chakrabarty K, Murray B T, Hayes J P. Optimal zero-aliasing space compaction of test response. IEEE Trans. Computers, 1998, 47(11): 1171–1187.

    Google Scholar 

  9. Li Y K, Robinson J P. Space compression methods with output data modification. IEEE Trans. CAD & CS, 2002, 1998, 6(3): 290–294.

    Google Scholar 

  10. Ivanov A, Tsuji B, Zorian Y. Programmable space compactors for BIST. IEEE Trans. Computers, 1996, 45(12): 1393–1405.

    Google Scholar 

  11. Barnhart C, Brunkhorst V, Distler F, et al. Extending OPMISR beyond 10× scan test efficiency. IEEE Design & Test of Computers, 2002, 19(5): 65–73.

    Google Scholar 

  12. Wohl P, Waicukauski J A, Williams T W. Design of compactors for signature-analyzers in Built-In Self-Test. In Proc. Int. Test Conference, Baltimore, USA, 2001, pp.54–63.

  13. Rajski J, Tyszer J, Wang C, Reddy S M. Convolutional compaction of test response. In Proc. Int. Test Conference, Charlotte, USA, 2003, pp.745–754

  14. Wohl P, Waicukauski J A, Patel S, Maston G. Effective diagnostics through interval unloads in a BIST environment. In Proc. Design Automation Conference, New Orleans, USA, 2002, pp.249–254.

  15. Brualdi R A. Introductory Combinatorics. Third Edition. Pearson Education, Inc., 1999.

  16. Bardell P H, McAnney W H, Savir J. Built-In Test for VLSI: Pseudorandom Techniques. John Wiley & Sons, 1987.

  17. Pomerantz I, Kundu S, Reddy S M. On output response compression in the presence of unknown output values. In Proc. Design Automation Conference, New Orleans, USA, 2002, pp.255–258.

  18. Cullen C G. Algebra with Applications. Addison-Wesley, ISBN-0-673-99386-8, 1997.

  19. Hamzaoglu I, Patel J H. Test set compaction algorithms for combinational circuits. In Proc. Int. Test Conference, Washington, USA, 1998, pp.283–289.

  20. Lee H K, Ha D S. On the generation of test patterns for combinational circuits. Tech. Report No.12-93, Department of Electrical Engineering, Virginia Tech.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yin-He Han.

Additional information

This paper is supported by the National Natural Science Foundation of China under Grants No.90207002 and No.60242001, the Sci. & Technol. Project of Beijing under Grant No.H020120120130, and~the Foundation of Institute of Computing Technology, CAS, under Grant No. 20036160. Anshuman Chandra is supported by Synopsys Corporation. This manuscript is based on the authors’ paper that appeared in Proceedings of Asian Test Symposium,Xi’an, Nov., 2003. pp.440-445.

Yin-He Han received his B. Eng. from Nanjing University of Aeronautics and Astronautics (China) in 1997. He is now a Ph.D. candidate in computer science at Institute of Computing Technology, Chinese Academy of Sciences. His research interests include VLSI/Soc design, design for testability. He is a student member of IEEE. He received Best Paper Award of Asian Test Symposium 2003, the IEEE Test Technology Technical Council.

Xiao-Wei Li received his B.Eng. and M.Eng. degrees in computer science from Hefei University of Technology (China) in 1985 and 1988 respectively, and his Ph.D. degree in computer science from Institute of Computing Technology, Chinese Academy of Sciences, in 1991. Dr. Li joined Peking University as a postdoctoral research associate in 1991, and was promoted to associate professor in 1993, all with the Department of Computer Science and Technology. From 1997 to 1998, he was a visiting research fellow in the Department of Electrical and Electronic Engineering at the University of Hong Kong. In 1999 and 2000, he was a Visiting Professor in the Graduate School of Information Science, Nara Institute of Science and Technology, Japan. He joined Institute of Computing Technology, Chinese Academy of Sciences, as a professor in 2000. His research interests include VLSI/Soc design verification and test generation, design for testability, low-power design, dependable computing. Dr. Li received the Natural Science Award from Chinese Academy of Sciences in 1992, the Certificate of Appreciation from IEEE Computer Society in 2001. He is a senior member of IEEE. He is an area editor of the Journal of Computer Science and Technology and an associate editor-in-chief of the Journal of Computer-Aided Design & Computer Graphics (in Chinese).

Hua-Wei Li received her B.S. degree in computer science from Xiangtan University (China) in 1996, and M.S. and Ph.D. degrees from Institute of Computing Technology, Chinese Academy of Sciences, in 1999 and 2001 respectively. She is now an associate professor at the Institute of Computing Technology, Chinese Academy of Sciences. Her research interests include VLSI/SoC design verification and test generation, delay test, and dependable computing. She is a member of IEEE.

Anshuman Chandra received his B.Eng. degree in electrical engineering from the University of Roorkee, Roorkee, India, and his M.S. and Ph.D. degrees in electrical and computer engineering from Duke University respectively. Now he is a senior DFT consultant of Synopsis, Inc., Mountain View, CA. His research interests include VLSI design, digital testing, and computer architecture. Mr. Chandra is a member of the ACM SIGDA. He received the Test Technology Technical Council James Beausang Student Paper Award for a paper in Proc. 2000 IEEE VLSI Test Symposium and Best Paper Award at DATE 2001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Han, YH., Li, XW., Li, HW. et al. Test Resource Partitioning Based on Efficient Response Compaction for Test Time and Tester Channels Reduction. J Comput Sci Technol 20, 201–209 (2005). https://doi.org/10.1007/s11390-005-0201-3

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0201-3

Keywords

Navigation