Complete checking of programmable logic arrays. I (Q761421)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complete checking of programmable logic arrays. I |
scientific article; zbMATH DE number 3885803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete checking of programmable logic arrays. I |
scientific article; zbMATH DE number 3885803 |
Statements
Complete checking of programmable logic arrays. I (English)
0 references
1984
0 references
We identify a class of checkable programmable logic arrays in which all single appearance and disappearance faults and all multiple faults consisting of combinations of such single faults can be checked by a test of length essentially shorter than \(2^ m\), where m is the number of PLA inputs.
0 references
checkable programmable logic arrays
0 references
multiple faults
0 references
single faults
0 references
0.9733843
0 references
0.8812362
0 references
0.8637708
0 references
0.8532668
0 references
0.8475788
0 references
0 references
0.8458066
0 references
0.8349838
0 references
