Scheduled Maintenance on April 29th, 2016:
IEEE Xplore will be unavailable for approximately 1 hour starting at 11:30 AM EDT. We apologize for the inconvenience.
By Topic

Graph-based approach to evaluate net routability of a floorplan

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

3 Author(s)
N. Waropas ; Dept. of Electr. & Comput. Eng., Portland State Univ., OR, USA ; K. Rajendar ; M. Chrzanowska-Jeske

This paper presents a fast graph-based algorithm to evaluate routability of a floorplan. A simplified global routing problem is formulated as a constrained maximum independent set problem, and we use a limited number of routing options within a given number of routing layers. To test our approach, we use floorplans generated by the ELF-SP floorplanner that uses an evolutionary algorithm in conjunction with Lagrangian Relaxation. Experimental results show the effectiveness of our method.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003