| Autor: |
Tai-Ming Parng, Shiang-Tang Huang, Jyuo-Min Shyu |
| Rok vydání: |
2002 |
| Předmět: |
|
| Zdroj: |
1993 European Conference on Design Automation with the European Event in ASIC Design. |
| DOI: |
10.1109/edac.1993.386433 |
| Popis: |
It is shown that during performance optimization some false paths may become sensitizable and that the selection of critical paths needs to consider some false paths besides sensitizable paths. These critical paths are called candidate paths. Techniques for extracting candidate paths, and an effective graph model for representing and manipulating the huge number of candidate paths have been developed. The speed and memory utilization of the proposed method are demonstrated using ISCAS benchmark circuits. > |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
