NobleBlocks
Public

A path selection algorithm for timing analysis

Published • Jan 6, 2003
NobleIDNI2P47W75R52S95
Authors:
Horng-Yuan Yen
,
S. Ghanta
,
H.C. Du

Abstract

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 ge...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!