High-level BIST synthesis for delay testing

As delay testing using an external tester requires expensive test equipment, BIST is an alternative technique that can significantly reduce the test cost. A prime concern in using BIST is the area overhead due to the modifications of normal registers to be test registers. This paper presents a BIST TPG scheme for the detection of delay faults. This scheme produces single-input change test-pair sequence which guarantees the detection of all testable path delay faults. In order to implement the proposed BIST scheme effectively, this paper exploits high-level synthesis process, and presents a data path allocation approach, which results in a minimum area BIST solution. The proposed BIST scheme and the register assignment approach were applied to academic benchmarks.

[1]  LaNae J. Avra,et al.  ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHS , 1991, 1991, Proceedings. International Test Conference.

[2]  Melvin A. Breuer,et al.  Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead , 1995, 32nd Design Automation Conference.

[3]  Sandeep K. Gupta,et al.  Weighted random robust path delay testing of synthesized multilevel circuits , 1994, Proceedings of IEEE VLSI Test Symposium.

[4]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[6]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Manfred Padberg,et al.  Location, Scheduling, Design and Integer Programming , 2011, J. Oper. Res. Soc..

[8]  Xiaowei Li,et al.  An effective BIST scheme for delay testing , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[9]  M. Golumbic Algorithmic graph theory and perfect graphs , 1980 .

[10]  Slawomir Pilarski,et al.  Pitfalls in delay fault testing , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Haidar Harmanani,et al.  SYNTEST: a method for high-level SYNthesis with self-TESTability , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.