MINT-An Exact Algorithm for Finding Minimum Test Set (Special Section on VLSI Design and CAD Algorithms)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, an exact algorithm for finding minimum test set which detects all testable stuck-at faults of a given combinational circuit is presented. So far several heuristic algorithms for this problem are proposed, but no efficient exact algorithms are known. To solve this exactly, minimum test set problem is formalized as a minimum set covering problem, and then implicit manipulation technique using binary decision diagrams (BDDs) is applied. The algorithm presented in the paper has two contributions. One is utilization of maximal compatible fault set, which can drastically reduce the number of candidates for minimum test set. A new BDD based algorithm for extracting all maximal compatible fault sets is shown. The other is a new implicit manipulation technique handling with huge covering matrix. Actually, the algorithm using this technique can handle minimum set covering problem with over ten thousand columns in a few minutes. Experiments using ISCAS benchmark circuits show that the algorithm is quite efficient for small (100 -300 gates) circuits. A computational complexity of minimum test set problem is much higher than that of ordinary test pattern generation problem, so that practical significance of this method is not high. But the algorithm is still useful for evaluation of other heuristic algorithms, furthermore, this implicit manipulation technique can also be applied to other minimum set covering problems.

• 一般社団法人電子情報通信学会の論文
• 1993-10-25

著者

• Matsunaga Yusuke

  Fujitsu Laboratories Ltd

• Matsunaga Yusuke

  FUJITSU LABORATORIES LTD.,

関連論文

• Phase Optimization in Technology Mapping
• Enhanced Unique Sensitization for Efficient Test Generation (Special Issue on Synthesis and Verification of Hardware Design)
• Robust Heuristics for Multi-Level Logic Simplification Considering Local Circuit Structure (Special Section on VLSI Design and CAD Algorithms)
• An Iterative Improvement Method for State Minimization of Incompletely Specified Finite State Machines (Special Issue on Synthesis and Verification of Hardware Design)
• A New Algorithm for Boolean Matching Utilizing Structural Information : PAPER Special Issue on Synthesis and Verification of Hardware Design
• MINT-An Exact Algorithm for Finding Minimum Test Set (Special Section on VLSI Design and CAD Algorithms)

スポンサーリンク