Skip to main content

Advertisement

Log in

Combined probabilistic testability calculation and compact test generation for PLAs

  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

PLAs (programmable logic arrays) may be tested internally by self-test, or externally by applying test patterns. Fault coverage by nonexhaustive self-test is assured by computing a lower bound for estimated fault coverage vs. test pattern number. First, a lower bound for probabilistic detectability per fault is computed by a method based on Shannon's expansion theorem. In the process of finding a lower bound detectability for a particular fault, a test pattern for the fault is generated automatically, at no extra cost. These patterns often contain several don't cares. Traditional test pattern compaction is then applied to the test pattern set. In addition, a novel test pattern compaction method is introduced, suitable for embedded circuitry. The method may be used in conjunction with a serial scan architecture, whereby each test pattern is shifted one position before being applied to the circuit under test. The compaction scheme was applied to a benchmark set of 53 PLAs. An average reduction of 70% in the number of test bits and clock cycles was achieved.1

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E.J. Aas and M.R. Mercer, “Algebraic and structural computation of signal probability in combinational circuits,” Proc. 17th Int'l. Symp. on Fault-Tolerant Computing, July 1987.

  2. E.J. Aas and M.R. Mercer, “On statistical estimation of fault coverage,” Technical Report DCI-8552537.041187, Dept. of Elect. & Comp. Eng., University of Texas at Austin, April 1987, 24 pp.

  3. V.D. Agrawal and S.C. Seth, “Probabilistic testability,” Proc. 1985 Int'l. Conf. on Circuits and Devices, pp. 562–565, Oct. 1985.

  4. V.D. Agrawal, S.C. Seth and C.C. Chuang, “Probabilistically guided test generation,” Proc. 1985 Int'l. Conf. on Circuits and Systems, pp. 687–690.

  5. V.D. Agrawal and D.D. Johnson, “Logic modeling of PLA faults,” Proc. Int'l Conf. on Computer Design, pp. 86–88, Oct. 1986.

  6. P.H. Bardell and W.H. McAnney, “Simultaneous Self-Testing System,” U.S. Patent 4,513,418, April 23, 1985.

  7. R.W. Bassett et al., “Low-cost testing of high-density logic components,” IEEE Design & Test of Computers, pp. 15–28, April 1991.

  8. S. Chakravarty, “A note on random versus deterministic testing,” Proc. 1987 Int'l. Conf. on Computer-Aided Design, pp. 152–155.

  9. S. Chakravarty and H.B. HuntIII, “On computing signal probability and detection probability of stuck-at faults,” IEEE Trans. Computers, C-39: 1369–1377, Nov. 1990.

    Google Scholar 

  10. O.E. Cornelia and V.K. Agarwal, “Test generation for embedded PLAs,” CH2469-5/87, pp. 152–155.

  11. R. David and G. Blanchet, “About random fault detection of combinational networks,” IEEE Trans. on Comp., pp. 659–664, June 1975.

  12. D.L. Dietmeyer, “Logical design of digital systems,” Second ed., Boston: Allyn and Bacon, 1978.

    Google Scholar 

  13. E.B. Eichelberger and T.W. Williams, “A logic design structure for LSI testing,” Proc. 14th Design Automation Conf., pp. 462–468, June 1977.

  14. S. Ercolano et al., “Estimate of signal probability in combinational logic networks,” Proc. 1st European Test Conf., pp. 132–138, April 1989.

  15. A.V. Goldberg and K.J. Lieberherr, “Efficient test generation algorithms,” Proc. 1985 Int'l. Test Conf., pp. 508–516, Nov. 1985.

  16. W.K. Huang, M. Lightner and F. Lombardi, “Predicting fault coverage for random testing of combinational circuits,” Proc. Int'l. Test Conf., pp. 843–848, Sept. 1987.

  17. S.K. Jain and V.D. Agrawal, “STAFAN: An alternative to fault simulation,” Proc. 21st Design Automation Conf., pp. 18–23, June 1984.

  18. S.K. Jain and V.D. Agrawal, “Statistical fault analysis,” IEEE Design and Test of Computers, 2: 38–44, Feb. 1985.

    Google Scholar 

  19. B. Jonsson, “Exact calculation of fault detectability in PLAs,” Master Thesis, University of Texas at Austin, Sept. 1987.

  20. A. Krasniewski and S. Pilarski, “Circular Self-Test Path: A low cost BIST technique for VLSI circuits,” IEEE Trans. on CAD, 8: 46–55, Jan. 1989.

    Google Scholar 

  21. R. Lisanke, F. Brglez, A. de Geus and D. Gregory, “Testability-driven random pattern generation,” Proc. 1986 Int'l. Test Conf., pp. 144–147, Sept. 1986.

  22. C. Maunder and F. Beenker, “Boundary Scan, a framework for structured DFT” Proc. 1986 Int'l. Test Conf., pp. 714–723, Sept. 1986.

  23. E.J. McCluskey, S. Makar, S. Mourad and K.D. Wagner, “Probability Models for Pseudorandom Sequences,” IEEE Trans. on CAD, 7: 68–74, Jan. 1988.

    Google Scholar 

  24. K.P. Parker and E.J. McCluskey, “Probabilistic treatment of general combinational networks,” IEEE Trans. Computers, C-24: 668–670, June 1975.

    Google Scholar 

  25. K.P. Parker and E.J. McCluskey, “Analysis of logic circuits with faults using input signal probabilities,” IEEE Trans. Computers, C-24: 573–578, May 1975.

    Google Scholar 

  26. J. Rajski and J. Vasudevamurthy, “Testability preserving transformations in multi-level logic synthesis,” Proc. Int'l. Test Conf., pp. 265–273, Sept. 1990.

  27. B. Reppen and E.J. Aas, “Probabilistic testability and test pattern generation for PLAs,” ELAB-RUNIT report STF40 A90106, ISBN no. 82-595-6109-3, June 1990, 32 pp.

  28. M. Robinson and J. Rajski, “An algorithmic branch and bound method for PLA test pattern generation,” Proc. Int'l. Test Conf., pp. 784–795, Sept. 1988.

  29. J. Salick, B. Underwood, J. Kuban and M.R. Mercer, “An automatic test pattern generation algorithm for PLAs,” Proc. ICCAD, Nov. 1986.

  30. J. Savir, G.S. Ditlow, and P.H. Bardell, “Random Pattern Testability,” IEEE Trans. Computers, C-33: 79–90, Jan. 1984.

    Google Scholar 

  31. S.C. Seth, L. Pan and V.D. Agrawal, “PREDICT—Probabilistic estimation of digital circuit testability,” Proc. 15th Int'l. Symp. on Fault-Tolerant Computing, pp. 220–225, June 1985.

  32. S.C. Seth, B.B. Battacharya and V.D. Agrawal, “An exact analysis for efficient computation of random-pattern testability in combinational circuits,” Proc. 16th Int'l. Symp. on Fault-Tolerant Computing, pp. 318–323, July 1986.

  33. K. Wagner, C. Chin and E. McCluskey, “Fault coverage of pseudorandom testing,” Proc. Int'l. Conf. on CAD, pp. 48–51, Nov. 1986.

  34. R.S. Wei and A. Sangiovanni-Vincentelli, “PLATYPUS: A PLA test pattern generation tool,” Proc. 22nd Design Automation Conf., pp. 197–203, June 1985.

  35. H.J. Wunderlich, “PROTEST: A tool for probabilistic testability analysis,” Proc. 22nd Design Automation Conf., pp. 204–211, June 1985.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was done while B. Reppen was with the Norwegian Institute of Technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reppen, B., Aas, E.J. Combined probabilistic testability calculation and compact test generation for PLAs. J Electron Test 2, 215–227 (1991). https://doi.org/10.1007/BF00135439

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation