Optimal design of hazard-free and easily testable logic networks (Q3680758)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal design of hazard-free and easily testable logic networks |
scientific article; zbMATH DE number 3902558 |
Statements
Optimal design of hazard-free and easily testable logic networks (English)
0 references
1985
0 references
fault detection
0 references
hazard-free combinational networks
0 references
control inputs
0 references
test set generation
0 references
syndrome testing
0 references
0.7587957382202148
0 references
0.7435190677642822
0 references
0.7427104115486145
0 references
0.7411502599716187
0 references
0.7409646511077881
0 references
The problem of designing optimal two-level static-logic hazard-free combinational networks is considered from a graph theoretic viewpoint. Two algorithms are presented, one of which generates the design with minimum number of appearances of extra control inputs with which the circuit is to be augmented, and the other generates a design with an absolute minimum number of distinct control inputs. The proposed methods are guaranteed to produce a design with minimum changes in the circuit, unlike other existing methods. The detection of stuck-at and bridging faults in such networks is also discussed from the viewpoint of test set generation and syndrome testing.
0 references