An algorithmic branch and bound method for PLA test pattern generation
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10893539,p. 784-795
- https://doi.org/10.1109/test.1988.207865
Abstract
A method for PLA (programmable logic-array) test-pattern generation based on a branch-and-bound algorithm that function monotonicity is presented. The algorithm makes irrevocable input assignments first, resulting in the efficient generation of compact test sets. In most cases there is no backtracking. An intelligent branching heuristic is presented. The algorithm handles extended fault models, including cross-point and delay faults. Heuristics which speed up test-set generation and improve test-set compaction are discussed. Results of tests on a wide range of benchmark PLAs are included.<>Keywords
This publication has 6 references indexed in Scilit:
- Deductive Fault Simulation of Internal Faults of Inverter-Free Circuits and Programmable Logic ArraysIEEE Transactions on Computers, 1986
- The Influence of Masking Phenomenon on Coverage Capability of Single Fault Test Sets in PLA'sIEEE Transactions on Computers, 1986
- PART: Programmable Array Testing Based on a Partitioning AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Detection of Faults in Programmable Logic ArraysIEEE Transactions on Computers, 1979
- Fault Analysis and Test Generation for Programmable Logic Arrays (PLA's)IEEE Transactions on Computers, 1979