Skip to Main Content
This correspondence shows how recursion can be used to simplify testing of combinational circuits. Necessary and sufficient conditions for testing simple iterative arrays (one-dimensional) with a fixed number of tests (independent of the number of cells) are given. Multiple faults and diagnosis in such circuits are also studied. The extension of the concept of simple iteration to complex iteration that may realize more complex recursive functions, is defined. Examples of such complex iterative circuits are studied.