Imperial College London > Talks@ee.imperial > CAS Talks > Input-dependent Static Timing Analysis (iSTA)

Input-dependent Static Timing Analysis (iSTA)

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact George A Constantinides.

Conventional Static Timing Analysis (STA) has been embraced for many years to compute the expected timing of digital circuits. This is achieved by leveraging on the circuit topology and the timing information of individual nodes and edges. Ignoring the logic functionality of the circuit results in a conservative approach which computes only the worst timing across all the possible input transitions and does not detect false-paths natively. In this talk, I’ll introduce an approach called iSTA (input-dependent STA ) which simultaneously addresses these concerns. iSTA generates a circuit path-delay distribution, where each path-delay has an associated probability, rather than a single worst-case timing value. This results in a significant higher computational cost compared to the classical STA approach. For this reason, I’ll also present a mathematically rigorous way to approximate the path-delay distribution, leading to a controlled trade-off between solution accuracy and analysis time.

This talk is part of the CAS Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Changes to Talks@imperial | Privacy and Publicity