## Abstract

An algorithm for generating test sets to detect all the multiple stuck-at-faults in combinational logic circuits is presented. This algorithm generates a test set using a set of functions, called representative functions, which consists of much fewer functions than all possible multiple stuck-at fault functions, but is sufficient for test generation. Two different methods of finding such a set of representative functions are presented. The test sets derived from the set of representative functions obtained by the first method will be smaller than that by the second method, but the second method is much simpler than the first especially for highly redundant circuits. Nevertheless, the complexity of this algorithm using the first method is about the same as that of Bossen and Hong's algorithm which is the simplest existing algorithm under the multiple stuck-at fault assumption, and yet the number of tests in a test set generated will always be smaller for redundant circuits and the same for irredundant circuits as that generated by Bossen and Hong's algorithm for irredundant circuits.

Original language | English (US) |
---|---|

Pages (from-to) | 233-242 |

Number of pages | 10 |

Journal | IEEE Transactions on Computers |

Volume | C-24 |

Issue number | 3 |

DOIs | |

State | Published - Mar 1975 |

Externally published | Yes |

## Keywords

- Algorithms
- combinational logic circuits
- fault detections
- fault functions
- multiple stuck-at faults
- redundant circuits
- representative sets

## ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics