Accession Number : AD0777609

Title :   A General Algorithm for the Realization of Multiple Fault Detectable Networks,

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Taska,John Lawrence

Report Date : SEP 1973

Pagination or Media Count : 73

Abstract : The study of fault diagnosis of digital systems has been steadily gathering momentum for the past decade. Recently there have been several successful attempts to identify and characterize diagnostically desirable structures which may be worked into the system during the design phase. Of particular interest are the system design rules developed by Schertz and Metze for the generation of combinational networks with desirable diagnostic qualities. These design rules call for the system to be designed using particular structural blocks called restrictive fanout-free networks. The most general form of such a network is called an extended cascade. Networks designed in such a manner have the important property that any complete single fault test set (CSFTS) will necessarily detect all possible multiple faults which may occur. It is the purpose of this report to present a heuristic for the realization of single and multiple output extended cascade networks together with an algorithm for the generation of a CSFTS for these networks that is also a complete multiple fault test set (CMFTS).

Descriptors :   *LOGIC CIRCUITS, FAULTS, GATES(CIRCUITS), NETWORKS, COMPUTER PROGRAMS, THESES

Subject Categories : Computer Programming and Software
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE