By Topic

Clock tree tuning using shortest paths polygon

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
$31 $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

3 Author(s)
Saaied, H. ; Concordia Univ., Montreal, Que., Canada ; Al-Khalili, D. ; Al-Khalili, A.J.

A model to facilitate a better routing of a multiterminal net under obstacle constraints is presented. The model is applied to the clock tree routing problem. Using this model, in conjunction with simple routines, all possible locations of a Steiner node in the routing plane are determined. As a result, less wire length is achieved compared to other methods. The model has been incorporated in a local modification algorithm to efficiently implement engineering change orders (ECOs) of clock trees.

Published in:

SOC Conference, 2004. Proceedings. IEEE International

Date of Conference:

12-15 Sept. 2004