Proceedings of the 36th Annual ACM/IEEE Design Automation Conference 1999
DOI: 10.1145/309847.310045
|View full text |Cite
|
Sign up to set email alerts
|

Functional timing analysis for IP characterization

Abstract: A method that characterizes the timing of Intellectual Property (IP) blocks while taking into account IP functionality is presented. IP blocks are assumed to have multiple modes of operation specified by the user. For each mode, our method calculates IO path delays and timing constraints to generate a timing model. The method thus captures the mode-dependent variation in IP delays which, according to our experiments, can be as high as 90%. The special manner in which delay calculation is performed guarantees t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2001
2001
2009
2009

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…For this reason, no assumption about the arrival times at the inputs should be made. On the contrary, the maximum input-output delays M ij in (12) are exclusively timing characteristics of the module.…”
Section: Timing Model Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…For this reason, no assumption about the arrival times at the inputs should be made. On the contrary, the maximum input-output delays M ij in (12) are exclusively timing characteristics of the module.…”
Section: Timing Model Formulationmentioning
confidence: 99%
“…In the black-box style, the input-output delay matrix of a module is directly used to represent its timing information. To reduce the size of the delay matrix, the assumption made in [10]- [12] that the timing of a module is mainly determined by a subset of the inputs (control signals) of the module can be applied. Contrary to using the delay matrix directly, the gray-box style method transforms the original netlist to a much smaller one by discarding structural details but maintaining the same input-output delays.…”
Section: Introductionmentioning
confidence: 99%