Concatenable cellular automata register design for built-in self-test

The paper describes the principles of concatenations of cellular automata based LFSRs (MISR). It proves some theorems and lemmas which show if a certain cellular automata based register has a reducible polynomial of the form xg(x) or (x+l)h(x). Further it answers the question how to find a minimal set of standard CAD system cells to permit the construction of various length and various primitive characteristic polynomial cellular automata based LFSRs (MISRs). The paper also lists many examples of d-bit sliced cellular automata register families which allow for the building of concatenations having primitive polynomials.