This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Polynomial Time Testability of Circuits Generated by Input Decomposition
February 1994 (vol. 43 no. 2)
pp. 201-210

Considers polynomial time testability of combinational circuits generated by input decomposition, especially those generated by the logic synthesis tool FACTOR. First, the complexity of the fault detection problem in this class of circuits is explored using a stuck-at fault model. An O(2/sup k/m) algorithm for detecting a single stuck-at fault is given that is faster than the O(16/sup k/m), previously reported best algorithm proposed by Fujiwara(1990), where k is the number of inputs in a subcircuit and m the number of signal lines in the circuit. Efficient, polynomial time algorithms are described for generating a test set for all single stuck-at faults in the circuit. The basic strategy is to eliminate backtracks during line justification by constructing tables or vector sets in each subcircuit, which makes the fault propagation procedure very simple and eventually results in an efficient test generation procedure. This presentation of efficient polynomial time test generation algorithms for FACTOR-generated circuits is important, since it shows that it is possible to synthesize circuits that are optimized for area and are polynomial time testable at the same time.

[1] K.A. Bartlettet al., "Multi-level logic minimization by implicit don't cares,"IEEE Trans. Computer-Aided Design, vol. CAD-7, pp. 723-740, June 1988.
[2] R. Braytonet al., "MIS: A multiple level logic optimization system,"IEEE Trans. Comput.-Aided Design, vol. CAD-6, pp. 1062-1081, Nov. 1987.
[3] S. T. Chakradhar, V. D. Agrawal, and M. L. Bushnell, "Polynomial time solvable fault detection problem," inFTCS '90, pp. 56-61.
[4] R. Dandapini and S. Reddy, "On the design of logic networks with redundancy and testability considerations,"IEEE Trans. Comput., vol. C-23, pp. 1139-1149, Nov. 1974.
[5] P. Duris, Z. Galil, and G. Schnitger, "Lower bounds on communication complexity,"Information and Computations, vol. 73, no. 1, Apr. 1987.
[6] H. Fujiwara and H. Shimono, "On the acceleration of test generation algorithms,"IEEE Trans. Computers, vol. C-32, pp. 1137-1144, Dec. 1983.
[7] H. Fujiwara, "Computational complexity of controllability/observability problems for combinational circuits,"IEEE Trans. Comput., vol. C-39, pp. 762-767, June 1990.
[8] P. Goel, "An implicit enumeration algorithm to generate tests for combinational logic circuits,"IEEE Trans. Comput., vol. C-30, pp. 215-222, Mar. 1981.
[9] G. H. Golub,Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins University Press, 1989.
[10] G. Lee, M. J. Irwin, and R. M. Owens, "Test generation in circuits constructed by input decomposition," inProc. Int. Conf. Comput. Design, 1990, pp. 107-111.
[11] T.T. Hwang, R. M. Owens, and M. J. Irwin, "Multi-level logic synthesis using communication complexity," inProc. 26th Design Automation Conf., 1989, pp. 215-220.
[12] T.-T. Hwang, R. M. Owens, and M. J. Irwin, "Exploiting communication complexity for multi-level logic synthesis,"IEEE Trans. Comput.-Aided Design, vol. 9, pp. 1017-1027, Oct. 1990.
[13] Z. Kohavi and D.A. Spires, "Designing sets of fault-detection tests for combinational logic circuits,"IEEE Trans. Comput., vol. C-20, pp. 1463-1479, Dec. 1971.
[14] E. J. McClusky and S. Bozorgui-Nesbat, "Design for autonomous test,"IEEE Trans. Comput., vol. C-31, pp. 866-875, Nov. 1981.
[15] K. Mehlhorn and E. Schmidt, "Las Vegas is better than determinism in VLSI and distributed computing," inProc. 14th STOC, 1982, pp. 330-337.
[16] N. S. V. Rao and S. Toida, "On complexity for recognizing polynomial-time testable classes of combinational circuits," Tech. Rep. 91-05, Dept. of Comp. Sci., Old Dominion University, Norfolk, VA, 1991.
[17] J. P. Roth, "Diagnosis of automata failures: A calculus and a method,"IBM J. Res. Develop., vol. 10, pp. 278-294, July 1966.
[18] J. Savir, "Syndrome-testable design of combinational circuits,"IEEE Trans. Comput., vol. C-29, June 1980, pp. 410-416.
[19] A. Yao, "The entropic limitations on VLSI computations," inProc. 13th STOC, 1981, pp. 308-311.

Index Terms:
combinatorial circuits; logic CAD; logic testing; testability; polynomial time; combinational circuits; input decomposition; logic synthesis tool; complexity; fault detection problem; stuck-at fault; test generation.
Citation:
Gueesang Lee, M.J. Irwin, R.M. Owens, "Polynomial Time Testability of Circuits Generated by Input Decomposition," IEEE Transactions on Computers, vol. 43, no. 2, pp. 201-210, Feb. 1994, doi:10.1109/12.262124
Usage of this product signifies your acceptance of the Terms of Use.