Signature analysers based on additive cellular automata

Das, Aloke Kumar; Saha, Dibakar; Chowdhury, Abhirup; Misra, Shikha; Chaudhuri, P.P.

doi:10.1109/ftcs.1990.89374

Cited by 22 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next shown are the T + XI and the characteristic polynomial. Hence for an n-cell CA (synthesised using procedure 1) In section IV it has already been noted that for any class 1 CA, From the above two equations,…”

Section: Examplementioning

confidence: 98%

Additive cellular automata (CA) as a primitive structure for signature analysis

Misra

Chaudhuri

1991

[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design

Self Cite

View full text Add to dashboard Cite

Additive Cellular Automata ( CA ) has been proposed as an alternative to LFSR for signature analysis [l]. It has also been shown that for nongroup CAS the steady state Aliasing Error Probability (AEP) can be less than ZLL ( for an n-cell CA ). A closed form expression for the steady state AEP for a special class of CA has been derived. From the closed form expression it has been shown that the steady state AEP is less than 2-" for some values of p (error probability) and n. A procedure has been outlined to synthesise a CA over any length of the above class.

show abstract

Section: Examplementioning

confidence: 98%

Additive cellular automata (CA) as a primitive structure for signature analysis

Misra

Chaudhuri

1991

[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…A good number of works have been reported in literature that deal with CAs based encryption, cryptography and authentication techniques; see for example Nandi et al (1994); Bao (2004); Seredynski et al (2004); Seredynski and Bouvry (2005); Chowdhury (2011, 2013); Formenti et al (2014). Other notable works, related to electronic circuit design are non-uniform ECAs based error correcting codes by Chowdhury et al (1994); , signature analysis by Hortensius et al (1990); Das et al (1990b), etc. For more discussion, see Chaudhuri et al (1997).…”

Section: Security and Othersmentioning

confidence: 99%

A survey of cellular automata: types, dynamics, non-uniformity and applications

et al. 2018

View full text Add to dashboard Cite

Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modelling different physical, natural as well as reallife phenomena. Classically, CAs are uniform. However, non-uniformity has also been introduced in update pattern, lattice structure, neighborhood dependency and local rule. In this survey, we tour to the various types of CAs introduced till date, the different characterization tools, the global behaviors of CAs, like universality, reversibility, dynamics etc. Special attention is given to non-uniformity in CAs and especially to non-uniform elementary CAs, which have been very useful in solving several real-life problems.

show abstract

“…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.…”

Section: Introductionmentioning

confidence: 99%

Closed Form Aliasing Probability For Q‐ary Symmetric Errors

Edirisooriya

1996

VLSI Design

View full text Add to dashboard Cite

In Built-In Self-Test (BIST) techniques, test data reduction can be achieved using Linear Feedback Shift Registers (LFSRs). A faulty circuit may escape detection due to loss of information inherent to data compaction schemes. This is referred to as aliasing. The probability of aliasing in Multiple-Input Shift-Registers (MISRs) has been studied under various bit error models. By modeling the signature analyzer as a Markov process we show that the closed form expression derived for aliasing probability previously, for MISRs with primitive polynomials under q-ary symmetric error model holds for all MISRs irrespective of their feedback polynomials and for group cellular automata signature analyzers as well. If the erroneous behaviour of a circuit can be modelled with q-ary symmetric errors, then the test circuit complexity and propagation delay associated with the signature analyzer can be minimized by using a set of m single bit LFSRs without increasing the probability of aliasing.

show abstract

Signature analysers based on additive cellular automata

Cited by 22 publications

References 7 publications

Additive cellular automata (CA) as a primitive structure for signature analysis

Additive cellular automata (CA) as a primitive structure for signature analysis

A survey of cellular automata: types, dynamics, non-uniformity and applications

Closed Form Aliasing Probability For Q‐ary Symmetric Errors

Contact Info

Product

Resources

About