1996
DOI: 10.1109/24.488926
|View full text |Cite
|
Sign up to set email alerts
|

A unified domination approach for reliability analysis of networks with arbitrary logic in vertices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
2
0
1

Year Published

1997
1997
2015
2015

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 0 publications
0
2
0
1
Order By: Relevance
“…To the best of our knowledge, there has not been any systematic study on accurately measuring modular criticality values within a large-scale VLSI digital circuit. The most related works to this paper are several recent studies that explored various analytical ways of computing the overall logic reliability of VLSI logic circuits [6][7][8][24][25][26][27][28][29][30][31]. Reliability analysis of logic circuits refers to the problem of evaluating the effects of errors due to noise at individual transistors, gates or logic blocks on the outputs of the circuit, which become magnified when operating at low supply voltage.…”
Section: Contributions and Outlinementioning
confidence: 99%
“…To the best of our knowledge, there has not been any systematic study on accurately measuring modular criticality values within a large-scale VLSI digital circuit. The most related works to this paper are several recent studies that explored various analytical ways of computing the overall logic reliability of VLSI logic circuits [6][7][8][24][25][26][27][28][29][30][31]. Reliability analysis of logic circuits refers to the problem of evaluating the effects of errors due to noise at individual transistors, gates or logic blocks on the outputs of the circuit, which become magnified when operating at low supply voltage.…”
Section: Contributions and Outlinementioning
confidence: 99%
“…In such graphs, the signal passability across a vertex is determined by the collection of signals delivered on the vertex inputs from other vertices, the collections are in one-to-one correspondence with simple implicants of a monotone Boolean function. The extension [2,3] of the domination theory to monotone graphs led to disclosing the common combinatorial nature of the earlier obtained results concerning the reliability and domination of directed networks.…”
Section: Introductionmentioning
confidence: 98%
“…Recent years, many methods were proposed to solve the problem of mainlobe jamming cancellation. A two stage Adaptive Mainlobe Jamming Cancellation Algorithm(AMJCA) was proposed by Chernyak [1] to improve the anti-jamming performance of multistatic radar systems, however, the searching scope of multistatic radar systems are constrained by the district of crossing beam which is much smaller than monostatic radar. To improve the anti-mainlobe jamming performance ,the angle estimation methods[2~5] was proposed using adaptive monopulse antenna systems, but only one jamming in the mainlobe can be cancelled by using the sum-difference cancellation method.…”
Section: Introductionmentioning
confidence: 99%