By Topic

Traffic: a novel geometric algorithm for fast wire-optimized floorplanning

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

2 Author(s)
Sassone, P.G. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA ; Sung Kyu Lim

As the size and complexity of very large scale integrated (VLSI) circuits increase, the need for faster floorplanning algorithms also grows. This paper introduces trapezoidal floorplanning for integrated circuits (Traffic), a new method for creating wire- and area-optimized floorplans. Through the use of connectivity grouping, simple geometry, and a constrained brute-force approach, Traffic achieves an average of 18% lower wire estimate than simulated annealing (SA) in orders of magnitude less time. This speed allows designers to rapidly explore a large circuit design space, to evaluate small changes to big circuits, to fit bounding boxes, and to produce initial solutions for other floorplanning algorithms

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:25 ,  Issue: 6 )