System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Bounds on the number of slicing, mosaic, and general floorplans

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)
Shen, Z.C. ; Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA ; Chu, C.C.N.

A floorplan can be defined as a rectangular dissection of the floorplan region. Simple and tight asymptotic bounds on the number of floorplans for different dissection structures help us to evaluate the size of the solution space of different floorplan representation. They are also interesting theoretically. However, only loose bounds exist in the literature. In this paper, we derive tighter asymptotic bounds on the number of slicing, mosaic and general floorplans. Consider the floorplanning of n blocks. For slicing floorplan, we prove that the exact number is n!((-1)n+1/2)Σk=0n(3+√8)n-2k(k12/)(n - k12/) and the tight bound is Θ(n!22.543n/n1.5) [9] . For mosaic floorplan, we prove that the tight bound is Θ(n!23n/n4). For general floorplan, we prove a tighter lower bound of Ω(n!23n/n4) and a tighter upper bound of O(n!25n/n4.5).

Published in:

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