Reconfiguration for Repair in a Class of Universal Logic Modules

Abstract

A class of universal finite-state machine structures employing arrays of identical modules is shown to be capable of dynamic repair by the process of reconfiguration. Coverage on the order of 98 percent of all stuck-at faults is demonstrated with no redesign of the array being necessary. After specifying a formal model for the array structure, a complete theory is developed capable of determining the minimal number of configurations necessary to obtain maximal coverage of stuck-at faults without redesigning the network. Inherent redundancy in the array structure results in this unusual capability. Many faults are also tolerated in each system configuration.