AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (119.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Incremental Placement-Based Clock Network Minimization Methodology

Qiang ZHOU( )Yici CAILiang HUANGXianlong HONG
Department of Automation, Tsinghua University, Beijing 100084, China
Show Author Information

Abstract

Power is the major challenge threatening the progress of very large scale integration (VLSI) technology development. In ultra-deep submicron VLSI designs, clock network size must be minimized to reduce power consumption, power supply noise, and the number of clock buffers which are vulnerable to process variations. Traditional design methodologies usually let the clock router independently undertake the clock network minimization. Since clock routing is based on register locations, register placement actually strongly influences the clock network size. This paper describes a clock network design methodology that optimizes register placement. For a given cell placement result, incremental modifications are performed based on the clock skew specifications by moving registers toward preferred locations that may reduce the clock network size. At the same time, the side-effects to logic cell placement, such as signal net wirelength and critical path delay, are controlled. Test results on benchmark circuits show that the methodology can considerably reduce clock network size with limited impact on signal net wirelength and critical path delay.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 78-84

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
ZHOU Q, CAI Y, HUANG L, et al. Incremental Placement-Based Clock Network Minimization Methodology. Tsinghua Science and Technology, 2008, 13(1): 78-84. https://doi.org/10.1016/S1007-0214(08)70013-0

0

Views

0

Downloads

0

Crossref

N/A

Web of Science

0

Scopus

0

CSCD

Received: 05 September 2006
Revised: 27 August 2007
Published: 01 February 2008
© Tsinghua University Press 2008