Abstract
This article presents a new method to generate test patterns for multiple stuck-at faults in combinational circuits. We assume the presence of all multiple faults of all multiplicities and we do not resort to their explicit enumeration: the target fault is a single component of possibly several multiple faults. New line and gate models are introduced to handle multiple fault effect propagation through the circuits. The method tries to generate test conditions that propagate the effect of the target fault to primary outputs. When these conditions are fulfilled, the input vector is a test for the target fault and it is guaranteed that all multiple faults of all multiplicities containing the target fault as component are also detected. The method uses similar techniques to those in FAN and SOCRATES algorithms to guide the search part of the algorithm, and includes several new heuristics to enhance the performance and fault detection capability. Experiments performed on the ISCAS'85 benchmark circuits show that test sets for multiple faults can be generated with high fault coverage and a reasonable increase in cost over test generation for single stuck-at faults.
Similar content being viewed by others
References
H. Fujiwara, “Computational complexity of controllability/observability problems for combinational circuits,”Proc. of the 18th Fault-Tolerant Computing Symp., pp. 46–69, 1988.
O.H. Ibarra and S.K. Sahni, “Polynomially Complete Fault Detection Problems,”IEEE Trans. on Computers, vol. C-24, pp. 242–249, March 1975.
Y. Karkouri and E.M. Aboulhamid, “Complexité du test des circuits logiques,”Technique et Science Informtiques, vol. 9, pp. 273–287, April 1990.
M.A. Breuer and A.D. Friedman,Diagnosis & Reliable Design of Digital Systems, Computer Science Press, 1976.
J.P. Shen, W. Maly, and F.J. Ferguson, “Inductive fault analysis of MOS integrated circuits,”IEEE Design & Test of Computers, vol. 2, pp. 13–26, February 1985.
E.J. McCluskey and F.W. Clegg, “Fault equivalence in combinational logic networks,”IEEE Trans. on Computers vol. C-20, pp. 1286–1293, November 1971.
M. Abramovici, M.A. Breuer, and A.D. Freidman,Digital Systems Testing and Testable Design, Computer Science Press, 1990.
J.P. Hayes “A NAND model for fault diagnosis in combinational logic networks,”IEEE Trans. on Computers, vol. C-20, pp. 1496–1506, December 1971.
D.R. Schertz and G. Metze, “On the design of multiple faults diagnosable networks,”IEEE Trans. on Computers, vol. C-20, pp. 1361–1364, November 1971.
I. Kohavi and Z. Kohavi, “Detection of multiple faults in combinational logic networks,”IEEE Trans. on Computers, vol. C-21, pp. 556–568, 1972.
F.J.O. Dias, “Fault masking in combinatorial logic circuits,”IEEE Trans. on Computers vol. C-24, pp. 476–482, June 1975.
J.E. Smith, “On necessary and sufficient conditions for multiple fault undetectability,”IEEE Trans. on Computers, vol. C-28, pp. 801–802, October 1979.
V.K. Agarwal and A.S.F. Fung, “Multiple fault testing of large circuits by single fault test sets,”IEEE Trans. on Computers, vol. C-30, pp. 855–865, November 1981.
J.L.A. Hughes and E.J. McCluskey, “Multiple stuck-at fault converage of single stuck-at fault test sets,”Proc. of the Intl. Test Conf., pp. 368–374, 1986.
J. Jacob and N.N. Biswas, “GTBD faults and lower bounds on multiple fault coverage of single fault test sets,”Proc. of the Intl. Test Conf., pp. 849–855, 1987.
K. Kubiak adn W.K. Fuchs, “Multiple-fault simulation and coverage of deterministic single-fault test sets”Proc. of the Intl. Test Conf., pp. 956–962, 1991.
J.L.A. Hughes, “Multiple fault detection using single fault test sets,”IEEE Trans. on Computer-Aided Design., vol. 7, pp. 100–108, January 1988.
A.D. Friedman, “Fault detection in redundant circuits,”IEEE Trans. Elect. Comput. vol. EC-16, pp. 99–100, February 1967.
D.C. Bossen and S.J. Hong, “Cause-effect analysis for multiple fault detection in combinational networks,”IEEE Trans. on Computers, vol. C-20, pp. 1252–1275, November 1971.
C.W. Cha, “Multiple fault diagnosis in combinational networks,”Proc. of the 16th Design Automation Conf., pp. 149–155, 1979.
Y. Huan and S.Q. Li, “The “G-F” 2-valued formula generating complete set of tests for multiple faults,”Proc. of the Intl. VLSI Conf., pp. 343—349, 1991.
M. Abramovici and M.A. Breuer, “Multiple fault diagnosis in combinational circuits based on an effect-cause analysis,”IEEE Trans. on Computers, vol. C-29, pp. 451–460, June 1980.
H. Cox and J. Rajski, “A method of fault analysis for test generation and fault diagnosis,”IEEE Trans. on Computer-Aided Design, vol. 7, pp. 813–833, July 1988.
A. Verrault, E.M. Aboulhamid, and Y. Karkouri, “Multiple fault analysis using a fault dropping technique,”Proc. of the 21st Fault-Tolerant Computing Symp., pp. 162–169, 1991.
J.P. Roth, W.G. Bouricius, and P.R. Shneider, “Programmed algorithms to computer tests to detect and distinguish between failures in logic circuits,”IEEE Trans. on Elect. Comput., vol. EC-16, pp. 567–580, May 1967.
H. Fujiwara and T. Shimono, “On the acceleration of test generation algorithms,”Proc. of the 13th Fault-Tolerant Computing Symp., pp. 98–105, 1983.
M.H. Schultz, E. Trischler, and T.M. Sarfert, “SOCRATES: a highly efficient automatic test pattern generation system,”IEEE Trans. on Computer-Aided Design, vol. 7, pp. 126–137, January 1988.
F. Brglez and H. Fujiwara, “A neutral netlist of 10 combinational benchmark circuits and a target translator in fortran,”Proc. of the Int. Symp. Circuits and Systems 1985.
Y. Karkouri, E.M. Aboulhamid, and E. Cerny, “On the Generation of Test Patterns for Multiple Faults,” Dep. IRO, Université de Montréal, T.R. #833, August 92.
P. Goel, “An implicit enumeration algorithm to generate tests for combinational logic circuits,”IEEE Trans. on Computers, vol. C-30, pp. 215–222, March 1981.
Y. Karkouri and E.M. Aboulhamid, “Multiple stuck-at fault diagnosis in logic circuits,”Proc. of the Canadian Conf. on VLSI, 1992.
M. Abramovici, J.J. Kulikowski, P.R. Menon, and D.T. Miller, “SMART and FAST: test generation for VLSI scan-design circuits,”IEEE Design & Test of Computers, pp. 43–54, August 1986.
L.H. Goldstein and E.L. Thigpen, “SCOAP: Sandia controllability/observability analysis program,”Proc. of the 17th Design Automation Conf., pp. 190–196, 1980.
H. Cox, A. Ivanov, V.K. Agarwal and J. Rajski, “On multiple fault coverage and aliasing probability measures,”Proc. of the Int. Test Conf., pp. 314–321, 1988.
J. Rajski and H. Cox, “A method to calculate necessary assignments in algorithmic test pattern generation,”Proc. of the Int. Test Conf., pp. 25–34, 1990.
I. Pomeranz, L.N. Reddy, and S.M. Reddy, “COMPACTEST: A method to generate compact test sets for combinational circuits,”Proc. of the IEEE Int. Test Conf., pp. 194–203, 1991.
J. Rajski and H. Cox,Personal Communication, 1990.
M.H. Schultz and E. Auth, “Improved deterministic test pattern generation with applications to redundancy identification,”IEEE Trans. on Computer-Aided Design, vol. 7, pp. 126–137, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aboulhamid, E.M., Karkouri, Y. & Cerny, E. On the generation of test patterns for multiple faults. J Electron Test 4, 237–253 (1993). https://doi.org/10.1007/BF00971973
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00971973