Document Type

Article

Publication Title

Journal of Electronic Testing: Theory and Applications (JETTA)

Abstract

The testability of a class of regular circuits called divergent trees is investigated under a functional fault model. Divergent trees include such practical circuits as decoders and demultiplexers. We prove that uncontrolled divergent trees are testable with a fixed number of test patterns (C-testable) if and only if the module function is surjective. Testable controlled trees are also surjective but require sensitizing vectors for error propagation. We derive the conditions for testing controlled divergent trees with a test set whose size is proportional to the number of levels p found in the tree (L-testability). By viewing a tree as overlapping arrays of various types, we also derive conditions for a controlled divergent tree to be C-testable. Typical decoders/demultiplexers are shown to only partially satisfy L- and C-testability conditions but a design modification that ensures L-testability is demonstrated

First Page

197

Last Page

209

DOI

10.1023/A:1008262321471

Publication Date

1-1-1997

Included in

Virology Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.