Skip to main content
Log in

Energy minimization and design for testability

  • Design and Synthesis for Testability
  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. O.H. Ibarra and S.K. Sahni, “Polynomially complete fault detection problems,”IEEE Trans. on Computers, vol. C-24, pp. 242–249, March 1975.

    Google Scholar 

  2. H. Fujiwara and S. Toida, “The complexity of fault detection problem for combinational circuits,”IEEE Trans. on Computers, vol. C-31, pp. 555–560, June 1982.

    Google Scholar 

  3. H. Fujiwara, “Computational complexity of controllability/observability problems for combinational circuits,”IEEE Trans. on Computers, vol. C-39, pp. 762–767, June 1990.

    Google Scholar 

  4. D.J. Rose, “On simple characterizations ofk-trees,”Discrete Mathematics, vol. 7, pp. 317–322, Feb. 1974.

    Google Scholar 

  5. A.V. Aho, J.E. Hopcropt, and J.D. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, MA, 1974.

    Google Scholar 

  6. S.T. Chakradhar, V.D. Agrawal, and M.L. Bushnell, “Polynomial Time Solvable Fault Detection Problems,”Proc. of the 20th International Symposium on Fault Tolerant Computing, pp. 56–63, June 1990.

  7. J. Williams, “K-tree circuit partitioning,” Master's thesis. Department of Electrical and Computer Eng., Rutgers University, New Brunswick, NJ, Oct. 1992.

    Google Scholar 

  8. N.S.V. Rao and S. Toida, “Computational Complexity of Test-Point Insertions and Decompositions,”Proc. of the 5th International Conf. on VLSI Design, pp. 233–238, Jan. 1992.

  9. N.S.V. Rao and S. Toida, “On Polynomial-Time Testable Classes of Combinational Circuits,” inProc. IEEE VLSI Test Symp., pp. 172–177, 1991.

  10. V.D. Agrawal and S.C. Seth,Test Generation for VLSI Chips, IEEE Computer Society Press, Los Alamitos, CA, 1988.

    Google Scholar 

  11. S.T. Chakradhar, M.L. Bushnell, and V.D. Agrawal, “Toward massively parallel automatic test generation,”IEEE Trans. on Computer-Aided Design, vol. 9, pp. 981–994, Sept. 1990.

    Google Scholar 

  12. S.T. Chakradhar, V.D. Agrawal, and M.L. Bushnell,Neural Models and Algorithms for Digital Testing, Kluwer Academic Publishers, Boston, 1991.

    Google Scholar 

  13. J.J. Hopfield, “Artificial neural networks,”IEEE Circuits and Devices Magazine, vol. 4, pp. 3–10, Sept. 1988.

    Google Scholar 

  14. S. Arnborg, D.G. Corneil, and A. Proskurowski, “Complexity of finding embeddings in ak-tree,”SIAM J. on Alg. Disc. Math., vol. 8, pp. 277–284, April 1987.

    Google Scholar 

  15. S.T. Chakradhar, M.A. Iyer, and V.D. Agrawal, “Energy Minimization Based Delay Testing,”Proc. of the European Design Automation Conf., pp. 280–284, March 1992.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chakradhar, S.T., Agrawal, V.D. & Bushnell, M.L. Energy minimization and design for testability. J Electron Test 5, 57–66 (1994). https://doi.org/10.1007/BF00971963

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00971963

Keywords

Navigation