Highly regular, modular, and cascadable design of cellular automata-based pattern classifier

Zero Aliasing Space Compaction with Cellular Automata

“…For the CA to be a zero-aliasing compactor, all these conditions need to be satisfied. It has been shown in [22] that if at the most p number of nonzero rows and q number of non-zero columns arc required to satisfy a given set of equations, then the D I-MACA is given by the matrix where, ·1P x Pis a p x p identify matrix, T~q is the submatrix of Tcontaining only nonzero rows and columns of it, and Oq x (p + q) is an all-zero matrix of dimension q x (p+q).…”

“…In this section, we present a brief overview of the CA based classilication strategy presented in [22]. For an n-ccll 1-dimensionallincar CA with XOR rules, it has been shown [23,24] that the linear operator is ann x n Boolean matrix whose ith row spccilies the dependency of the ith cell of the CA on other cells (Fig I b).…”

“…In [22], a special class of nongroup CA whose statetransition diagram consists of a disjoint set of (inverted) trees rooted at states lying on cycles of length unity (Fig I) has been utilized efficiently to construct classifier for a predefined set of pattern classes. This has motivated us to usc the structure to design zero-aliasing space compactors in which the fault-free and the faulty responses belong to different classes.…”

Additive Cellular Automata

“…References [4,6,8,9] provide a general background in the use of cellular automata in modeling, as well as a number of examples. Specific exemplary cases of applications are found in [10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,…”

“…Among other things, cellular automata have been used to model growth and aggregation processes [9,10,11,12]; discrete reaction-diffusion systems [13,14,15,16,17]; spin exchange systems [18,19]; biological pattern formation [20,21]; disease processes and transmission [22,23,24,25,26]; DNA sequences, and gene interactions [27,28]; spiral galaxies [29]; social interaction networks [30]; and forest fires [31,32]. They have been used for language and pattern recognition [33,34,35,36,37,38,39]; image processing [40,41]; as parallel computers [42,43,44,45,46,47]; parallel multipliers [48]; sorters [49]; and prime number sieves [50]. In recent years, cellular automata have become important for VLSI logic circuit design [51].…”