Reducing test application time in high-level test generation

Available register-transfer level (RTL) test generation techniques do not make a concerted effort to reduce the test application time associated with the derived tests. Chip tester memory limitations, increasing tester costs, etc., make it imperative that the issue of generating compact tests at the RTL be addressed and consolidated with the known gains of high-level testing. In this paper, we provide a comprehensive framework for generating compact tests for an RTL circuit. We develop a series of techniques that exploit the inherent parallelism available in symbolic test(s) derived for RTL module(s). These techniques enable us to schedule testing of multiple modules in parallel as well as perform test pipelining. In addition, we also present design for testability (DFT) techniques for lowering test application time. Using a maximum bipartite matching formulation, we choose a low-overhead set of test enhancements that can achieve compact tests. Our techniques can seamlessly plug into any generic high-level test framework. Our experimental results in the context of one such framework indicate that the proposed methodology achieves an average reduction in test application time of 61.1% for the example circuits.

[1]  Janak H. Patel,et al.  Architectural level test generation for microprocessors , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Niraj K. Jha,et al.  A design-for-testability technique for register-transfer level circuits using control/data flow extraction , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[4]  Irith Pomeranz,et al.  On static compaction of test sequences for synchronous sequential circuits , 1996, DAC '96.

[5]  Srivaths Ravi,et al.  A framework for testing core-based systems-on-a-chip , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[6]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[7]  Kenneth P. Bogart,et al.  Introductory Combinatorics , 1977 .

[8]  John P. Hayes,et al.  Hierarchical test generation using precomputed tests for modules , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Anand Raghunathan,et al.  Bottleneck removal algorithm for dynamic compaction in sequential circuits , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Elizabeth M. Rudnick,et al.  Simulation-based techniques for dynamic test sequence compaction , 1996, ICCAD 1996.

[11]  Janak H. Patel,et al.  Test compaction for sequential circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[13]  Jacob A. Abraham,et al.  A novel functional test generation method for processors using commercial ATPG , 1997, Proceedings International Test Conference 1997.

[14]  Niraj K. Jha,et al.  Hierarchical test generation and design for testability methods for ASPPs and ASIPs , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Srinivas Devadas,et al.  Sequential test generation and synthesis for testability at the register-transfer and logic levels , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[17]  John P. Hayes,et al.  High-level test generation using symbolic scheduling , 1995, Proceedings of 1995 IEEE International Test Conference (ITC).

[18]  Srivaths Ravi,et al.  TAO: regular expression based high-level testability analysis and optimization , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).