Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Increasing Embedding Probabilities of RPRPs in RIN Based BIST

  • Conference paper
Advances in Computer Systems Architecture (ACSAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3740))

Included in the following conference series:

  • 1075 Accesses

Abstract

In this paper, we propose a new clustered reconfigurable interconnect network (CRIN) BIST to improve the embedding probabilities of random-pattern-resistant-patterns. The proposed method uses a scan-cell reordering technique based on the signal probabilities of given test cubes and specific hardware blocks that increases the embedding probabilities of care bit clustered scan chain test cubes. We have developed a simulated annealing based algorithm that maximizes the embedding probabilities of scan chain test cubes to reorder scan cells, and an iterative algorithm for synthesizing the CRIN hardware. Experimental results demonstrate that the proposed CRIN BIST technique achieves complete fault coverage with lower storage requirement and shorter testing time in comparison with a previous method.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bardell, P.H., Mcanney, W., Savir, J.: Built-in Test for VLSI: Pseudo-Random Technique. Wiley, New York (1987)

    Google Scholar 

  2. Agrawal, V.D., Kime, C.R., Saluja, K.K.: A tutorial on built-in self-test part 1: principles. IEEE Design & Test of Computers 10, 73–82 (1993)

    Article  Google Scholar 

  3. Agrawal, V.D., Kime, C.R., Saluja, K.K.: A tutorial on built-in self-test part 1: applications. IEEE Design & Test of Computers 10, 69–77 (1993)

    Article  Google Scholar 

  4. Briers, A.J., Totton, K.A.E.: Random Pattern Testability by Fast Fault Simulation. In: Proc. of IEEE Int. Test Conf., pp. 274–281 (1986)

    Google Scholar 

  5. Savaria, Y., Youssef, M., Kaminska, B., Koudil, M.: Automatic Test Point Insertion for Pseudo-Random Testing. In: Proc. of IEEE Int. Symp. Circuit and Systems, pp. 1960–1963 (1991)

    Google Scholar 

  6. Waicukauski, J.A., Lindbloom, E., Eichelberger, E.B., Forlenza, O.P.: A Method for Generating Weighted Random Patterns. IBM Journal of Research and Development. 33, 149–161 (1989)

    Article  Google Scholar 

  7. Kim, H.S., Lee, J.K., Kang, S.: A Heuristic for Multiple Weight Set Generation. In: Proc. of IEEE Int. Test Conf., pp. 513–514 (2001)

    Google Scholar 

  8. Hellebrand, S., Rajski, J., Tarnick, S., Courtois, B.: Built-in test for circuits with scan based on reseeding of multiple-poly-nomial linear feedback shift registers. IEEE Trans. Computers 44, 223–233 (1995)

    Article  MATH  Google Scholar 

  9. Krishna, C.V., Jas, A., Touba, N.A.: Test vector encoding using partial LFSR reseeding. In: Proc. of IEEE Int. Test Conf., pp. 885–893 (2001)

    Google Scholar 

  10. Kalligeros, E., Kavousianos, X., Nikolos, D.: A ROMless LFSR reseeding scheme for scan-based BIST. In: Proc. of 11th Asian Test Symp., pp. 206–211 (2002)

    Google Scholar 

  11. Kim, H.S., Kim, Y.J., Kang, S.: Test-Decompression Mechanism Using a Variable-Length Multiple-Polynomial LFSR. IEEE Trans. VLSI Systems 11, 687–690 (2003)

    Article  Google Scholar 

  12. Wunderlich, H.J., Kiefer, G.: Bit-flipping BIST. In: Proc. of IEEE/ACM Int. Conf. Computer-Aided Design, pp. 337–343 (1996)

    Google Scholar 

  13. Kiefer, G., Wunderlich, H.J.: Using BIST control for pattern generation. In: Proc. of IEEE Int. Test Conf., pp. 347–355 (1997)

    Google Scholar 

  14. Li, L., Chakrabarty, K.: Deterministic BIST Based on a Reconfigurable Interconnection Network. In: Proc. of IEEE Int. Test Conf., pp. 460–496 (2003)

    Google Scholar 

  15. Li, L., Chakrabarty, K.: Test Set Embedding for Deterministic BIST Using Reconfigurable Interconnect Network. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 23, 1289–1305 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, DS., Kang, S. (2005). Increasing Embedding Probabilities of RPRPs in RIN Based BIST. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_49

Download citation

  • DOI: https://doi.org/10.1007/11572961_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29643-0

  • Online ISBN: 978-3-540-32108-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics