Synthesis of one-dimensional linear hybrid cellular automata
Kevin Cattell, Jon C. Muzio · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1996
This paper presents a method for the synthesis of a one-dimensional linear hybrid cellular automaton (CA) from a given irreducible polynomial. A detailed description of the algorithm is given, together with an outline of the theoretical background. It is shown that two CA exist for each irreducible polynomial, solving the previously open CA existence conjecture. An in-depth example of the synthesis is presented, along with timing benchmarks and an operation count. The algorithm solves the previously open problem of synthesizing CA for all practical applications.