ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187)
DOI: 10.1109/iscas.1998.705219
|View full text |Cite
|
Sign up to set email alerts
|

Path resizing based on incremental technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…This tool allows to consider an user specified limited number of paths [11][12], for easy application and validation of the different path optimization criteria. The delay model implemented in this tool is based on an analytical representation of the timing performance, allowing to obtain for any logic gate, in its environment, an accurate evaluation of its switching delay and output transition time.…”
Section: Optimization Toolmentioning
confidence: 99%
“…This tool allows to consider an user specified limited number of paths [11][12], for easy application and validation of the different path optimization criteria. The delay model implemented in this tool is based on an analytical representation of the timing performance, allowing to obtain for any logic gate, in its environment, an accurate evaluation of its switching delay and output transition time.…”
Section: Optimization Toolmentioning
confidence: 99%
“…This tool allows to consider an user specified limited number of paths [11][12], for easy application and validation of the different path optimization criteria. The delay model implemented in this tool is based on a design oriented closed-form representation of the timing performance, allowing to obtain for any logic gate, in its environment, an accurate evaluation of its switching delay and output transition time.…”
Section: Optimization Toolmentioning
confidence: 99%
“…The implemented incremental technique allows to obtain as well the enumeration in a non increasing order of delays of the longest paths [14] than the classification in an increasing order of delays of the shortest paths. We limit here our presentation to the shortest path search.…”
Section: Incremental Search Path Algorithmmentioning
confidence: 99%