Cart (Loading....) | Create Account
Close category search window
 

Timing-driven obstacles-avoiding routing tree construction for a multiple-layer system

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

4 Author(s)
Hsin-Hsiung Huang ; Dept. of Electron. Eng., Chung Yuan Christian Univ., Chungli ; Hui-Yu Huang ; Yu-Cheng Lin ; Tsai-Ming Hsieh

In this paper, we formulate the timing-driven multiple-layer obstacle-avoiding rectilinear Steiner minimal tree (TML-OARSMT) problem and propose an algorithm to solve the problem. The objective is simultaneously to minimize the maximum source-to-terminal length and minimize the number of vias. The proposed algorithm contains the three steps, including the multiple-level timing-driven partitioning, the multiple-level routing tree construction with obstacles, and the timing-driven multiple-layer balanced tree construction. Compared with the traditional method, the partition-based method can significantly improve the maximum source-to-terminal length and the total wirelength by 11.3% and 10.9% respectively with the additional number of vias.

Published in:

Circuits and Systems, 2008. ISCAS 2008. IEEE International Symposium on

Date of Conference:

18-21 May 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.