Skip to main content

Delay Models and Exact Timing Analysis

  • Chapter
Logic Synthesis and Optimization

Abstract

We consider anew the false path problem in timing verification. We argue that any solution to the false path problem inherently incorporates a delay model, and the answer is given in the context of this model. We make explicit the delay model underlying both the “floating” and “transition” sensitization computations, and give the basic assumption underying gate sensitization. We extend sensitization 88theory for the delay model underlying the ”floating mode“ computation to general (complex, possibly asymmetric) gates. This leads to the ability to compute the exact delay of a circuit under the given delay model. We give a new delay model and sensitization computation for ”transition mode“ under a bounded delay model and show that for every bounded delay model there is a natural time quantum such that on each integer-multiple bounded interval of the quantum every signal is a constant. Algorithms for exact delay computation for both floating mode and transition mode delay are given. An implementation for the floating mode model yields practical results on large benchmark circuits.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Augustin. An algebra of waveforms. Technical Report, Computer Systems Laboratory, Stanford University, 1989.

    Google Scholar 

  2. J. Benkoski, E. Meesch, L. Claesen, and H. DeMan. Efficient algorithms for solving the false path problem in timing verification. In IEEE International Conference on Computer-Aided Design, 1987.

    Google Scholar 

  3. D. Brand and V. Iyengar. Timing analysis using functional analysis. Technical Report RC 11768, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 10598, 1986.

    Google Scholar 

  4. J. Burch. Delay models for verifying speed-independent asynchronous circuits. In The Proceedings of the ACM international Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (r ‘82), 1992.

    Google Scholar 

  5. H-C. Chen and D. Du. On the critical path problem. In ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (r ‘80), 1990.

    Google Scholar 

  6. S. Devadas, K. Keutzer, and S. Malik. Delay computation in combinational logic circuits: Theory and algorithms. In IEEE International Conference on Computer-Aided Design, 1991.

    Google Scholar 

  7. S. Devadas, K. Keutzer, S. Malik, and A. Wang. Certified timing verification and the transition delay of a logic circuit. In The Proceedings of the ACM international Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (r ’92), 1992.

    Google Scholar 

  8. D. Du, Steve H. Yen, and S. Ghanta. On the general false path problem in timing analysis. In Design Automation Conference, 1989.

    Google Scholar 

  9. S-T. Huang, T-M. Pang, and J-M. Shyu. A new approach to solving false path problem in timing analysis. In IEEE International Conference on Computer-Aided Design, 1991.

    Google Scholar 

  10. P. McGeer, A. Saldanha, P. Stephan, R. Brayton, and A. SangiovanniVincentelli. Timing analysis and delay-fault test generation using path recursive functions. In IEEE International Conference on Computer-Aided Design, 1991

    Google Scholar 

  11. P. McGeer and R. Brayton. Efficient algorithms for computing the longest viable path in a combinational network. In Design Automation Conference, 1989.

    Google Scholar 

  12. P. McGeer and R. Brayton. Provably correct critical paths. In Decennial Cal Tech VLSI Conference, 1989.

    Google Scholar 

  13. P. McGeer and R. Brayton. Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and its Implications. Kluwer Academic Publishers, 1991.

    Book  MATH  Google Scholar 

  14. C.-J. Seger. A bounded delay race model. In IEEE International Conference on Computer-Aided Design, Nov. 1989.

    Google Scholar 

  15. C.-J. Seger and J. Brzozowski. Advances in Asynchronous Circuit Theory. In Preparation, 1992.

    Google Scholar 

  16. J. Silva, K. Sakallah, and L. Vidigal. FPD: An environment for exact timing analysis. In IEEE International Conference on Computer-Aided Design, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

McGeer, P.C., Saldanha, A., Brayton, R.K., Sangiovanni-Vincentelli, A.L. (1993). Delay Models and Exact Timing Analysis. In: Sasao, T. (eds) Logic Synthesis and Optimization. The Kluwer International Series in Engineering and Computer Science, vol 212. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3154-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3154-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6381-1

  • Online ISBN: 978-1-4615-3154-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics