An analytic optimization technique for placement of macro-cells
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
VLSI cell placement techniques
ACM Computing Surveys (CSUR)
Parallel algorithms for slicing based final placement
EURO-DAC '92 Proceedings of the conference on European design automation
Rectangle-packing-based module placement
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
VLSI/PCB placement with obstacles based on sequence-pair
Proceedings of the 1997 international symposium on Physical design
Arbitrary rectilinear block packing based on sequence pair
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
The multi-BSG: stochastic approach to an optimum packing of convex-rectilinear blocks
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Automatic placement a review of current techniques (tutorial session)
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
MMP: a novel placement algorithm for combined macro block and standard cell layout design
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Some issues raised in physical design workshop 1987
ACM SIGDA Newsletter
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region
EURO-DAC '90 Proceedings of the conference on European design automation
A cyberphysical synthesis approach for error recovery in digital microfluidic biochips
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
This paper presents a novel mathematical formulation to the placement of arbitrarily sized rectangles that simultaneously account for the topological and geometrical characteristics of the placement problem. Special attention is paid to maintain the continuity of the formulation. Two examples are given to demonstrate the performance of the algorithm. Identical placement is obtained from two different initial placements of an example which has 8 movable components and 29 signal nets. For a practical example with 15 movable blocks and 142 signal nets, a final placement which is manual solution comparable is obtained using random initial positions.