Statistical test compaction using binary decision trees

被引:42
|
作者
Biswas, Sounil [1 ]
Blanton, Ronald D. [1 ]
机构
[1] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
来源
IEEE DESIGN & TEST OF COMPUTERS | 2006年 / 23卷 / 06期
关键词
D O I
10.1109/MDT.2006.154
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Because of the significant cost of explicitly testing an integrated, heterogeneous device for all its specifications, there is a need for a test methodology that minimizes test cost while maintaining product quality and limiting yield loss. The authors are developing a decision-tree-based statistical-learning methodology to compact the complete specification-based test set of an integrated device by eliminating redundant tests. A test is deemed redundant if its output can be reliably predicted using other tests that are not eliminated. To ensure the required accuracy for commercial devices, the authors employ a number of modeling and data-massaging techniques to reduce prediction error. Test compaction results produced for a commercial MEMS accelerometer are promising in that they indicate it is possible to eliminate an expensive mechanical test. © 2006 IEEE.
引用
收藏
页码:452 / 462
页数:11
相关论文
共 50 条
  • [1] Test response compaction using multiplexed parity trees
    Chakrabarty, K
    Hayes, JP
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1996, 15 (11) : 1399 - 1408
  • [2] Constructing binary decision trees by using genetic algorithm
    Jisuanji Yanjiu yu Fazhan, 11 (1323-1328):
  • [3] NONPARAMETRIC CLASSIFICATION USING MATCHED BINARY DECISION TREES
    SHLIEN, S
    PATTERN RECOGNITION LETTERS, 1992, 13 (02) : 83 - 87
  • [4] Learning Local Image Descriptors Using Binary Decision Trees
    Ylioinas, Juha
    Kannala, Juho
    Hadid, Abdenour
    Pietikainen, Matti
    2014 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV), 2014, : 347 - 354
  • [5] Learning grammatical structure using statistical decision-trees
    Magerman, D.M.
    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 1147
  • [6] The Depth of Decision Trees for Binary Problems
    Moshkov, M. Yu.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2007, 62 (03) : 108 - 111
  • [7] Approximating Optimal Binary Decision Trees
    Micah Adler
    Brent Heeringa
    Algorithmica, 2012, 62 : 1112 - 1121
  • [8] SYNTHESIS OF MINIMAL BINARY DECISION TREES
    CERNY, E
    MANGE, D
    SANCHEZ, E
    IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (07) : 472 - 482
  • [9] Approximating Optimal Binary Decision Trees
    Adler, Micah
    Heeringa, Brent
    APPROXIMATION RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2008, 5171 : 1 - +
  • [10] Approximating Optimal Binary Decision Trees
    Adler, Micah
    Heeringa, Brent
    ALGORITHMICA, 2012, 62 (3-4) : 1112 - 1121