### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1652-1658 |

Number of pages | 7 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E76-A |

Issue number | 10 |

Publication status | Published - Oct 1993 |

Externally published | Yes |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture
- Information Systems
- Electrical and Electronic Engineering