Advertisement

Timing, Test and Manufacturing Overview

  • Karem A. Sakallah
  • Duncan M. Walker
  • Sani R. Nassif

Abstract

Timing analysis is concerned with estimating and optimizing the performance of integrated circuits. It encompasses a wide range of activities including physical modeling of transistors and interconnect wires, derivation of analytical and empirical gate and wire delay models, accurate estimation of long- and short-path delays through combinational logic, detection of setup and hold violations in sequential circuits, as well as a variety of combinational and sequential circuit transformations aimed at maximizing operation speed. The three papers reviewed here represent particularly significant contributions to the field of timing analysis and optimization: Brand and Iyengar [4] built the foundation for the field of false-path analysis; Szymanski and Shenoy [33] had the last word on the field of timing verification of latch-based circuits; and Shenoy and Rudell [29] are credited with making retiming viable for industrial-sized circuits.

Keywords

Path Delay Combinational Logic Sequential Circuit Timing Verification Delay Fault 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. D. Agrawal, “Synchronous Path Analysis in MOS Circuit Simulator,” DAC, pp. 629–635, 1982.Google Scholar
  2. [2]
    J. Benkoski et al, “Timing Verification Using Statically Sensitizable Paths,” IEEE Trans. CAD, vol. 9, no. 10, pp. 1073–1084, 1990.Google Scholar
  3. [3]
    D. Brand, “Redundancy and Don’t Cares in Logic Synthesis,” IEEE Trans. Computers, vol. C-32, pp. 947–952, 1983.MathSciNetMATHGoogle Scholar
  4. [4]
    D. Brand and V. Iyengar, “Timing Analysis Using Functional Relationships,” ICCAD, pp. 126–129, 1986.Google Scholar
  5. [5]
    D. Brand and V. S. Iyengar, “Timing Analysis Using Functional Analysis,” IEEE Trans. Computers, vol. 37, pp. 1309–1314, 1988.MathSciNetMATHGoogle Scholar
  6. [6]
    H. Chang and J. A. Abraham, “VIPER: An Efficient Vigorously Sensitizable Path Extractor,” DAC, pp. 112–117, 1993.Google Scholar
  7. [7]
    H. Chen and D. H.-C. Du, “Path Sensitization in Critical Path Problem,” IEEE Trans. CAD, vol. 12, no. 2, pp. 196–207, 1993.Google Scholar
  8. [8]
    M. R. Dagenais and N. C. Rumin, “On the Calculation of Optimal Clocking Parameters in Synchronous Circuits with Level-Sensitive Latches,” IEEE Trans. CAD, vol. 8, no. 3, pp. 268–278, March, 1989.Google Scholar
  9. [9]
    S. Devadas, K. Keutzer and S. Malik, “Delay Computation in Combinational Logic Circuits: Theory and Algorithms,” ICCAD, pp. 176–179, 1991.Google Scholar
  10. [10]
    D. H. Du, H. C. Yen and S. Ghanta, “On the General False Path Problem in Timing Analysis,” DAC, pp. 555–560, 1989.Google Scholar
  11. [11]
    R. B. Hitchcock, et al, “Timing Analysis of Computer Hardware,” IBM Journal of Research and Development, vol. 26, no. 1, pp. 100–105, 1982.Google Scholar
  12. [12]
    V M. Hrapcenko, “Depth and Delay in a Network,” Soviet Math. Dokl. (Dokl. Akad. Nauk SSSR), vol. 19, pp. 1006–1009, 1978.Google Scholar
  13. [13]
    A.T. Ishii and M.C. Papaefthymiou, “Efficient Pipelining of Level-Clocked Circuits with Min-Max Propagation Delays,” ACM/IEEE TAU Workshop, 1995.Google Scholar
  14. [14]
    A.T. Ishii, CE. Leiserson and M.C. Papaefthymiou, “Optimizing Two-Phase, Level-Clocked Circuitry,” Journal of the ACM, vol. 44, no. 1, pp. 148–199, Jan. 1997.MathSciNetMATHGoogle Scholar
  15. [15]
    N. P. Jouppi, “Timing Analysis for nMOS VLSI,” DAC, pp. 411–418, 1983.Google Scholar
  16. [16]
    N. P. Jouppi, “Timing Analysis and Performance Improvement of MOS VLSI Designs,” IEEE Trans. CAD, vol. CAD-6, pp. 650–665, 1987.Google Scholar
  17. [17]
    T. I. Kirkpatrick and N. R. Clark, “PERT as an Aid to Logic Design,” IBM Journal of Research and Development, vol. 10, pp. 135–141, 1966.MATHGoogle Scholar
  18. [18]
    K.N. Lalgudi and M.C. Papaefthymiou, “Delay: An Efficient Tool for Retiming with Realistic Delay Modeling,” DAC, pp. 304–309, 1995.Google Scholar
  19. [19]
    C. E. Leiserson and J. B. Saxe, “Optimizing Synchronous Systems,” Journal of VLSI and Computer Systems, vol. 1, pp. 41–67, 1983.MATHGoogle Scholar
  20. [20]
    B. Lockyear and C. Ebeling, “Optimal Retiming of Multi-Phase Level-Clocked Circuits,” Brown/MIT Advanced Research in VLSI and Parallel Systems Conference, pp. 265–280, 1992.Google Scholar
  21. [21]
    P. C. McGeer and R. K. Brayton, “Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network,” DAC, pp. 561–567, 1989.Google Scholar
  22. [22]
    T. M. McWilliams, “Verification of Timing Constraints on Large Digital Systems,” DAC, pp. 139–147, 1980.Google Scholar
  23. [23]
    J. K. Ousterhout, “A Switch-Level Timing Verifier for Digital MOS VLSI,” IEEE Trans. CAD, vol. CAD-4, pp. 336–349, 1985.Google Scholar
  24. [24]
    M.C. Papaefthymiou and K.H. Randall, “TIM: A Timing Package for Two-Phase, Level-Clocked Circuitry,” DAC, pp. 497–502, 1993.Google Scholar
  25. [25]
    M.C. Papaefthymiou, “Understanding Retiming Through Maximum Average-Delay Cycles,” Mathematical Systems Theory, no. 27, pp. 65–84, 1994.MathSciNetMATHGoogle Scholar
  26. [26]
    M.C. Papaefthymiou, “Asymptotically Efficient Retiming Under Setup and Hold Constraints,” ICCAD, pp. 396–401, 1998.Google Scholar
  27. [27]
    S. Perremans, L. Claesen and H. DeMan, “Static Timing Analysis of Dynamically Sensitizable Paths,” DAC, pp. 568–573, 1989.Google Scholar
  28. [28]
    K. A. Sakallah, T. N. Mudge and O. A. Olukotun, “checkTc and minTc: Timing Verification and Optimal Clocking of Synchronous Digital Circuits,” ICCAD, pp. 552–555, 1990.Google Scholar
  29. [29]
    N. Shenoy and R. Rudell, “Efficient Implementation of Retiming,” ICCAD, pp. 226–233, 1994.Google Scholar
  30. [30]
    J. P. M. Silva and K. A. Sakallah, “An Analysis of Path Sensitization Criteria,” ICCAD, pp. 68–72, 1993.Google Scholar
  31. [31]
    S. Z. Sun, D. H. C. Du and H. C. Chen, “Efficient Timing Analysis for CMOS Circuits Considering Data Dependent Delays,” ICCD, pp. 156–159, 1994.Google Scholar
  32. [32]
    T. G. Szymanski, “LEADOUT: A Static Timing Analyzer for MOS Circuits,” ICCAD, pp. 130–133, 1986.Google Scholar
  33. [33]
    T. G. Szymanski and N. Shenoy, “Verifying Clock Schedules,” ICCAD, pp. 124–131, 1992.Google Scholar
  34. [34]
    T. G. Szymanski, “Computing Optimal Clock Schedules,” DAC, pp. 399–404, 1992.Google Scholar
  35. [35]
    S. Unger and C. J. Tan, “Clocking Schemes for High Speed Digital Systems,” IEEE Trans. Computers, vol. C-35, no. 10, pp. 880–895, Oct, 1986.Google Scholar
  36. [36]
    H. Yalcin et al, “Fast and Accurate Timing Characterization Using Functional Information,” IEEE Trans. CAD, vol. 20, pp. 315–331, 2001.Google Scholar
  37. [37]
    S. Kundu, S. M. Reddy and N. K. Jha, “On The Design of Robust Multiple Fault Testable CMOS Combinational Logic Circuits,” ICCAD, pp. 240–243, 1988.Google Scholar
  38. [38]
    S. Kundu, S. M. Reddy and N. K. Jha, “Design of Robustly Testable Combinational Logic Circuits,” IEEE Trans. CAD, vol. 10, no. 8, pp. 1036–1048, Aug. 1991.Google Scholar
  39. [39]
    R. C. Aitken, “An Overview of Test Synthesis Tools,” IEEE Design & Test of Computers, vol. 12, no. 2, pp. 8–15, Summer 1995.Google Scholar
  40. [40]
    S. Devadas and K. Keutzer, “Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines,” ICCAD, pp. 208–211, 1989.Google Scholar
  41. [41]
    G. Hachtel, R. Jacoby, K. Keutzer and C. Morrison, “On Properties of Algebraic Transformation and the Multifault Testability of Multilevel Logic,” ICCAD, pp. 422–425, 1989.Google Scholar
  42. [42]
    M. J. Bryan, S. Devadas and K. Keutzer, “Testability-Preserving Circuit Transformations,” ICCAD, pp. 456–459, 1990.Google Scholar
  43. [43]
    A. Saldanha, R. K. Brayton, A. L. Sangiovanni-Vincentelli and K. T. Cheng, “Timing Optimization With Testability Considerations,” ICCAD, pp. 460–463, 1990.Google Scholar
  44. [44]
    S. Devadas and K. Keutzer, “Synthesis of Robust Delay-Fault-Testable Circuits: Theory,” IEEE Trans. CAD, vol. 11, no. 1, pp. 87–101, Jan. 1992.Google Scholar
  45. [45]
    S. Devadas and K. Keutzer, “Synthesis of Robust Delay-Fault-Testable Circuits: Practice,” IEEE Trans. CAD, vol. 11, no. 3, pp. 277–300, Mar. 1992.Google Scholar
  46. [46]
    T. J. Chakraborty, V. D. Agrawal and M. L. Bushnell, “Improving Path Delay Testability of Sequential Circuits,” IEEE Trans. VLSI, vol. 8, no. 6, pp. 736–741, Dec. 2000.Google Scholar
  47. [47]
    A. S. Touba and E. J. McCluskey, “Automatic Logic Synthesis of Random Pattern Testable Circuits,” ITC, pp. 174–183, 1994.Google Scholar
  48. [48]
    K. Roy, J. A. Abraham and K. De, “Synthesis of Delay Fault Testable Combinational Logic,” ICCAD, pp. 418–421, 1989.Google Scholar
  49. [49]
    M. Chatterjee, D. K. Pradhan and W. Kunz, “LOT: Logic Optimization With Testability - New Transformations Using Recursive Learning,” ICCAD, pp. 318–325, 1995.Google Scholar
  50. [50]
    T. W. Williams, B. Underwood and M. R. Mercer, “The Interdependence Between Delay Optimization of Synthesized Networks and Testing,” DAC, pp. 87–92, 1991.Google Scholar
  51. [51]
    A. Majumdar, R. Jain and K. Saluja, “Incorporating Testability Considerations in High Level Synthesis,” Kluwer Journal of Electronic Testing, Theory and Applications, vol. 5, pp. 43–55, 1992.Google Scholar
  52. [52]
    M. Potkonjak, S. Dey and R. K. Roy, “Behavioral Synthesis Of Area-Efficient Testable Designs Using Interaction Between Hardware Sharing and Partial Scan,” IEEE Trans. CAD, vol. 14, no. 9, pp. 1141–1154, Sept. 1995.Google Scholar
  53. [53]
    K. Lai, C. Papachristou and M. Baklashov, “BIST Testability Enhancement Using High Level Test Synthesis Technique,” IEEE Asian Test Symp., pp. 338–343, 1997.Google Scholar
  54. [54]
    F. Fummi, D. Sciuto and M. Serra, “Synthesis For Testability of Highly Complex Controllers By Functional Redundancy Removal,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1305–1323, Dec. 1999.Google Scholar
  55. [55]
    F. F. Hsu, E. M. Rudnick and J. H. Patel, “Enhancing High-Level Control-Flow For Improved Testability,” ICCAD, pp. 322–328, 1996.Google Scholar
  56. [56]
    S. Ravi, G. Lakshminarayana and N. K. Jha, “A Framework for Testing Core-Based Systems-on-a-Chip,” ICCAD, pp. 385–390, 1999.Google Scholar
  57. [57]
    E. B. Eichelberger and T. W. Williams, “A Logic Design Structure for LSI Testability,” Journal of Design Automation and Fault-Tolerant Computing, vol. 2, pp. 165–178, 1978.Google Scholar
  58. [58]
    S. Narayanan, R. Gupta and M. Breuer, “Configuring Multiple Scan Chains for Minimum Test Time,” ICCAD, pp. 4–8, 1992.Google Scholar
  59. [59]
    C. C. Lin, M. T. C. Lee, M. Marek-Sadowska and K. C. Chen, “Cost-Free Scan: A Low-Overhead Scan Path Design Methodology,” ICCAD, pp. 528–533, 1995.Google Scholar
  60. [60]
    J. Saxena et al, “Scan-Based Transition Fault Testing - Implementation and Low Cost Test Challenges,” ITC, pp. 1120–1129, 2000.Google Scholar
  61. [61]
    L. Whetsel, “Core Test Connectivity, Communication and Control,” ITC, pp. 303–312, 1998.Google Scholar
  62. [62]
    Y. Zorian, E. J. Marinissen and S. Dey, “Testing Embedded-Core-Based System Chips,” IEEE Computer, vol. 32, no. 6, pp. 52–60, June 1999.Google Scholar
  63. [63]
    S. Ozev, I. Bayraktaroglu and A. Orailogiu, “Test Synthesis For Mixed-Signal SOC Paths,” DATE, pp. 128–133, 2000.Google Scholar
  64. [64]
    K. Zarrineh, S. J. Upadhyaya and V. Chickermane, “System-On-Chip Testability Using LSSD Scan Structures,” IEEE Design & Test of Computers, vol. 18, no. 3, pp. 83–97, May-June 2001.Google Scholar
  65. [65]
    P. Nigh and W. Maly, “Layout-Driven Test Generation,” ICCAD, pp. 154–157, 1989.Google Scholar
  66. [66]
    J. P. M. Silva and K. A. Sakallah, “GRASP - A New Search Algorithm for Satisfiability,” ICCAD, pp. 220–227, 1996.Google Scholar
  67. [67]
    W. Mao, R. K. Gulati, D. K. Goel and M. D. Celetti, “QUIETEST: A Quiescent Current Testing Methodology for Detecting Leakage Faults,” ICCAD, pp. 280–283, 1990.Google Scholar
  68. [68]
    H. K. T. Ma, S. Devadas, A. R. Newton and A. Sangiovanni-Vincentelli, “Test Generation for Sequential Finite State Machines,” ICCAD, pp. 288–291, 1987.Google Scholar
  69. [69]
    T. P. Kelsey and K. K. Saluja, “Fast Test Generation for Sequential Circuits,” ICCAD, pp. 354–361, 1989.Google Scholar
  70. [70]
    A. Ghosh, S. Devadas and A. R. Newton, “Test Generation for Highly Sequential Circuits,” ICCAD, pp. 362–366, 1989.Google Scholar
  71. [71]
    M. Geilert, J. Alt and M. Zimmermann, “On the Efficiency of the Transition Fault Model for Delay Faults,” ICCAD, pp. 272–275, 1990.Google Scholar
  72. [72]
    K. Fuchs, F. Fink and M. H. Schulz, “DYNAMITE: An Efficient Automatic Test Pattern Generation System for Path Delay Faults,” IEEE Trans. CAD, vol. CAD-10, no. 10, pp. 1323–1335, Oct. 1994.Google Scholar
  73. [73]
    I. Pomeranz, S. M. Reddy and P. Uppaluri, “NEST: A Non-Enumerative Test Generation Method for Path Delay Faults in Combinational Circuits,” DAC, pp. 439–445, 1993.Google Scholar
  74. [74]
    K. Fuchs, M. Pabst and T. Roessel, “RESIST: A Recursive Test Pattern Generation Algorithm for Path Delay Faults Considering Various Test Classes,” IEEE Trans. CAD, vol. 13, no. 12, pp. 1550–1562, Dec. 1994.Google Scholar
  75. [75]
    C. J. Lin and S. M. Reddy, “On Delay Fault Testing in Logic Circuits,” ICCAD, pp. 148–151, 1986.Google Scholar
  76. [76]
    S. M. Reddy, C. J. Lin and S. Patil, “An Automatic Test Pattern Generator for the Detection of Path Delay Faults,” ICCAD, pp. 284–287, 1987.Google Scholar
  77. [77]
    S. Patil and S. M. Reddy, “A Test Generation System for Path Delay Faults,” ICCAD, pp. 40–43, 1989.Google Scholar
  78. [78]
    P. C. McGeer et al, “Timing Analysis and Delay-Fault Test Generation Using Path-Recursive Functions,” ICCAD, pp. 180–183, 1991.Google Scholar
  79. [79]
    W. Chen, S. Gupta and M. Breuer, “Test Generation for Crosstalk-Induced Delay in Integrated Circuits,” ITC, pp. 191–200, 1999.Google Scholar
  80. [80]
    A. Krstic, J. J. Liou, Y. M. Jiang and K. T. Cheng, “Delay Testing Considering Crosstalk-Induced Effects,” ITC, pp. 558–567, 2001.Google Scholar
  81. [81]
    V. R. Sar-Dessai and D. M. H. Walker, “Resistive Bridge Fault Modeling, Simulation and Test Generation,” ITC, pp. 596–605, 1999.Google Scholar
  82. [82]
    S. Chakravarty et al, “Experimental Evaluation of Scan Tests for Bridges,” ITC, pp. 509–518, 2002.Google Scholar
  83. [83]
    W. Moore, G. Gronthoud, K. Baker and M. Lousberg, “Delay-Fault Testing and Defects in Sub-Micron ICs: Does Critical Resistance Really Mean Anything?” ITC, pp. 95–104, 2000.Google Scholar
  84. [84]
    R. Desineni, K. N. Dwarkanath and R. D. Blanton, “Universal Test Set Generation Using Fault Tuples,” ITC, pp. 812–819, 2000.Google Scholar
  85. [85]
    J. Dworak et al, “Defect-Oriented Testing and Defective-Part-Level Prediction,” IEEE Design & Test of Computers, vol. 18, no. 1, pp. 31–41, Jan.-Feb. 2001.Google Scholar
  86. [86]
    M. Sivaraman and A. J. Strojwas, “Delay Fault Coverage: A Realistic Metric and an Estimation Technique for Distributed Path Delay Faults,” ICCAD, pp. 494–501, 1996.Google Scholar
  87. [87]
    L. W. Nagel, “SPICE2: A Computer Program to Simulate Semiconductor Circuits,” PhD Thesis, University of California, Berkeley, 1975.Google Scholar
  88. [88]
    R. W. Webb and E. W. George, “A Statistical PRocess and Device Simulator (SPADS),” ICCAD, pp. 209–210, 1983.Google Scholar
  89. [89]
    A. J. Strojwas, S. R. Nassif and S. W. Director, “A Methodology for Worst Case Design of Integrated Circuits,” ICCAD, pp. 152–153, 1983.Google Scholar
  90. [90]
    S. R. Nassif, A. J. Strojwas and S. W Director, “FABRICS II: A Statistical Simulator for the IC Manufacturing Process,” IEEE Trans. CAD, vol. CAD-3, no. 1, pp. 40–46, Jan. 1984.Google Scholar
  91. [91]
    S. R. Nassif, “Statistical Worst-Case Analysis for Integrated Circuits,” in Advances in CAD for VLSI: Statistical Analysis of VLSI Circuits Ed. S. W. Director and W. Maly, Elsevier, 1994.Google Scholar
  92. [92]
    S. R. Nassif, A. J. Strojwas and S. W. Director, “A Method for Worst Case Analysis of Integrated Circuits,” IEEE Trans. CAD, vol. CAD-5, no. 1, pp. 104–113, Jan. 1986.Google Scholar
  93. [93]
    H. Walker and S. W Director, “Yield Simulation For Integrated Circuits,” ICCAD, pp. 256–257, 1983.Google Scholar
  94. [95]
    M. Styblinski and L. Opalski, “Software Tools for IC Yield Optimizations with Technological Process Parameters,” ICCAD, pp. 158–160, 1984.Google Scholar
  95. [96]
    W. Maly, “Modeling of Point Defect Related Yield Loss,” ICCAD, pp. 161–163, 1984.Google Scholar
  96. [97]
    S. Liu and K. Singhal “A Statistical Model for MOSFETs,” ICCAD, pp. 78–80, 1985.Google Scholar
  97. [98]
    N. Herr and J. Barnes, “Statistical Modeling for Circuit Simulation of CMOS VLSI,” ICCAD, pp. 81–83, 1985.Google Scholar
  98. [99]
    D. Hocevar, P. Cox and P. Yang, “Parameteric Yield Optimization for VLSI,” ICCAD, pp. 312–314, 1985.Google Scholar
  99. [100]
    H. Walker and S. W. Director, “VLASIC: A Yield Simulator for Integrated Circuits,” ICCAD, pp. 318–320, 1985.Google Scholar
  100. [101]
    K. Antreich and H. Graeb, “Circuit Optimization by Worst Case Distances,” ICCAD, pp. 166–169, 1991.Google Scholar
  101. [102]
    S. Aftab and M. Styblinski, “A New Efficient Approach to Statistical Delay Modeling of CMOS Digital Combinational Circuits,” ICCAD, pp. 200–203, 1994.Google Scholar
  102. [103]
    E. Felt, A. Narayan and A. Sangiovanni-Vincentelli, “Measurerment and Modeling of MOS Transistor Current Mismatch in Analog ICs,” ICCAD, pp. 272–277, 1994.Google Scholar
  103. [104]
    W Maly, H. Heineken, J. Khare and P. K. Nag, “Design for Manufacturability in Submicron Domain,” ICCAD, pp. 690–697, 1996.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Karem A. Sakallah
    • 1
  • Duncan M. Walker
    • 2
  • Sani R. Nassif
    • 3
  1. 1.Electrical Engineering and Computer Science DepartmentUniversity of MichiganAnn ArborUSA
  2. 2.Department of Computer ScienceTexas A&M UniversityCollege StationUSA
  3. 3.IBM ResearchAustinUSA

Personalised recommendations