An accurate probabilistic model for error detection

Proceedings of the IEEE International Conference on VLSI Design

Volumn , Issue , 2005, Pages 717-722

  Rejimon, Thara ^a   Bhanja, Sanjukta ^a  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETECTION PROBABILITIES; ESTIMATION TIME;

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; NETWORKS (CIRCUITS);

PROBABILITY;

EID: 27944486186     PISSN: 10639667     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICVD.2005.46     Document Type: Conference Paper

References (17)

1. K. Mohanram and N. A. Touba, "Cost-Effective Approach for Reducing Soft Error Failure Rate in Logic Circuits," International Test Conference, 2003, pp. 893-901.
2. D. Alexandrescu, L. Anghel and M. Nicolaidis, New Methods for Evaluating the Impact of Single Event Transients in VDSM ICs, Proc. Defect and Fault Tolerance Symposium, 2002, pp. 99-107.
3. P. Shivakumar, et al., Modeling the Effect of Technology Trends on the Soft Error Rate of Combinational Logic, Proc. International Conference on Dependable Systems and Networks, 2002, pp. 389-398.
4. R. Krieger, B. Becker and R. Sinkovic, "A BDD-based Algorithm for computation of exact fault detection probabilities," Digest of Papers, Fault-Tolerant Computing, vol. 22-24, June 1993, pp. 186-195.
5. J. Cheng, "Efficient Stochastic Sampling Algorithms for Bayesian Networks," Ph.D Dissertation, University of Pittsburgh, 2001.
6. M. Henrion, "Propagation of uncertainty by probabilistic logic sampling in Bayes' networks," Uncertainty in Artificial Intelligence, 1988.
7. S. Bhanja and N. Ranganathan, "Dependency preserving probabilistic modeling of switching activity using Bayesian networks" Design Automation Conference, Jun. 2001.
8. J. Pearl, "Probabilistic Reasoning in Intelligent Systems: Network of Plausible Inference," Morgan Kaufmann Publishers, Inc., 1988.
9. Y. Fang and A. Albicki, "Efficient testability enhancement for combinational circuits," Proceedings of the International Conference on Computer Design, vol. 2-4, pp. 168-172, 1995.
10. W-B. Jone and S. R. Das, "CACOP-a random pattern testability analyzer," IEEE Transactions on Man and Cybernetics, vol. 25-5 pp. 865-871, 1995.
11. B. P. Philips, "On computing the detection probability of stuck-at faults in a combinational circuit," IEEE system readiness Technology Conference, vol. 24-26, Sep. 1991, pp. 301-305.
12. S. C. Seth, L. Pan, and V. D. Agrawal, "Predict - probabilistic estimation of digital circuit testability," IEEE International Symposium on Fault-Tolerant Computing, Jun. 1985, pp. 220-225.
13. H. Farhat, A. Lioy and M. Pocino, "Computation of exact random pattern detection probability," Proceedings of IEEE Custom Integrated Circuits conference, vol. 9-12, May 1993, pp. 26.7.1-26.7.4.
14. H. J. Wunderlich, "PROTEST: A Tool for probabilistic testability Analysis," Proceedings of the 22nd IEEE Design Automation conference, vol. 14-3, 1985, pp. 204-211.
15. S. Chakravarty and H. B. hunt, III, "On computing signal probability and detection probability of stuck-at faults," IEEE Transactions on Computers, vol. 39-11, Nov. 1990pp. 1369-1377.
16. R. Pathak, "A generalized algorithm for bounding fault detection probabilities in combinational circuits," AUTOTESTCON, Proceedings of IEEE Systems Readiness Technology Conference, vol. 20-23, Sep. 1993, pp. 683-689.
17. J. Savir and G. S.Ditlow, and P. H. Bardell, "Random pattern testability," IEEE Transactions on Computers, vol. C-33, Mar. 1984, pp. 79-90.