Abstract
A testable design of a programmable m-out-of-n code checker is reported in this paper. The checker is modular in nature and can be easily extended by cascading. Basically, a cellular automaton (CA) structure is taken whose combinational logic port (CL-part) is modified in such a way that all the 1's in the initial state (seed) get accumulated in the rightmost cells. This CA is then transformed into an iterative array of combinational logic cells. To make the resulting structure testable for all stuck-at and unidirectional faults, it is partitioned into a number of identical blocks the outputs of which are combined to produce two complementary outputs.