Robust Evaluation of Weighted Random Logic BIST Structures in Industrial Designs

This paper presents a highly robust approach to exactly analyze signal probabilities of Weighted Random Logic (WRL) BIST structures. WRL BIST structures are implemented in modern CMOS designs to ensure high defect coverage for example during on-line in-system tests, which are executed periodically in safety applications as needed in automotive designs. Furthermore the paper describes a novel design flow which automatically identifies and evaluates WRL BIST structures in large industrial designs. The complete design flow from calculating the weighted random logic up to its automatic identification and evaluation in pre- and post-layout netlists is discussed in detail. The effectiveness of the new approach has been evaluated on 10 industrial designs and various other test cases. The results show that the memory consumption of the proposed technique does not grow despite of an immense increase of the circuit size.

[1]  Friedrich Hapke,et al.  Programmable deterministic Built-In Self-Test , 2007, 2007 IEEE International Test Conference.

[2]  John A. Waicukauski,et al.  A Method for Generating Weighted Random Test Patterns , 1989, IBM J. Res. Dev..

[3]  Wilfried Daehn,et al.  Hardware Test Pattern Generation for Built-In Testing , 1981, International Test Conference.

[4]  Jacob Savir.  On-Chip Weighted Random Patterns , 1998, J. Electron. Test..

[5]  Elena Dubrova,et al.  Fast algorithm for computing spectral transforms of Boolean and multiple-valued functions on circuit representation , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[6]  Kurt Keutzer,et al.  Estimation of average switching activity in combinational and sequential circuits , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[7]  Eric Lindbloom,et al.  The Weighted Random Test-Pattern Generator , 1975, IEEE Transactions on Computers.

[8]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[9]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[10]  G. Kemnitz,et al.  How To Do Weighted Random Testing For Bist? , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[11]  Hans-Joachim Wunderlich,et al.  BIST for systems-on-a-chip , 1998, Integr..

[12]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[13]  Bernard Courtois,et al.  Built-In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers , 1995, IEEE Trans. Computers.

[14]  B. Ricco,et al.  Estimate of signal probability in combinational logic networks , 1989, [1989] Proceedings of the 1st European Test Conference.

[15]  M. Ray Mercer,et al.  A Topological Search Algorithm for ATPG , 1987, 24th ACM/IEEE Design Automation Conference.

[16]  George Markowsky.  Bounding Signal Probabilities in Combinational Circuits , 1987, IEEE Transactions on Computers.

[17]  Janak H. Patel,et al.  Design of Test Pattern Generators for Built-In Test , 1984, ITC.

[18]  Edward J. McCluskey,et al.  Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.

[19]  Liyang Lai,et al.  Hardware efficient LBIST with complementary weights , 2005, 2005 International Conference on Computer Design.