2008
DOI: 10.1145/1297666.1297686
|View full text |Cite
|
Sign up to set email alerts
|

Low-power gated and buffered clock network construction

Abstract: We propose an efficient algorithm to construct a low-power zero-skew gated clock network, given the module locations and activity information. Unlike previous works, we consider masking logic insertion and buffer insertion simultaneously, and guarantee to yield a zero-skew clock tree. Both the logical and physical information of the modules are carefully taken into consideration when determining where masking logic should be inserted. We also account for the power overhead of the control signals so that the to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
19
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(19 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…The length of the activity pattern is 10000 for every benchmark. Previous works were proposed with loose constraint on slew or driving power supply, for instance, ≤ 20 × C g for a buffer or gate insertion in [17,16]. The work in [14] did not involve clock routing and synthesis.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The length of the activity pattern is 10000 for every benchmark. Previous works were proposed with loose constraint on slew or driving power supply, for instance, ≤ 20 × C g for a buffer or gate insertion in [17,16]. The work in [14] did not involve clock routing and synthesis.…”
Section: Resultsmentioning
confidence: 99%
“…The algorithm constructed the topology in a bottom-up procedure, with the objective of switched capacitance minimization. Further on, in [17] a comprehensive technique with a recursive computation on effective switched capacitance and a solution sampling on merging segment set was discussed.…”
Section: Introductionmentioning
confidence: 99%
“…This latch is being added to the circuit such that it can boost the signals so that the clock gating is efficient. By the use of the above explained clock gating design, the normal gated clock tree can be formed as in fig 2.This design [5], as it is evitable that the area it occupies is small, but the skew is obviously added in addition to the design's skew. …”
Section: Gated Clock Treementioning
confidence: 99%
“…Recently, a comprehensive technique [31] was proposed. It is composed of a recursive computation on effective switched capacitance and a solution sampling method based on merging segment set.…”
mentioning
confidence: 99%
“…A binary clock tree is constructed in a bottom-up course. In PACTS, we apply the same slew constraint as those previous clock gating works [30], [31]. Based on the nearest-neighbor-selection (NNS) [15] binary tree topology construction, we propose a novel simultaneous gate/buffer insertion method to reduce the power.…”
mentioning
confidence: 99%