Probabilistic analysis of algorithms for stuck-at test generation in PLAs
A collection of fast algorithms for generating test vectors for PLAs is presented and analysed. It is shown that, in some sense, complete sets of test vectors for almost all such circuits which are irredundant, primal, and non-tautological can be generated quickly.
KeywordsBoolean Variable Test Vector Truth Assignment Random Instance Unit Clause
Unable to display preview. Download preview PDF.
- K. Bartlett et al., Multilevel logic minimisation using implicit don't cares, IEEE Transactions on Computer-Aided Design of Integrate Circuits and Systems, 17, 6, pp. 723–740, June, 1988.Google Scholar
- R. K. Brayton and C. McMullen and G. D. Hachtel and A. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, 1984.Google Scholar
- J. Franco, and Y. C. Ho, Probabilistic performance of a heuristic for the Satisfiability problem, Discrete Applied Mathematics, 22, pp. 35–51, 1988/89.Google Scholar
- H. Fujiwara, Logic Testing and Design for Testability, MIT Press, Cambridge MA 1985.Google Scholar
- G. D. Hachtel and R. M. Jacoby and K. Keutser and C. R. Morrison, On the relationship between area optimization and multifault testability of multilevel logic, Proceedings of the International Workshop on Logic Synthesis, June, 1989.Google Scholar
- D. S. Johnson, The NP-Completeness column: an ongoing guide, Journal of Algorithms, 6, pp. 291–305, 1985.Google Scholar
- I. Kohavi and Z. Kohavi, Detection of multiple faults in combinational logic networks, IEEE Transactions on Computers, C21, 6, pp. 556–568, June, 1972.Google Scholar
- E. J. McCluskey, Minimisation of Boolean functions, Bell Lab. Technical Journal, Bell Lab., 35, pp. 1417–1444, November, 1956.Google Scholar