Signature analysers based on additive cellular automata

A novel scheme for signature analysis based on cellular automata (CA) is proposed. The state transition behavior of such signature analyzers has been modeled by Markov chain. It has been shown that a special class of such CAs achieves a steady-state aliasing probability lower than 1/2/sup n/ (for an n-cell CA) for specific ranges of input probabilities of the incoming error pattern. The dynamic behavior of linear feedback shift registers (LFSRs) has also been compared with CAs with the same characteristic polynomials. This work establishes the fact that CA-based signature analyzers outperform those based on LFSRs as regards both steady-state and dynamic behavior.<<ETX>>

[1]  Wilfried Daehn,et al.  Comparison of Aliasing Errors for Primitive and Non-Primitive Polynomials , 1986, ITC.

[2]  Wilfried Daehn,et al.  Bounds and analysis of aliasing errors in linear feedback shift registers , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  H. D. Miller,et al.  The Theory Of Stochastic Processes , 1977, The Mathematical Gazette.

[4]  Dhiraj K. Pradhan,et al.  A new framework for designing and analyzing BIST techniques: computation of exact aliasing probability , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[5]  Nirmal R. Saxena,et al.  A Unified View of Test Compression Methods , 1987, IEEE Transactions on Computers.

[6]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..