Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links (Q2778433)
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: Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links |
scientific article; zbMATH DE number 1715617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links |
scientific article; zbMATH DE number 1715617 |
Statements
Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links (English)
0 references
3 March 2002
0 references
catastrophic fault patterns
0 references
combinatorial problems
0 references
random walk
0 references
0.90559196
0 references
0.8969816
0 references
0.86916494
0 references
0.86417925
0 references
0.8614066
0 references
Characterization of Catastrophic Fault Patterns (CFPs) and their enumeration have been studied by several authors. Given a linear array with a set of bypass links, an important problem is how to count the number of CFPs. Enumeration of CFPs for two link redundancy \(G={1,g}\) has been solved for both unidirectional and bidirectional link cases. In this paper, we consider the more general case of link redundancy \(G=\{1,2,\dots,k,g\}\), \(2<k<g\). Using random walk as a tool, we enumerate CFPs for both unidirectional and bidirectional cases.
0 references
