Programmable BIST Space Compactors

We address test data compaction for built-in self-test (BIST). The thrust of the work focuses on BIST space compaction, a process increasingly required when a large number of internal circuit nodes need to be monitored during test but where area limitations preclude the association of observation latches for all the monitored nodes. We introduce a general class of space compactors denoted as programmable space compactors (PSCs). Programmability enables highly-effective space compactors to be designed for circuits under test (CUT) subjected to a specific set or test patterns. Circuit-specific information such as the fault-free and expected faulty behavior of a circuit are used to choose PSCs that have better fault coverage and/or lower area costs than the commonly-used parity function. Finding optimal PSCs is a difficult task since the space of possible PSC functions is extremely large and grows exponentially with the number of lines (nodes) to be compacted. We describe an optimization search method based on genetic algorithms for finding combinational PSCs. The factors used to assess the effectiveness of a PSC are its fault coverage and implementation area.

[1]  Slawomir Pilarski,et al.  Performance of signature analysis: a survey of bounds, exact, and heuristic algorithms , 1992, Integr..

[2]  Edward McCluskey,et al.  Built-In Self-Test Structures , 1985, IEEE Design & Test of Computers.

[3]  Nirmal R. Saxena,et al.  A Unified View of Test Compression Methods , 1987, IEEE Transactions on Computers.

[4]  Paul W. Rutkowski,et al.  PEST-a tool for implementing pseudo-exhaustive self test , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[5]  Barry W. Johnson Design & analysis of fault tolerant digital systems , 1988 .

[6]  John E. Bauer,et al.  An Advanced Fault Isolation System for Digital Logic , 1975, IEEE Transactions on Computers.

[7]  Sheldon B. Akers,et al.  A parity bit signature for exhaustive testing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9]  Barry Kazuto Tsuji,et al.  On selecting programmable space compactors for built-in self-text using genetic algorithms , 1993 .

[10]  René David Signature Analysis for Multiple-Output Circuits , 1986, IEEE Transactions on Computers.

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  Paul W. Rutkowski,et al.  PEST: A tool for implementing pseudo-exhaustive self-test , 1991, AT&T Technical Journal.

[13]  Jacob Savir On shrinking wide compressors , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[14]  Yervant Zorian,et al.  Computing the error escape probability in count-based compaction schemes , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[15]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[16]  Edward McCluskey,et al.  Built-In Self-Test Techniques , 1985, IEEE Design & Test of Computers.

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[19]  Yervant Zorian,et al.  Optimizing error masking in BIST by output data modification , 1990, J. Electron. Test..

[20]  Eleanor Wu,et al.  A Cost-effective Test Data Compaction Scheme , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[21]  W. Daehn,et al.  Aliasing errors in multiple input signature analysis registers , 1989, [1989] Proceedings of the 1st European Test Conference.

[22]  Yervant Zorian,et al.  Selecting programmable space compactors for BIST using genetic algorithms , 1994, Proceedings of IEEE 3rd Asian Test Symposium (ATS).

[23]  John P. Hayes,et al.  CHECK SUM METHODS FOR TEST DATA COMPRESSION. , 1976 .

[24]  Yervant Zorian,et al.  Programmable space compaction for BIST , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[25]  Yervant Zorian,et al.  PSBIST: A partial-scan based built-in self-test scheme , 1993, Proceedings of IEEE International Test Conference - (ITC).

[26]  Wilfried Daehn,et al.  Bounds and analysis of aliasing errors in linear feedback shift registers , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[27]  J. P. Robinson,et al.  Space Compression Methods With Output Data Modification , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[28]  Stephanie Forrest,et al.  Implementing Semantic Network Structures Using the Classifier System , 1985, ICGA.

[29]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[30]  N.S.V. Rao,et al.  Computational Complexity of Test-Point Insertions and Decompositions , 1992, The Fifth International Conference on VLSI Design.

[31]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[32]  Nirmal R. Saxena,et al.  Accumulator Compression Testing , 1986, IEEE Transactions on Computers.

[33]  Andrew Mcgilvary Gillies,et al.  Machine Learning Procedures for Generating Image Domain Feature Detectors , 1985 .

[34]  Yervant Zorian,et al.  An Effective BIST Scheme for ROM's , 1992, IEEE Trans. Computers.

[35]  Sunil Jain,et al.  Built-in Self Testing of Embedded Memories , 1986, IEEE Design & Test of Computers.

[36]  Dhiraj K. Pradhan,et al.  Zero aliasing compression , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[37]  Benoit Nadeau-Dostie,et al.  Serial interfacing for embedded-memory testing , 1990, IEEE Design & Test of Computers.

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

[39]  R. Kh. Latypov Built-in Self-testing of Logic Circuits Using Imperfect Duplication , 1987, FCT.

[40]  John P. Hayes,et al.  Aliasing-free error detection (ALFRED) , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[41]  Sudhakar M. Reddy,et al.  A Data Compression Technique for Built-In Self-Test , 1988, IEEE Trans. Computers.

[42]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[43]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[44]  Alfred K. Susskind,et al.  Testing by Verifying Walsh Coefficients , 1983, IEEE Transactions on Computers.

[45]  Mark G. Karpovsky,et al.  Testing Computer Hardware through Data Compression in Space and Time , 1983, ITC.