Bounded 2D contour searching algorithm for floorplan design with arbitrary shaped rectilinear and soft modules

15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we present a novel floor planning algorithm to optimize the floor plan with a arbitrarily shaped rectilinear and soft blocks. The floor plan quality of this algorithm is demonstrated by randomly generated artificial examples and a real industrial example. The experimental results on the randomly generated cases demonstrate that the algorithm can find a floor plan with average area utilization 91. 8% for cases ranging from 4 to 1600 blocks. The test results on industrial example demonstrate that this algorithm can potentially be used to generate high quality floor plans for a wide range of design styles (pure custom blocks, gate array, standard cells, mixed mode cases etc. )

Cite

CITATION STYLE

APA

Lee, T. chang. (1993). Bounded 2D contour searching algorithm for floorplan design with arbitrary shaped rectilinear and soft modules. In Proceedings - Design Automation Conference (pp. 525–530). Publ by IEEE. https://doi.org/10.1145/157485.165014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free