By Topic

Congestion based layer assignment of global routing

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

Congestion is a basic but important objective of multilayer routing problem. Global routing, layer assignment and detailed routing are general stages of multilayer routing. In layer assignment stage, reasonable congestion of routing layer will help to promote routability of follow-up detail routing process. A new congestion based layer assignment algorithm, with the goal of min layer number and via number, is proposed in this paper. This algorithm first acquires heuristic optimal (or near optimal) initial solution by the dynamic assessment of routing resources, and then optimizes the initial solution further by simulated annealing method, and at last minimizes the number of routing layers while the distribution of global routing segments of nets is uniform on each layer. The proposed algorithm has been implemented and tested with industrial circuits and the experimental results are very promising.

Published in:

ASIC, 2003. Proceedings. 5th International Conference on  (Volume:1 )

Date of Conference:

21-24 Oct. 2003