TFA: a threshold-based filtering algorithm for propagation delay and slew calculation of high-speed VLSI interconnects

  • Authors:
  • S. Abbaspour;A. H. Ajami;M. Pedram;E. Tuncer

  • Affiliations:
  • University of Southern California, Los Angeles, CA;Magma Design Automation, Santa Clara, CA;University of Southern California, Los Angeles, CA;Magma Design Automation, Santa Clara, CA

  • Venue:
  • Proceedings of the 14th ACM Great Lakes symposium on VLSI
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes an efficient threshold-based filtering algorithm (TFA) for calculating the interconnect delay and slew (transition time) in high-speed VLSI circuits. The key idea is to divide the circuit nets into three groups of low, medium and high complexity nets, whereby for low and medium complexity nets either the first moment of the impulse response or the first and second moments are used. For the high-complexity nets, which are encountered infrequently, TFA resorts to the AWE method. The key contribution of the paper is to come up with very effective and efficient way of classifying the nets into these three groups. Experimental results show that on a large industrial circuit using a state-of-the-art commercial timing analysis that incorporates TFA, we were able to achieve delay and slew estimation accuracies that are quite comparable with the full-blown AWE-based calculators at runtimes that were only 14% higher than those of a simple Elmore-delay calculator.