Path selection algorithm for timing analysis.

H. C. Yen, S. Ghanta, H. C. Du

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations


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 languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Number of pages4
ISBN (Print)0818688645
StatePublished - Dec 1 1988

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Cite this