Cellular automata-based pseudorandom number generators for built-in self-test

A variation on a built-in self-test technique is presented that is based on a distributed pseudorandom number generator derived from a one-dimensional cellular automata (CA) array. The cellular automata-logic-block-observation circuits presented are expected to improve upon conventional design for testability circuitry such as built-in logic-block operation as a direct consequence of reduced cross correlation between the bit streams that are used as inputs to the logic unit under test. Certain types of circuit faults are undetectable using the correlated bit streams produced by a conventional linear-feedback-shift-register (LFSR). It is also noted that CA implementations exhibit data compression properties similar to those of the LFSR and that they display locality and topological regularity, which are important attributes for a very large-scale integration implementation. It is noted that some CAs may be able to generate weighted pseudorandom test patterns. It is also possible that some of the analysis of pseudorandom testing may be more directly applicable to CA-based pseudorandom testing than to LFSR-based schemes. >

[1]  Howard C. Card,et al.  Group Properties of Cellular Automata and VLSI Applications , 1986, IEEE Transactions on Computers.

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

[3]  B. Koenemann,et al.  Built-in logic block observation techniques , 1979 .

[4]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[5]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[6]  Wolfram,et al.  Origins of randomness in physical systems. , 1985, Physical review letters.

[7]  J. Lawrence Carter,et al.  The theory of signature testing for VLSI , 1982, STOC '82.

[8]  Hans-Joachim Wunderlich,et al.  Multiple distributions for biased random test patterns , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[9]  H. Ando,et al.  Testing VLSI with Random Access Scan , 1980 .

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

[11]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[12]  Scott Kirkpatrick,et al.  A very fast shift-register sequence random number generatorjournal of computational physics , 1981 .

[13]  Parker,et al.  Design for Testability—A Survey , 1982, IEEE Transactions on Computers.

[14]  Dilip K. Bhavsar.  "Concatenable Polydividers": Bit-Sliced LFSR Chips for Board Self-Test , 1985, ITC.

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

[16]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[17]  Paul H. Bardell,et al.  Parallel Pseudorandom Sequences for Built-In Test , 1984, ITC.

[18]  Toshihiro Arima,et al.  Test generation systems in Japan , 1975, DAC '75.

[19]  Edward J. McCluskey,et al.  Pseudorandom Testing , 1987, IEEE Transactions on Computers.

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