A kind of "DNA" of signal processing is constructed by a particular construction of encodings which helps to understand mechanical systems. This encoding methodology is related to cellular automata. A twin shuffle language is constructed by complementing the letters of the alphabet used to describe states of a system. This idea is used to encode time series of signals which are transformed by a corresponding twin shuffle language. The resulting encoding is related to binary cellular automaton states.Higher order integration of the evolution steps is achieved by taking differences and finding cellular automaton rules which emulate the differences as iterations of CAs. The approach is demonstrated by examples comparing random initial conditions for CAs with random signal data. Similar comparsisons study emulations of signals generated by formulas involving trigonometric functions, exponentials and special functions. Various plots illustrate particular patterns at various resolutions.
Comments