TY - JOUR
T1 - Easily Testable Iterative Logic Arrays
AU - Wu, Cheng Wen
AU - Cappello, Peter R.
N1 - Funding Information:
Manuscript received September 9, 1987; revised February 17, 1988. This work was supported by the Office of Naval Research under Contracts N00014-84-K-0664 and N00014-85-K-0553. C.-W. Wu is with the Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan 30043, R.O.C. P. R. Cappello is with the Department of Computer Science, University of California, Santa Barbara, CA 93106. IEEE Log Number 9034540.
PY - 1990/1/1
Y1 - 1990/1/1
N2 - Iterative logic arrays (ILA) are studied with respect to two testing problems. First, a variety of conditions are presented which, when met, guarantee an upper bound on the size of the test set for the ILA under consideration. Second, techniques are presented for designing optimally testable ILA's. The arrays that are treated are, in some cases, more general than those that have been reported by other researchers: they include multidimensional and inhomogeneous arrays. Octagonally-connected arrays, hexagonally-connected arrays, and bilateral arrays also are discussed. The presented results indicate that the characteristics of the individual cell functions (e.g., whether they are bijective) are a good guide to the test complexity of the overall array. Matrix multiplication, as an example, is shown to have several different optimally testable implementations. The results are useful for combinational and pipelined arrays, and for certain systolic arrays.
AB - Iterative logic arrays (ILA) are studied with respect to two testing problems. First, a variety of conditions are presented which, when met, guarantee an upper bound on the size of the test set for the ILA under consideration. Second, techniques are presented for designing optimally testable ILA's. The arrays that are treated are, in some cases, more general than those that have been reported by other researchers: they include multidimensional and inhomogeneous arrays. Octagonally-connected arrays, hexagonally-connected arrays, and bilateral arrays also are discussed. The presented results indicate that the characteristics of the individual cell functions (e.g., whether they are bijective) are a good guide to the test complexity of the overall array. Matrix multiplication, as an example, is shown to have several different optimally testable implementations. The results are useful for combinational and pipelined arrays, and for certain systolic arrays.
UR - http://www.scopus.com/inward/record.url?scp=0025432692&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025432692&partnerID=8YFLogxK
U2 - 10.1109/12.53577
DO - 10.1109/12.53577
M3 - Article
AN - SCOPUS:0025432692
VL - 39
SP - 640
EP - 652
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
SN - 0018-9340
IS - 5
ER -