The Community for Technology Leaders
2013 IEEE 31st VLSI Test Symposium (VTS) (1996)
Princeton, NJ
Apr. 28, 1996 to May 1, 1996
ISBN: 0-8186-7304-4
pp: 174
I. Hartanto , Coordinated Sci. Lab., Illinois Univ., Champaign, IL, USA
W.K. Fuchs , Coordinated Sci. Lab., Illinois Univ., Champaign, IL, USA
V. Boppana , Coordinated Sci. Lab., Illinois Univ., Champaign, IL, USA
ABSTRACT
The process of fault dictionary compaction can lead to a loss of information that is potentially useful in locating unmodeled failures. The focus of this paper is on developing alternative storage structures that can efficiently represent full fault dictionaries without discarding any information. We present the problem of storing the full fault dictionary storage as a labeled tree encoding problem. Two labeled trees are introduced to represent the diagnostic experiment. For the first tree, the unlabeled tree is stored using a binary string code, while the second tree is constructed so that the unlabeled tree is regular in structure, thus allowing implicit storage. Eight alternative representations based on the three label components are presented and two existing full fault dictionary representations (the matrix and the list dictionaries) are shown to be special cases in our general framework. Experimental results on the ISCAS 85 and ISCAS 89 circuits are used to study and characterize the performance of the proposed storage structures.
INDEX TERMS
encoding; fault diagnosis; logic testing; VLSI; integrated circuit testing; automatic testing; digital storage; fault trees; circuit analysis computing; full fault dictionary storage; labeled tree encoding; fault dictionary compaction; binary string code; implicit storage
CITATION
I. Hartanto, W.K. Fuchs, V. Boppana, "Full fault dictionary storage based on labeled tree encoding", 2013 IEEE 31st VLSI Test Symposium (VTS), vol. 00, no. , pp. 174, 1996, doi:10.1109/VTEST.1996.510854
105 ms
(Ver 3.3 (11022016))