Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic Networks
- 1 July 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (7) , 691-695
- https://doi.org/10.1109/t-c.1975.224289
Abstract
In this paper the random test generation method for large logic circuits is analyzed. Formulas for the detection probability and the number of random input patterns required to complete the test generation with a high probability are obtained for an irredundant fan-out-free combinational network tree consisting of identical n-input NAND gates. The quantitative estimates for the number of random input patterns required for test generation appear to depend upon the number of levels in the circuit and the fan-ins of the gates. Experimental results for actual computer logic circuits are given and show the validity of the approach.Keywords
This publication has 9 references indexed in Scilit:
- Fault Detection in Fanout-Free Combinational NetworksIEEE Transactions on Computers, 1973
- Diagnostics for logic networksIEEE Spectrum, 1973
- An Automatic Test Generation System for Illiac IV Logic BoardsIEEE Transactions on Computers, 1972
- A Nand Model ror Fault Diagnosis in Combinational Logic NetworksIEEE Transactions on Computers, 1971
- A Random and an Algorithmic Technique for Fault Detection Test Generation for Sequential CircuitsIEEE Transactions on Computers, 1971
- Algorithms for Detection of Faults in Logic CircuitsIEEE Transactions on Computers, 1971
- Analyzing Errors with the Boolean DifferenceIEEE Transactions on Computers, 1968
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic NetsIEEE Transactions on Electronic Computers, 1966