Primitive cellular automata, threshold decomposition, and ranked order operations

A connection between ranked filters and primitive cellular automata is discussed. Primitive cellular automata are those whose nodes comprise a single bit of state information. It is shown that these structures can perform ranked order operations on one-dimensional k-level signals by virtue of threshold decomposition. Extensions to the case of multidimensional signals are also possible.<
>