Testability Design via Testability Measures

  • Tinghuai Chen


Testability measures are used to describe the hardness (or easiness) of test generation for a logic circuit. In the analysis part we evaluate different definitions of testability from two requirements: precision and ease for computing. Postulates for an ideal definition are stated. In the synthesis part a technique for gate-level modification based on integer linear programming is proposed and experimental results are introduced. In order to reduce the number of variables, some approaches for testability measures at module-level are suggested.


Production Line Balas Mellon Compro 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.G. Bennett et al.: CAMELOT. A computer-aided measure for logic testability. Proc. IC50C80, 1980, pp. 1162–1165Google Scholar
  2. [2]
    A.M. Geoffrion: Integer programming by implicit enumeration and Balas’ Method. SIAM Rev. 9, 178–190 (1967)MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    A.M. Geoffrion: An improved implicit enumeration approach for integer programming. Operation Res. 17, 437–454 (1969)MATHCrossRefGoogle Scholar
  4. 4]
    L.H. Goldstein: Controllability/observability analysis of digital circuits. Sandia Lab. Rep. SAND 78–1895, 1978Google Scholar
  5. 5]
    L.H. Goldstein: Controllability/observability analysis of digital circuits. IEEE Trans. Circuit & Syst. CAS-26, 685–695 (1979)Google Scholar
  6. 6]
    L.H. Goldstein, E.L. Thigpen: SOOAP: Sandia controllability/observability analysis program. Proc. 17th Design Automation Conf. 1980, pp. 190–196Google Scholar
  7. 7]
    J. Grason: TMEAS, testbility measurement program. Proc. 16th Design Automation Conf. 1979, 156–161Google Scholar
  8. 8]
    W. Koiner, R. West: Testability measures. Proc. Int. Automatic Test Conf. 1977, pp. 49–55Google Scholar
  9. 9]
    H. Koike et al.: Internal testing of an 8-bit single chip CMOS/SOS microcomputer using an electron beam tester. Proc. IOOC, 1982, pp. 552–555Google Scholar
  10. 10]
    R.D. McBride: Factorization in large-scale linear programming. Ph.D. dissertation, UCLA Working Paper 200, Western Management Science Inst., 1973Google Scholar
  11. 11]
    V.G. Oklobdzija: Design for testability of VLSI structures through the use of circuit techniques. Ph.D. dissertation, UCLA, 1982, Rep.CSD 820820Google Scholar
  12. 12]
    V.G. Oklobdzija, M.D. Ercegovac: Testability enhancement for VLSI using circuit structures. Proc. ICOC, 1982, pp. 198–201Google Scholar
  13. 13]
    A.C. Parker, L. Hafer: Automating the design testable hardware. In: J. P. Gray(ed.): VLSI 81, Academic Press, 1982, pp. 357–363Google Scholar
  14. 14]
    R. A. Rutman: Fault detection test generation for sequential logic by heuristic tree search. IEEE Computer Group Repository, R72 - 187, 1972Google Scholar
  15. 15]
    J.E. Stephenson: A testability measure for register transfer level digital circuits. Ph.D. dissertation, Carnegie Mellon Univ. Dept. Electrical Eng., 1974Google Scholar
  16. 16]
    J.E. Stephenson, J.Grason: A testability measure for register level digital circuits. Digest of Papers, 6th Int. Symp. Fault Tolerant Computing, 1976, pp. 101–107Google Scholar
  17. 17]
    L. Susskind: Testability and reliability in LSI. PADC-TR-80-384, Final Rep., Jan. 1981Google Scholar
  18. 18]
    E. Wolfang et al.: Electron beam testing of VLSI circuits. IEEE Trans. Electron Devices, Ed-26, 549–559 (1979)Google Scholar
  19. 19]
    Tinghuai Chen, M.A. Breuer: Automatic design for testability via test ability measures. IEEE Trans, on Computer-Aided Design, CAD-4, 3–11(1985)Google Scholar
  20. 20]
    Z. Zhang: The testability analysis and synthesis for digital circuits at module-level. Computer Engineering (Chinese), (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Tinghuai Chen
    • 1
  1. 1.Computer Research InstituteChongqing UniversityChongqingPR China

Personalised recommendations