ACM Home Page
Please provide us with feedback. Feedback
Register binding for clock period minimization
Full text PdfPdf (807 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 28: high-level exploration and optimization table of contents
Pages: 439 - 444  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Shih-Hsu Huang  Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.
Chun-Hua Cheng  Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.
Yow-Tyng Nieh  Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.
Wei-Chieh Yu  Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1146909.1147026
What is a DOI?

ABSTRACT

In modern high-speed circuit design, the clock skew has been widely utilized as a manageable resource to improve the circuit performance. However, in high-level synthesis stage, the circuit is never optimized for the utilization of clock skew. This paper is the first attempt to the high-level synthesis of non-zero clock skew circuits. First, we show that the register binding in high-level synthesis stage has a significant impact on the clocking constraints between registers. As a result, different register binding solutions lead to different smallest feasible clock periods. Then, based on that observation, we formulate the problem of register binding for clock period minimization. Given a constraint on the number of registers, our objective is to find a minimum-period register binding solution. Experimental data show that, in most benchmark circuits, the lower bound of the clock period can be achieved without any extra overhead on the number of registers.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
R.B. Deokar and S.S. Sapatnekar, "A Graph-Theoretic Approach to Clock Skew Optimization," Proc. of IEEE International Symposium on Circuits and Systems, vol. 1, pp. 407--410, 1994.
 
3
4
 
5
C. Tseng and D.P. Siewiorek, "Automatic Synthesis of Data Paths in Digital Systems," IEEE Trans. on Computer-Aided Design," vol. 5, no. 3, pp. 379--395, 1986.
 
6
 
7
 
8
S.H. Huang and C.H. Cheng, "A Formal Approach to the Slack Driven Scheduling Problem in High Level Synthesis," Proc. of IEEE International Symposium on Circuits and Systems, pp. 5633--5636, 2005.
 
9


Collaborative Colleagues:
Shih-Hsu Huang: colleagues
Chun-Hua Cheng: colleagues
Yow-Tyng Nieh: colleagues
Wei-Chieh Yu: colleagues