Skip to main content
Log in

Partial scan and symbolic test at the register-transfer level

  • High-Level Design
  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

This paper presents a partial scan methodology suited for (pipelined) data paths described at the Register-Transfer level. The method is based on feedback elimination by making existing registers scannable or by adding extra transparent scan registers An optimal set (in terms of area cost) of scan registers is selected using an exact branch and bound algorithm. This approach can deal with complex realistic data paths requiring orders of magnitude lower CPU times than gate devel techniques. Furthermore, our symbolic test pattern generation technique can very effectively deal with the delay in the remaining acyclic sequential circuit parts. This symbolic test method makes various scan schemes possible which ensure a correct assembly and application of the test vectors. They are discussed and compared in terms of hardware requirements, test application times and test accuracy.

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. E. Trischler, “Incomplete Scan Path with an Automatic Test Generation Approach,”Proc. International Test Conference, pp. 153–162, November 1980.

  2. V. Chickermane and J.H. Patel, “An Optimization Based Approach to the Partial Scan Design Problem”,Proc. International Test Conference, pp. 377–386, September 1990.

  3. V.D. Agrawal, K.-T. Cheng, D.D. Johnson, and T. Lin, “A Complete Solution to the Partial Scan Problem,”Proc. International Test Conference, pp. 44–51, September 1987.

  4. H.-K.T. Ma, S. Devadas, A.R. Newton, and A. Sangiovanni-Vincentelli, “An Incomplete Scan Design Approach to Test Generation for Sequential Machines,”Proc. International Test Conference, pp. 730–734, September 1988.

  5. K.-T. Cheng and V.D. Agrawal, “A Partial Scan Method for Sequential Circuits with Feedbacks,”IEEE Transactions on Computers, Vol. 39, No. 4, pp. 544–548, April 1990.

    Google Scholar 

  6. R. Gupta, R. Gupta, and M.A. Breuer, “The BALLAST Methodology for Structured Partial Scan Design,”IEEE Transactions on Computers, Vol. 39, No. 4, pp. 538–544, April 1990.

    Google Scholar 

  7. A. Kunzman and H.-J. Wunderlich “An Analytical Approach to the Partial Scan Problem,”Journal of Electronic Testing: Theory and Applications, Vol. 1, No. 2, pp. 163–174, May 1990.

    Google Scholar 

  8. S. Bhawmik, C.J. Lin, K.-T. Cheng, and V.D. Agrawal, “PASCANT: A Partial Scan and Test Generation System,”Proc. IEEE Custom Integrated Circuits Conference, pp. 17.3.1–17.3.4, 1991.

  9. S. Park and S.B. Akers, “A Graph Theoretic Approach to Partial Scan Design by K-Cycle Elimination,”Proc. International Test conference, pp. 303–311, November 1992.

  10. S. Chakradhar, A. Balakrishnan, and V.D. Agrawal, “An exact algorithm for selecting partial scan flip-flops,”Proc. 31st Design Automation Conference, pp. 81–86, June 1994.

  11. T.-C. Lee, N.K. Jha, and W.H. Wolf, “A Conditional Resource Sharing Method for Behavioral Synthesis of Highly Testable Data Paths,”Proc. International Test Conference, pp. 745–753, October 1993.

  12. S. Dey, M. Potkonjak, and R.K. Roy, “Exploiting Hardware Sharing in High-Level Synthesis for Partial Scan Optimization,”Proc. International Conference on Computer-Aided Design, pp 20–25, November 1993.

  13. C.H. Chen and D.G. Saab, “Behavioral Synthesis for Testability,”Proc. International Conference on Computer-Aided Design, pp. 612–615, November 1992.

  14. J. Steensma, W. Geurts, F. Catthoor, and H. De Mum, “Testability Analysis in High Level Data Path Synthesis,”Journal of Electronic Testing: Theory and Applications Vol. 4, No. 1, pp. 43–56, February 1993.

    Google Scholar 

  15. J. Steensma, F. Catthoor, and H. De Man, “Test of High Throughput Data Paths using Symbolic Controllability and Observability Descriptions,” 6th Workshop On New Directions For Testing, Montreal Canada, pp. 67–76, May 21–22, 1992.

  16. E. Blokken, H. De Keulenaer, F. Catthoor, and H. De Man, “A Flexible Module Library for Custom DSP Applications in a Multi-processor Environment,”IEEE Journal of Solid State Circuits, Vol. 25, No. 3, pp. 720–729, June 1990.

    Google Scholar 

  17. R. Tarjan, “Depth-First Search and Linear Graph Algorithms,”SIAM J. Comput. Vol. 2, No. 2, pp. 146–160, June 1972.

    Google Scholar 

  18. S. Note, W. Geurts, F. Catthoor, and H. De Man, “Cathedral III: Architecture Driven High-Level Synthesis for High Throughput DSP Applications,”Proc. 28th Design Automation Conference, pp. 597–602, June 1991.

  19. B.T. Murray and J.P. Hayes, “Hierarchical Test Generation Using Precomputed Tests for Modules,”Proc. International Test Conference, pp. 221–229, September 1988.

  20. S. Freeman, “Test Generation for Data-Path Logic: The F-Path Method,”IEEE Journal of Solid-State Circuits, Vol. 23, No. 2, pp. 421–427, April 1988.

    Google Scholar 

  21. P.N. Anirudhan and P.R. Menon, “Symbolic Test Generation for Hierarchical Modeled Digital Systems,”Proc. International Test Conference, pp. 461–469, August 1989.

  22. J. Steensma, F. Catthoor, and H. De Man, “Modeling Delay in Symbolic Test for Data Paths with Partial Scan,”Proc. European Test Conference pp. 253–454, April 1993.

  23. F. Catthoor, J. van Sas, L. Inze, and H. De Man, “A Test Strategy for Multiprocessor Architectures,”IEEE Design and Test of Computers Vol. 6, pp. 18–34, April 1989.

    Google Scholar 

  24. H. Hofestädt and M. Gerner, “Qualitative Testability Analysis and Hierarchial Test Pattern Generation: A New approach to Design for Testability,”Proc. International Test Conference, pp. 538–546, September 1987.

  25. J. Steensma, F. Catthoor, and H. De Man, “Partial Scan at the Register-Transfer Level,”Proc. International Test Conference, pp. 488–497, October 1993.

  26. F. Beenker, R. Dekker, R. Stants and M. van der Star, “A Testability Strategy for Silicon Compilers,”Proc. International Test Conference, pp. 660–669, August 1989.

  27. J. van Sas, F. Catthoor, L. Inzé, and H. De Man, “Testability Strategy and Test Pattern Generation for Register Files and Customized Memories,”Microprocessors and Microsystems, Vol. 14, No. 7, pp. 444–456, September, 1990.

    Google Scholar 

  28. S. Oostdijk, F. Beenker, and L. Thijssen, “A Model for Test-Time Reduction of Scan Testable Circuits,”Proc. European Test Conference, pp. 243–252, April 1991.

  29. S. Narayanan, C. Njinda, and M.A. Breuer, “Optimal Sequencing of Scan Registers,”Proc. International Test Conference, paper 15.2, pp. 293–302, September 1992.

  30. S. Narayanan, R. Gupta, and M.A. Breuer, “Optimal Configuring of Multiple Scan Chains,”IEEE Transactions on Computers, Vol. 42, No. 9, pp. 1121–1131, September 1993.

    Google Scholar 

  31. S. Bhawmik, M.S. Khaira, P.P. Mishra, A. Das, and A. Dasgupta, “Threading of Multiple Scan Paths in a VLSI Circuit,”Proc. International Test Conference, pp. 735–743, September 1988.

  32. R.G. Bennetts and F.P.M. Beenker, “Partial Scan: What Problem Does It Solve?”Proc. European Test Conference, pp. 99–106, April 1993.

  33. J. Steensma, F. Catthoor, and H. De Man, “Adding Hardware for Testability in Synthesized Data Paths,”Proc. European Conferece on Design Automation, pp. 156–160, February 1993.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steensma, J., Catthoor, F. & De Man, H. Partial scan and symbolic test at the register-transfer level. J Electron Test 7, 7–23 (1995). https://doi.org/10.1007/BF00993311

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00993311

Key Words

Navigation