DocumentCode :
2754768
Title :
Signature analysers based on additive cellular automata
Author :
Das, Aloke K. ; Saha, Debanjan ; Chowdhury, A. Roy ; Misra, Susanta ; Chaudhuri, P.P.
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
fYear :
1990
fDate :
26-28 June 1990
Firstpage :
265
Lastpage :
272
Abstract :
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.<>
Keywords :
Markov processes; finite automata; logic analysers; Markov chain; additive cellular automata; error pattern; linear feedback shift registers; signature analysis; signature analyzers; state transition behavior; steady-state aliasing probability; Circuit faults; Content addressable storage; Data compression; Electrical fault detection; Fault detection; Hardware; Logic; Polynomials; Steady-state;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fault-Tolerant Computing, 1990. FTCS-20. Digest of Papers., 20th International Symposium
Conference_Location :
Newcastle Upon Tyne, UK
Print_ISBN :
0-8186-2051-X
Type :
conf
DOI :
10.1109/FTCS.1990.89374
Filename :
89374
Link To Document :
بازگشت