Abstract
In this paper we analyze the problem of multiple fault detection in a network of functions (cells implementing functions). It is shown that all multiple stuck-at-faults and all single bridging faults are detected by a test set which detects all multiple faults in every cell. In general it is shown that a number of test patterns is proportional to the number of lines in a network. For homogeneous trees the number of test patterns is shown to be linear with number of input variables. Upper bounds on number of test patterns is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
