Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Efficiency improvement for slicing point placements

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

1 Author(s)
Thio, P.E. ; Fac. of Electr. Eng., Delft Univ. of Technol., Netherlands

A package implemented for floorplan optimization is discussed. It contains algorithms for finding optimal sliced rectangle dissections consistent with initial data structures such as point placements, partitioning trees, slicing trees, and floorplans. Among these point slicing achieves relatively high area utilization. Although the worst-case time complexity of the algorithm is polynomial in the number of rectangles (O(n6)), average case time and memory usage is high. A strategy to reduce these complexities while keeping a near-optimal solution likely is introduced. Also a selection of more wirable dissections among those with equal contour score is presented

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993