Sequence-pair approach for rectilinear module placement

With the recent advent of deep sub-micron technology and new packaging schemes such as multichip modules, integrated circuit components are often not rectangular. Most existing block placement approaches, however, only deal with rectangular blocks, resulting in inefficient area utilization. New approaches which can handle arbitrarily shaped blocks are essential to achieve high-performance design. In this paper, we extend the sequence-pair approach for rectangular block placement to arbitrarily sized and shaped rectilinear blocks. Experimental results show that our algorithm achieves results with excellent area utilization.

[1]  Jin Xu,et al.  Rectilinear block placement using sequence-pair , 1998, ISPD '98.

[2]  Chung-Kuan Cheng,et al.  Module Placement Based on Resistive Network Optimization , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  'Zone-refining' techniques for IC layout compaction , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Wayne Wei-Ming Dai,et al.  General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[5]  Bryan Preas,et al.  Placement Algorithms for Arbitrarily Shaped Blocks , 1979, 16th Design Automation Conference.

[6]  D. F. Wong,et al.  FLOORPLAN DESIGN FOR RECTANGULAR AND L-SHAPED MODULES. , 1987 .

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

[8]  Tsu-Chang Lee,et al.  A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules , 1993, 30th ACM/IEEE Design Automation Conference.