Proceedings of the 30th International on Design Automation Conference - DAC '93 1993
DOI: 10.1145/157485.164653
|View full text |Cite
|
Sign up to set email alerts
|

Reliable non-zero skew clock trees using wire width optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0

Year Published

1996
1996
2014
2014

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(34 citation statements)
references
References 9 publications
0
34
0
Order By: Relevance
“…Useful non-zero skew routing [8,15] becomes more important for the sake of timing [3] and power/ground noise reduction [1].…”
Section: 1mentioning
confidence: 99%
See 1 more Smart Citation
“…Useful non-zero skew routing [8,15] becomes more important for the sake of timing [3] and power/ground noise reduction [1].…”
Section: 1mentioning
confidence: 99%
“…The unwanted skew variations are not only harmful to timing performance but also difficult to control, because reliable estimations on the variations are generally not available during the stage of clock network design. Aimed to solve the skew variation problem, numerous clock routing works have been proposed [8][9][10][11][12][13]. Among these works, non-tree topology [9][10][11][12][13] is a promising approach, since a clock signal that propagates through multiple paths can compensate each other on variations.…”
Section: Introductionmentioning
confidence: 99%
“…The contrast between synthesizing a signal net and a clock tree is that for a signal net, the design target is to minimize the maximum delay from the signal source to any of its sign signal collectors, while a clock signal needs to be dispersed to [21], iterative algorithms are utilized to diminish clock delay and clock skew through wire sizing focused around sensitivity data. Zeng et al [22] propose a three-stage improvement algorithm, i.e., buffer insertion, skew and delay optimization, to minimize the skew and delay of a clock tree.…”
Section: Literature Surveymentioning
confidence: 99%
“…Many works ( [19], [9], [23], [15], [14], [17]) have applied wire sizing to minimize skew in clock trees. Tsai et al [19] propose a dynamic programming method for simultaneous buffer insertion and wire sizing to optimize delay and power of a given zero-skew or useful-skew clock tree.…”
Section: Related Workmentioning
confidence: 99%