Undetectability of bridging faults and validity of stuck-at fault test sets
MetadataShow full item record
Kodandapani, K.L.; Pradhan, D.K.; , "Undetectability of Bridging Faults and Validity of Stuck-At Fault Test Sets," Computers, IEEE Transactions on , vol.C-29, no.1, pp.55-59, Jan. 1980 doi: 10.1109/TC.1980.1675457
The study of bridging faults (or short circuits that occur between conducting paths) has become increasingly important with the advent of LSI technology. To date, only a very few papers have been published on this topic. Specifically, little is known regarding undetectable bridging faults. More importantly, what has yet to be explored are the effects of undetectable bridging faults on the tests designed to detect stuck-at faults.
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954
Showing items related by title, author, creator and subject.
Kodandapani, K.L.; Seth, S.C. (IEEE, 1978-04)Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free ...
Kodandapani, K.L.; Setlur, R.V. (IEEE, 1978-11)An algebraic generalization of the well-known binary q-function array to a multivalued q-function array is presented. It is possible to associate tree-structure realizations for binary q-functions and multivalued q-functions. ...
Egbert, Robert I (IEEE, 1986-01-01)