Abstract
Because of its inherent complexity, the problem of automatic test pattern generation for multiple stuck-at faults (multifaults) has been largely ignored. Recently, the observation that multifault testability is retained by algebraic factorization demonstrated that single fault (and therefore multifault) vector sets for two-level circuits could give complete multifault coverage for multilevel circuits constructed by algebraic factorization. Unfortunately, in using this method the vector set size can be much larger than what is really required to achieve multifault coverage, and the approach has some limitations in its applicability.
In this article we first present a multifault test generation and compaction strategy for algebraically factored multilevel circuits, synthesized from two-level representations. We give a basic sufficiency condition for multifault testability of such networks.
We next focus on the relationship between hazard-free robust path-delay-fault testability and multifault testability. We show that the former implies the latter for arbitrary multilevel circuits. This allows the use of previously developed composition rules that maintain path-delay-fault testability for the synthesis of multifault testable circuits.
We identify a class of multiplexor-based networks and prove an interesting property of such networks—if the networks are fully single stuck-at fault testable, or made fully single stuck-at fault testable, they are completely multifault testable. We give a multifault test generation and compaction algorithm for such networks.
We provide experimental results which indicate that a compacted multifault test set derived using the above strategies can be significantly smaller than the test set derived using previously proposed procedures. These results also indicate the substantially wider applicability of our procedures, as compared to previous techniques.
Similar content being viewed by others
References
S. Devadas and K. Keutzer, “Synthesis of robust delay-fault testable circuits: Theory,”IEEE Trans. on Computer-Aided Design, vol. 11, pp. 87–101, January 1992.
S. Devadas and K. Keutzer, “Synthesis of robust delay-fault testable circuits: Practice,”IEEE Trans. on Computer-Aided Design, vol. 11, pp. 277–300, March 1992.
S. Kundu and S.M. Reddy, “On the design of robust testable CMOS combinational logic circuits,” InProc. of the Fault tolerant Computing Symp., pp. 220–225, 1988.
A. Pramanick, S. Reddy, and S. Sengupta, “Synthesis of combinational logic circuits for path delay fault testability,” InProc. Int. Symp. on Circuits and Systems, pp. 3105–3108, May 1990.
R. Dandapani and S. Reddy, “On the design of logic networks with redundancy and testability considerations,”IEEE Trans. on Computers, vol. C23, November 1974.
G.D. Hachtel, R.M. Jacoby, K. Keutzer, and C.R. Morrison, “On properties of algebraic transformations and the synthesis of multifault-irredundant circuits,”IEEE Trans. on Computer-Aided Design, vol. 11, pp. 313–321, March 1992.
S. Kundu, S.M. Reddy, and N.K. Jha, “On the design of robust multiple fault testable CMOS combinational logic circuits,” InProc. of the Int. Conf. on Computer-Aided Design, pp. 240–243, November 1988.
N.K. Jha and S. Kundu,Testing and Reliable Design of CMOS Circuits, Boston: Kluwer Academic Publishers, 1990.
S.M. Reddy and M.K. Reddy, “Testable realization for fet stuck-open faults in CMOS combinational logic circuits,”IEEE Trans. on Computers, vol. C-35 pp. 742–754, August 1986.
John P. Hayes, “On realizations of Boolean functions requiring a minimal or near-minimal number of tests,”IEEE Trans. on Computers, vol. C20, December 1971.
S.C. Seth and K.L. Kodandapani, “Diagnosis of faults in linear tree networks,”IEEE Trans. on Comp., vol. C-26, pp. 29–33, January 1977.
I. Kohavi and Z. Kohavi, “Detection of multiple faults in combinational logic networks,”IEEE Trans. on Computers, vol. C21, pp. 556–568, June 1972.
M.A. Breuer and A.D. Friedman,Diagnosis and Reliable Design of Digital Systems, Computer Science Press, 1976.
H. Fujiwara,Logic Testing and Design for Testability. Cambridge, MA: MIT Press, 1985.
R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, “MIS: A multiple-level logic optimization system,”IEEE Trans. on Computer-Aided Design, vol. 6, pp. 1062–1081, November 1987.
M.J. Bryan, S. Devadas, and K. Keutzer, “Testability-preserving circuit transformations,” InProceedings of the Int. Conf. on Computer-Aided Design, pp. 456–459, November 1990.
D.B. Armstrong, “On finding a nearly minmal set of fault detection tests for combinational logic nets,”IEEE Trans. on Computers, vol. EC-15, pp. 66–73, February 1966.
W-N Li, S.M. Reddy, and S. Sahni, “On path selection in combinational logic circuits,”IEEE Trans. on Computer-Aided Design, vol. 8, pp. 56–63, January 1989.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
H. Cox and J. Rajski, “A method of fault analysis for test generation on fault diagnosis,”IEEE Trans. on Computer-Aided Design, vol. 7, pp. 813–833, July 1988.
M.J. Bryan, S. Devadas, and K. Keutzer, “Analysis and design of regular structures for robust dynamic fault testability,” InProceedings of the Int. Symp. on Circuits and Systems, May 1991.
C.Y. Lee, “Representation of switching circuits by binary decision programs,”Bell System Technical Journal, vol. 38, pp. 985–999, July 1959.
S.B. Akers, “Binary decision diagrams,”IEEE Trans. on Computers, vol. C-27, pp. 509–516, June 1978.
R. Bryant, “Graph-based algorithms for Boolean function manipulation,”IEEE Trans. on Computers, vol. C-35, pp. 677–691, August, 1986.
P. Ashar, S. Devadas, and K. Keutzer, “Testability properties of multilevel logic networks derived from binary decision diagrams,” InProceedings of the Santa Cruz Conference on Advanced research in VLSI, pp. 35–54, March 1991.
H-K.T. Ma and R-S. Wei, MAHJONG user's manual, University of California, Berkeley, 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Devadas, S., Keutzer, K. & Malik, S. A synthesis-based test generation and compaction algorithm for multifaults. J Electron Test 4, 91–104 (1993). https://doi.org/10.1007/BF00971942
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00971942