Built-in self-test structures around cellular automata and counters

BIST structures for on-chip generation of random, exhaustive and deterministic test patterns have been discussed in the paper. Isomorphism between maximal length LFSR (linear feedback shift register) and exhaustive CA has been established and the pseudorandomness properties of CAs in terms of well-suited autocorrelation functions have been investigated. Owing to the regularity in interconnection structure, additive group CA (cellular automata) offers advantages over LFSR. A method of covering deterministic test set by a counter-based scheme and its optimisation based on AT/sup 2/ complexity has been discussed.< >

[1]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[2]  J. Mucha,et al.  Built-In Test for Complex Digital Integrated Circuits , 1979, Fifth European Solid State Circuits Conference - ESSCIRC 79.

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

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

[5]  Howard C. Card,et al.  (λT) Complexity Measures for VLSI Computations in Constant Chip Area , 1987, IEEE Transactions on Computers.

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

[7]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..