Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 640-652 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Computers |
| Volume | 39 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1990 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Cite this
}
Easily Testable Iterative Logic Arrays. / Wu, Cheng Wen; Cappello, Peter R.
In: IEEE Transactions on Computers, Vol. 39, No. 5, 01.01.1990, p. 640-652.Research output: Contribution to journal › Article
TY - JOUR
T1 - Easily Testable Iterative Logic Arrays
AU - Wu, Cheng Wen
AU - Cappello, Peter R.
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 -