Statistical path selection for at-speed test

ABSTRACT

Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a traditional fault model. Due to parametric variations, different paths can be critical in different parts of the process space, and the union of such paths must be tested to obtain good process space coverage. This paper proposes a novel branch-and-bound algorithm that elegantly and efficiently solves the hitherto open problem of statistical path tracing. The resulting paths are used for at-speed structural testing. A new Test Quality Metric (TQM) is proposed and paths which maximize this metric are selected. After chip timing has been performed, the path selection procedure is extremely efficient. Path selection for a multi-million gate chip design can be completed in a matter of seconds.

REFERENCES

• 1: V. Iyengar, T. Yokota, K. Yamada, T. Anemikos, R. Bassett, M. Degregorio, R. Farmer, G. Grise, M. Johnson, D. Milton, M. Taylor, and F. Woytowich. At-speed structural test for high-performance ASICs. Proc. International Test Conference, pages 2.4:1--10, October 2006. Santa Clara, CA.
• 2: Nandu Tendolkar , Rajesh Raina , Rick Woltenberg , Xijiang Lin , Bruce Swanson , Greg Aldrich, Novel Techniques for Achieving High At-Speed Transition Fault Test Coverage for Motorola's Microprocessors Based on PowerPC(tm) Instruction Set Architecture, Proceedings of the 20th IEEE VLSI Test Symposium, p.3, April 28-May 02, 2002
• 3: Vikram Iyengar , Jinjun Xiong , Subbayyan Venkatesan , Vladimir Zolotov , David Lackey , Peter Habitz , Chandu Visweswariah, Variation-aware performance verification using at-speed structural test and statistical timing, Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, November 05-08, 2007, San Jose, California
• 4: M. L. Bushnell and V. D. Agrawal. Essentials of electronic testing for digital, memory and mixed-signal VLSI circuits. Kluwer Academic Publishers, 2000.
• 5: L-C. Wang, J-J. Liou, and K-T. Cheng. Critical path selection for delay fault testing based upon a statistical timing model. IEEE Transactions on Computer-Aided Design of ICs and Systems, 23(11):1550--1565, November 2004.
• 6: Manish Sharma , Janak H. Patel, Finding a Small Set of Longest Testable Paths that Cover Every Gate, Proceedings of the 2002 IEEE International Test Conference, p.974, October 07-10, 2002
• 7: Jing-Jia Liou , Angela Krstic , Li-C. Wang , Kwang-Ting Cheng, False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA [doi>10.1145/513918.514061]
• 8: W. Qiu and D. M. H. Walker. An efficient algorithm for finding k longest testable paths through each gate in a combinational circuit. International Test Conference, pages 592--601, September 2003. Charlotte, NC.
• 9: C. Visweswariah , K. Ravindran , K. Kalafala , S. G. Walker , S. Narayan, First-order incremental block-based statistical timing analysis, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA [doi>10.1145/996566.996663]
• 10: Hongliang Chang , Sachin S. Sapatnekar, Statistical Timing Analysis Considering Spatial Correlations using a Single Pert-Like Traversal, Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, p.621, November 09-13, 2003 [doi>10.1109/ICCAD.2003.129]
• 11: D. J. Hathaway, J. P. Alvarez, and K. P. Belkhale. Network timing analysis method which eliminates timing variations between signals traversing a common circuit path. U. S. Patent 5,636,372, June 1997.
• 12: Jinjun Xiong , Vladimir Zolotov , Natesan Venkateswaran , Chandu Visweswariah, Criticality computation in parameterized statistical timing, Proceedings of the 43rd annual conference on Design automation, July 24-28, 2006, San Francisco, CA, USA [doi>10.1145/1146909.1146929]