Aliasing probability in multiple input linear signature automata for q-ary symmetric errors

Closed Form Aliasing Probability For Q‐ary Symmetric Errors

“…Iwasaki and Arakawa [15] showed that the aliasing probabilities over a q-ary symmetric channel do not depend on the polynomials that characterize the MISRs. More general results were obtained in [10]. By modeling the signature analyzer as a Markov process we develop a closed form expression for exact, aliasing probability for all MISRs irrespective of their feedback polynomials and for a class of linear cellular automata (group cellular automata) signature analyzers under q-ary error model.…”

“…Rm-1,i) (10) To prove that there is only one p term in each column of the state transition matrix, we have to show that if the outputs of the CUT are fault free then the register goes to a unique state depending on the current state. In other words if the current state of the register is R i, and it goes to state Rj in one step, then the register cannot go to state Rj from a state other than R when the outputs of the CUT are fault free.…”

“…Aliasing in single input linear feedback shift registers (LFSRs) and MISRs have been studied by several researchers [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] under various bit error models to compute Pal" In this work we use the q-ary error model which considers correlated errors among Circuit Under Test (CUT) outputs 10,15,16]. The q-ary error model assumes that all (2m-l) error patterns possible at the m-output CUT are equally likely.…”

A new built-in self-test method based on prestored testing

“…This loss may lead to aliasing or masking and is measured by the probability of a faulty circuit producing the same compressed signature as the fault-free circuit [IS, 16,17,18,24,25]. Techniques have also been proposed to reduce or eliminate aliasing [9][10][11][12]261.…”