By Topic

Clock-tree routing with single buffer-block allocation strategy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chuen-Yau Chen ; Dept. of Electr. Eng., Nat. Yunlin Univ. of Sci. & Technol., Touliu, Taiwan ; Pei-Chia Yang

In this paper, we propose a method combining the concepts of buffer-insertion with global-routing to build a zero-skew clock tree with less latency. First, we allocate a single buffer-block for buffer insertion in the chip. Perform global routing by treating the single buffer-block as the same as the other building blocks. Estimate the wire loads and determine the number and size of the buffer to be inserted in each path. This approach can achieve a zero-skew clock tree with a lower routing complexity. The simulation results have verified the feasibility

Published in:

48th Midwest Symposium on Circuits and Systems, 2005.

Date of Conference:

7-10 Aug. 2005