论文信息 - A New Algorithm for Floorplan Design

A New Algorithm for Floorplan Design

We present in this paper a new algorithm for floorplan design using the method of simulated annealing. The major contributions of the paper are: 1. A new representation of floorplans (normalized Polish expressions) which enables us to carry out the neighborhood search effectively. 2. A simultaneous minimization of area and total interconnection length in the final solution. Experimental results indicate that the algorithm performs well in many test problems.

C. L. Liu | D. F. Wong

[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.

[4] William R. Heller,et al. The Planar Package Planner for System Designers , 1982, DAC 1982.

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

[6] Ulrich Lauther,et al. A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[7] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[8] Hon Wai Leong,et al. SIMULATED-ANNEALING CHANNEL ROUTER. , 1985 .

[9] Larry J. Stockmeyer,et al. Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[10] R. Otten. Automatic Floorplan Design , 1982, DAC 1982.