A technique for fault detection in C-testable orthogonal iterative arrays

The authors present an approach to C-testability of orthogonal iterative arrays. C-testability is defined by those criteria which characterize the complexity of the testing process as independent of the dimensions of the array and of the erroneous states of the cells. The proposed approach is based on a cellular automata characterization under a single-faulty-cell assumption. This characterization analyzes the state transition table of a basic cell and adds new states to it. These new states are used to reproduce internally to the array the test input and propagate the faulty state to the output pins of a chip. This process is analyzed exhaustively. The characteristics of the additional states are presented. The conditions of C-testability are fully proved. Complexity of the testing process (number of test vectors) is discussed. It is proved that the proposed approach has a lower complexity than previously published work.<<ETX>>

[1]  Arthur D. Friedman,et al.  Easily Testable Iterative Systems , 1973, IEEE Transactions on Computers.

[2]  Sudhakar M. Reddy,et al.  A Testable Design of Iterative Logic Arrays , 1981, IEEE Transactions on Computers.

[3]  H. T. Kung Why systolic architectures? , 1982, Computer.

[4]  Melvin A. Breuer,et al.  Diagnosis and Reliable Design of Digital Systems , 1977 .

[5]  John Paul Shen,et al.  The Design of Easily Testable VLSI Array Multipliers , 1984, IEEE Transactions on Computers.

[6]  Larry L. Kinney,et al.  C-Testability of Two-Dimensional Iterative Arrays , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[8]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.