Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults

This paper presents a combinatorial method of evaluating the effectiveness of linear hybrid cellular automata (LHCA) and linear feedback shift registers (LFSR) as generators for stimulating faults requiring a pair of vectors. We provide a theoretical analysis and empirical comparisons to see why the LHCA are better than the LFSRs as generators for sequential-type faults in a built-in self-test environment. Based on the concept of a partner set, the method derives the number of distinctk-cell substate vectors which have 22k, 1≤k≤[n/2], transition capability for ann-cell LHCA and ann-cell LFSR with maximum length cycles. Simulation studies of the ISCAS85 benchmark circuits provide evidence of the effectiveness of the theoretrical metric.

[1]  PAUL H. BARDELL.  Discrete logarithms a parallel pseudorandom pattern generator analysis method , 1992, J. Electron. Test..

[2]  P. Pal Chaudhuri,et al.  Efficient characterisation of cellular automata , 1990 .

[3]  Jon C. Muzio,et al.  Determination of minimal cost one-dimensional linear hybrid cellular automata , 1991 .

[4]  Shujian Zhang,et al.  Minimal cost one-dimensional linear hybrid cellular automata of degree through 500 , 1995, J. Electron. Test..

[5]  Ad J. van de Goor,et al.  Logic synthesis of 100-percent testable logic networks , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[7]  Eric Lindbloom,et al.  Transition Fault Simulation , 1987, IEEE Design & Test of Computers.

[8]  Jacob Savir,et al.  AC strength of a pattern generator , 1992, J. Electron. Test..

[9]  Edward J. McCluskey,et al.  TWO-PATTERN TEST CAPABILITIES OF AUTONOMOUS TPG CIRCUITS , 1991, 1991, Proceedings. International Test Conference.

[10]  P. P. Chaudhuri,et al.  Cellular automata as a BIST structure for testing CMOS circuits , 1994 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  D. Michael Miller,et al.  BIST generators for sequential faults , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[13]  D. Michael Miller,et al.  The analysis of one-dimensional linear cellular automata and their aliasing properties , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[15]  Paul H. Bardell.  Primitive polynomials of degree 301 through 500 , 1992, J. Electron. Test..