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

Abstract

Additive cellular automata (CA) have been proposed as an alternative to LFSR for signature analysis. It has also been shown that for nongroup CAs the steady state aliasing error probability (AEP) can be less than 2/sup -n/ (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/sup -n/ 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.<>