Existing algorithms for timing analysis have difficulties when dealing with large designs. A novel algorithm for timing analysis is proposed that enumerates all the paths with delay greater than a given threshold. The execution time of the proposed algorithm is proportional to the number of paths generated, so it is suitable for large designs.
|Original language||English (US)|
|Title of host publication||Proceedings - Design Automation Conference|
|Publisher||Publ by IEEE|
|Number of pages||4|
|State||Published - Dec 1 1988|
|Name||Proceedings - Design Automation Conference|