A building block placement tool

When designing integrated circuits, sub-components rarely end up being perfectly rectangular. However, currently most block-placers only consider rectangular components, resulting in inefficient area utilization. We propose a placement tool that allows arbitrarily sized and shaped convex components. It extends the rectangle-packing method proposed by Kajitani. We describe the methods used to create the placement and give some performance results.

[1]  Naveed A. Sherwani.  VLSI Physical Design Automation , 1995 .

[2]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[3]  Hidetoshi Onodera,et al.  Branch-and-Bound Placement for Building Block Layout , 1993 .

[4]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[5]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Ernest S. Kuh,et al.  A Dynamic and Efficient Representation of Building-Block Layout , 1987, 24th ACM/IEEE Design Automation Conference.

[7]  Yoji Kajitani,et al.  Rectangle-packing-based module placement , 1995, ICCAD.

[8]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.