1990
DOI: 10.1147/rd.342.0363
|View full text |Cite
|
Sign up to set email alerts
|

Aliasing errors in linear automata used as multiple-input signature analyzers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1992
1992
2002
2002

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…In the independent error model (e.g. [16]), error bits at different outputs of the CUT are statistically independent and can have different probabilities. The more general error model of [17] and [18] specifies the probabilities of all the 2 possible error patterns individually.…”
Section: Definitionmentioning
confidence: 99%
“…In the independent error model (e.g. [16]), error bits at different outputs of the CUT are statistically independent and can have different probabilities. The more general error model of [17] and [18] specifies the probabilities of all the 2 possible error patterns individually.…”
Section: Definitionmentioning
confidence: 99%
“…The problem of computing the aliasing probability in SISRs and MISRs has been considered by many researchers [4,28,29,30]. Different assumptions were used by different researchers regarding the behavior of errors entering the signature registers.…”
Section: Signature Registersmentioning
confidence: 99%
“…There have been numerous papers published on aliasing by linear compactors [7]- [15] and on aliasing by counters [1], [4], [5], [16], [17]- [19]. Most early results [4], [17]- [18], [20] were based on the assumption that, for a faulty CUT, all compactor input sequences were equally likely.…”
Section: Introductionmentioning
confidence: 99%