This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design of Totally Fault Locatable Combinational Networks
January 1980 (vol. 29 no. 1)
pp. 33-44
A. Goundan, General Electric Company, Department of Ground Systems
The design of combinational logic networks is considered in which equivalent or indistinguishable stuck-type faults are confined to a small region of the network. A general type of fault equivalence called S-equivalence is introduced, which defines fault equivalence with respect to an arbitrary set of modules S. A network N is called totally fault locatable with respect to module set S, denoted TFLS, if all specified faults in N are S-equivalent. Some general structural properties of TFLS networks are derived. The problem of designing TFLS networks is investigated for S = {AND, OR, NAND, NOR, NOT} denoted AON, and S = {AON, EXCLUSIVE- OR} denoted AONE. All equivalent fault classes in TFLAON and TFLAONE networks can be identified by inspection. It is shown that every function has a TFLAONE network, that is, a realization where all equivalence classes can be identified by inspection, containing at most one control point or extra input. A method for constructing a TFLAONE realization of an arbitrary function is presented using at most one control point.
Index Terms:
totally fault locatable networks, Combinational networks, easily testable networks, fault diagnosis, fault equivalence, logic design
Citation:
A. Goundan, J.P. Hayes, "Design of Totally Fault Locatable Combinational Networks," IEEE Transactions on Computers, vol. 29, no. 1, pp. 33-44, Jan. 1980, doi:10.1109/TC.1980.1675454
Usage of this product signifies your acceptance of the Terms of Use.