Timing analysis of complex state-of-the-art designs demands efficient algorithms able to cope with design complexity. Exploring the hierarchical information generally encountered in complex designs became mandatory to perform functional timing analysis (FTA) in acceptable execution times. Although several hierarchical FTA approaches exist, only path-based hierarchical FTA is able to identify global critical paths, thus helping designers in the optimization task. In this paper we propose two versions of path-based hierarchical FTA strategies. These versions are compared to flat-mode FTA and to commercial FTA tools that operate in hierarchical mode. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ferrão, D. L., Reis, R., & Güntzel, J. L. (2006). Considering zero-arrival time and block-arrival time in hierarchical functional timing analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4148 LNCS, pp. 301–310). Springer Verlag. https://doi.org/10.1007/11847083_29
Mendeley helps you to discover research relevant for your work.