Title :
Fault covers in reconfigurable PLAs
Author :
Hasan, N. ; Liu, C.L.
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
Three kinds of faults are considered: stuck-at faults, bridging faults, and crosspoint faults. A new way of repairing bridging faults is introduced. It is shown that the problem of finding a minimum cover is NP-complete but that a special case of this problem can be formulated as a 2-SAT problem, which can be solved in polynomial time. The problem of finding a feasible cover for RPLAs (reconfigurable programmable logic arrays) with bridging faults alone is shown to be NP-complete. A necessary and sufficient condition on the number of spares for the existence of a feasible cover and an algorithm for finding a minimum feasible cover are presented.<>
Keywords :
computational complexity; fault tolerant computing; logic arrays; 2-SAT problem; NP-complete; bridging faults; crosspoint faults; fault covers; minimum cover; necessary and sufficient condition; polynomial time; programmable logic arrays; reconfigurable PLAs; reconfigurable programmable logic arrays; stuck-at faults; Bipartite graph; Computer science; Ducts; Fault detection; Logic functions; Polynomials; Production; Programmable logic arrays; Sufficient conditions; Very large scale integration;
Conference_Titel :
Fault-Tolerant Computing, 1990. FTCS-20. Digest of Papers., 20th International Symposium
Conference_Location :
Newcastle Upon Tyne, UK
Print_ISBN :
0-8186-2051-X
DOI :
10.1109/FTCS.1990.89352
